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-sorted_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-10 16:31:48,060 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-10 16:31:48,062 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-10 16:31:48,070 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-10 16:31:48,071 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-10 16:31:48,071 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-10 16:31:48,072 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-10 16:31:48,073 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-10 16:31:48,074 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-10 16:31:48,074 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-10 16:31:48,075 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-10 16:31:48,075 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-10 16:31:48,076 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-10 16:31:48,076 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-10 16:31:48,077 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-10 16:31:48,078 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-10 16:31:48,079 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-10 16:31:48,080 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-10 16:31:48,080 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-10 16:31:48,081 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-10 16:31:48,082 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-10 16:31:48,082 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-10 16:31:48,082 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-10 16:31:48,083 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-10 16:31:48,083 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-10 16:31:48,084 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-10 16:31:48,084 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-10 16:31:48,085 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-10 16:31:48,085 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-10 16:31:48,085 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-10 16:31:48,085 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-10 16:31:48,086 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:31:48,098 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-10 16:31:48,098 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-10 16:31:48,099 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-10 16:31:48,099 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-10 16:31:48,099 INFO L133 SettingsManager]: * Use SBE=true [2018-04-10 16:31:48,100 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-10 16:31:48,100 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-10 16:31:48,100 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-10 16:31:48,100 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-10 16:31:48,100 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-10 16:31:48,100 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-10 16:31:48,100 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-10 16:31:48,101 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-10 16:31:48,101 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-10 16:31:48,101 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-10 16:31:48,101 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-10 16:31:48,101 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-10 16:31:48,101 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-10 16:31:48,102 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-10 16:31:48,102 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 16:31:48,102 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-10 16:31:48,102 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-10 16:31:48,102 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-10 16:31:48,102 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-04-10 16:31:48,129 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-10 16:31:48,140 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-10 16:31:48,143 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-10 16:31:48,144 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-10 16:31:48,144 INFO L276 PluginConnector]: CDTParser initialized [2018-04-10 16:31:48,145 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,507 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG2f80e467d [2018-04-10 16:31:48,636 INFO L287 CDTParser]: IsIndexed: true [2018-04-10 16:31:48,636 INFO L288 CDTParser]: Found 1 translation units. [2018-04-10 16:31:48,637 INFO L168 CDTParser]: Scanning dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,644 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-10 16:31:48,644 INFO L215 ultiparseSymbolTable]: [2018-04-10 16:31:48,644 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-10 16:31:48,644 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,644 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-10 16:31:48,644 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____time_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,645 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____timer_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,645 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____intptr_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,645 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pthread_mutexattr_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,645 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__size_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,645 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__idtype_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,645 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____fsfilcnt_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,645 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__int8_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,645 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____ssize_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,645 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pid_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,645 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__int32_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,645 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____socklen_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,646 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__ino_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,646 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____u_short in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,646 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__key_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,646 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____blkcnt64_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,646 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__mode_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,646 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__ldiv_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,646 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____fsfilcnt64_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,646 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__fsfilcnt_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,646 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pthread_mutex_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,646 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____rlim_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,646 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__time_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,647 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__div_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,647 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__off_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,647 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__gid_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,647 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__caddr_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,647 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__u_short in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,647 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pthread_rwlock_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,647 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____mode_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,647 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__blksize_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,647 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pthread_once_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,647 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____uint32_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,647 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____caddr_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,648 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____dev_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,648 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____fsblkcnt_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,648 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__u_quad_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,648 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pthread_key_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,648 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__fd_set in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,648 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pthread_barrierattr_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,648 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__register_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,648 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____int64_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,648 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____useconds_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,648 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____uint8_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,648 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____daddr_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,648 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____key_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,648 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____int8_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,648 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__loff_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,648 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__u_int64_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,648 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__daddr_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,648 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__int64_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____uint16_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__fsid_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____rlim64_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____qaddr_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____clock_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____blksize_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pthread_condattr_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____u_quad_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pthread_barrier_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____pid_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____syscall_slong_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____ino_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__ushort in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____fsid_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____loff_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____ino64_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____quad_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__clock_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__suseconds_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pthread_rwlockattr_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__u_long in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__fd_mask in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____off_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__ulong in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__SLL in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__u_int16_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__blkcnt_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____u_int in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__u_char in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____clockid_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__quad_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pthread_cond_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____sigset_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__sigset_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____blkcnt_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__id_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pthread_spinlock_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,651 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____u_long in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,651 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__dev_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,651 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____int16_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,651 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____off64_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,651 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____sig_atomic_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,651 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pthread_attr_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,651 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____uid_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,651 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__int16_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,651 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____fd_mask in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,651 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____u_char in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,651 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____fsblkcnt64_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,651 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__wchar_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__uid_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__uint in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__nlink_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__lldiv_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__ssize_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____fsword_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____uint64_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____suseconds_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____nlink_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____pthread_slist_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____int32_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__u_int8_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__timer_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__clockid_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__u_int32_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____id_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pthread_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__u_int in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____syscall_ulong_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____gid_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__fsblkcnt_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:48,667 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG2f80e467d [2018-04-10 16:31:48,671 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-10 16:31:48,672 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-10 16:31:48,673 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-10 16:31:48,673 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-10 16:31:48,676 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-10 16:31:48,677 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 04:31:48" (1/1) ... [2018-04-10 16:31:48,678 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@545e3655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:31:48, skipping insertion in model container [2018-04-10 16:31:48,679 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 04:31:48" (1/1) ... [2018-04-10 16:31:48,688 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 16:31:48,714 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 16:31:48,828 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 16:31:48,868 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 16:31:48,873 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 115 non ball SCCs. Number of states in SCCs 115. [2018-04-10 16:31:48,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:31:48 WrapperNode [2018-04-10 16:31:48,910 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-10 16:31:48,911 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-10 16:31:48,911 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-10 16:31:48,911 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-10 16:31:48,923 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:31:48" (1/1) ... [2018-04-10 16:31:48,923 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:31:48" (1/1) ... [2018-04-10 16:31:48,936 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:31:48" (1/1) ... [2018-04-10 16:31:48,936 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:31:48" (1/1) ... [2018-04-10 16:31:48,947 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:31:48" (1/1) ... [2018-04-10 16:31:48,953 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:31:48" (1/1) ... [2018-04-10 16:31:48,955 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:31:48" (1/1) ... [2018-04-10 16:31:48,959 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-10 16:31:48,959 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-10 16:31:48,959 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-10 16:31:48,960 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-10 16:31:48,960 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:31:48" (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:31:49,043 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-10 16:31:49,043 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-10 16:31:49,043 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-10 16:31:49,043 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-10 16:31:49,043 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-10 16:31:49,043 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-10 16:31:49,043 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-10 16:31:49,043 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-10 16:31:49,043 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-10 16:31:49,043 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-10 16:31:49,043 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-10 16:31:49,044 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-10 16:31:49,044 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-10 16:31:49,044 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-10 16:31:49,044 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-10 16:31:49,044 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-10 16:31:49,044 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-10 16:31:49,044 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-10 16:31:49,044 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-10 16:31:49,044 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-10 16:31:49,044 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-10 16:31:49,045 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-10 16:31:49,045 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-10 16:31:49,045 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-10 16:31:49,045 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-10 16:31:49,045 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-10 16:31:49,045 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-10 16:31:49,045 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-10 16:31:49,045 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-10 16:31:49,045 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-10 16:31:49,046 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-10 16:31:49,046 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-10 16:31:49,046 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-10 16:31:49,046 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-10 16:31:49,046 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-10 16:31:49,046 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-10 16:31:49,046 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-10 16:31:49,046 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-10 16:31:49,047 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-10 16:31:49,047 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-10 16:31:49,047 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-10 16:31:49,047 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-10 16:31:49,047 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-10 16:31:49,047 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-10 16:31:49,047 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-10 16:31:49,047 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-10 16:31:49,047 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-10 16:31:49,047 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-10 16:31:49,048 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-10 16:31:49,048 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-10 16:31:49,048 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-10 16:31:49,048 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-10 16:31:49,048 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-10 16:31:49,048 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-10 16:31:49,048 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-10 16:31:49,048 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-10 16:31:49,048 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-10 16:31:49,048 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-10 16:31:49,048 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-10 16:31:49,049 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-10 16:31:49,049 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-10 16:31:49,049 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-10 16:31:49,049 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-10 16:31:49,049 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-10 16:31:49,049 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-10 16:31:49,049 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-10 16:31:49,049 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-10 16:31:49,049 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-10 16:31:49,049 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-10 16:31:49,050 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-10 16:31:49,050 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-10 16:31:49,050 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-10 16:31:49,050 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-10 16:31:49,050 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-10 16:31:49,050 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-10 16:31:49,050 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-10 16:31:49,050 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-10 16:31:49,050 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-10 16:31:49,050 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-10 16:31:49,050 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-10 16:31:49,051 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-10 16:31:49,051 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-10 16:31:49,051 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-10 16:31:49,051 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-10 16:31:49,051 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-10 16:31:49,051 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-10 16:31:49,051 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-10 16:31:49,051 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-10 16:31:49,051 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-10 16:31:49,051 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-10 16:31:49,052 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-10 16:31:49,052 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-10 16:31:49,052 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-10 16:31:49,052 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-10 16:31:49,052 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-10 16:31:49,052 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-10 16:31:49,052 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-10 16:31:49,052 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-10 16:31:49,052 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-10 16:31:49,052 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-10 16:31:49,053 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-10 16:31:49,053 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-10 16:31:49,053 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-10 16:31:49,053 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-10 16:31:49,053 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-10 16:31:49,053 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-10 16:31:49,053 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-10 16:31:49,053 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-10 16:31:49,053 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-10 16:31:49,053 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-10 16:31:49,053 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-10 16:31:49,054 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-10 16:31:49,054 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-10 16:31:49,054 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-10 16:31:49,054 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-10 16:31:49,054 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-10 16:31:49,054 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-10 16:31:49,054 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-10 16:31:49,498 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-10 16:31:49,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 04:31:49 BoogieIcfgContainer [2018-04-10 16:31:49,499 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-10 16:31:49,499 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-10 16:31:49,500 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-10 16:31:49,502 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-10 16:31:49,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.04 04:31:48" (1/3) ... [2018-04-10 16:31:49,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3529679e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 04:31:49, skipping insertion in model container [2018-04-10 16:31:49,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:31:48" (2/3) ... [2018-04-10 16:31:49,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3529679e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 04:31:49, skipping insertion in model container [2018-04-10 16:31:49,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 04:31:49" (3/3) ... [2018-04-10 16:31:49,504 INFO L107 eAbstractionObserver]: Analyzing ICFG dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:49,510 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-10 16:31:49,519 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 73 error locations. [2018-04-10 16:31:49,545 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-10 16:31:49,545 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-10 16:31:49,546 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-10 16:31:49,546 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-10 16:31:49,546 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-10 16:31:49,546 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-10 16:31:49,546 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-10 16:31:49,546 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-10 16:31:49,546 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-10 16:31:49,547 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-10 16:31:49,557 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states. [2018-04-10 16:31:49,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-10 16:31:49,563 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:31:49,563 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:31:49,564 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:31:49,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1591934807, now seen corresponding path program 1 times [2018-04-10 16:31:49,567 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:31:49,567 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:31:49,598 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:49,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:31:49,599 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:49,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:31:49,631 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:31:49,686 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:31:49,688 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:31:49,689 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 16:31:49,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 16:31:49,702 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 16:31:49,703 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 16:31:49,705 INFO L87 Difference]: Start difference. First operand 185 states. Second operand 4 states. [2018-04-10 16:31:49,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:31:49,865 INFO L93 Difference]: Finished difference Result 197 states and 209 transitions. [2018-04-10 16:31:49,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 16:31:49,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-10 16:31:49,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:31:49,876 INFO L225 Difference]: With dead ends: 197 [2018-04-10 16:31:49,876 INFO L226 Difference]: Without dead ends: 193 [2018-04-10 16:31:49,878 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:31:49,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-04-10 16:31:49,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 179. [2018-04-10 16:31:49,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-04-10 16:31:49,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 190 transitions. [2018-04-10 16:31:49,912 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 190 transitions. Word has length 8 [2018-04-10 16:31:49,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:31:49,913 INFO L459 AbstractCegarLoop]: Abstraction has 179 states and 190 transitions. [2018-04-10 16:31:49,913 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 16:31:49,913 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 190 transitions. [2018-04-10 16:31:49,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-10 16:31:49,913 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:31:49,913 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:31:49,914 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:31:49,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1591934808, now seen corresponding path program 1 times [2018-04-10 16:31:49,914 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:31:49,914 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:31:49,916 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:49,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:31:49,916 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:49,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:31:49,925 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:31:49,975 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:31:49,975 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:31:49,975 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 16:31:49,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 16:31:49,977 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 16:31:49,977 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 16:31:49,977 INFO L87 Difference]: Start difference. First operand 179 states and 190 transitions. Second operand 4 states. [2018-04-10 16:31:50,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:31:50,116 INFO L93 Difference]: Finished difference Result 181 states and 192 transitions. [2018-04-10 16:31:50,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 16:31:50,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-10 16:31:50,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:31:50,139 INFO L225 Difference]: With dead ends: 181 [2018-04-10 16:31:50,139 INFO L226 Difference]: Without dead ends: 181 [2018-04-10 16:31:50,139 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:31:50,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-04-10 16:31:50,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 176. [2018-04-10 16:31:50,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-04-10 16:31:50,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 187 transitions. [2018-04-10 16:31:50,145 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 187 transitions. Word has length 8 [2018-04-10 16:31:50,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:31:50,145 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 187 transitions. [2018-04-10 16:31:50,145 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 16:31:50,145 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 187 transitions. [2018-04-10 16:31:50,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-10 16:31:50,145 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:31:50,145 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:31:50,146 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:31:50,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1438606308, now seen corresponding path program 1 times [2018-04-10 16:31:50,146 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:31:50,146 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:31:50,147 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:50,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:31:50,147 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:50,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:31: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:31:50,170 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:31:50,171 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:31:50,171 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:31:50,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:31:50,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:31:50,204 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:31:50,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:31:50,234 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:50,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:50,240 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-10 16:31:50,256 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:50,256 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:50,257 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:31:50,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:50,264 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:31:50,264 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-10 16:31:50,276 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:31:50,277 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:31:50,277 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 16:31:50,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 16:31:50,277 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 16:31:50,277 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-10 16:31:50,278 INFO L87 Difference]: Start difference. First operand 176 states and 187 transitions. Second operand 6 states. [2018-04-10 16:31:50,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:31:50,527 INFO L93 Difference]: Finished difference Result 227 states and 243 transitions. [2018-04-10 16:31:50,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 16:31:50,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-04-10 16:31:50,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:31:50,528 INFO L225 Difference]: With dead ends: 227 [2018-04-10 16:31:50,528 INFO L226 Difference]: Without dead ends: 227 [2018-04-10 16:31:50,528 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:31:50,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-04-10 16:31:50,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 175. [2018-04-10 16:31:50,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-04-10 16:31:50,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 196 transitions. [2018-04-10 16:31:50,536 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 196 transitions. Word has length 16 [2018-04-10 16:31:50,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:31:50,536 INFO L459 AbstractCegarLoop]: Abstraction has 175 states and 196 transitions. [2018-04-10 16:31:50,536 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 16:31:50,537 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 196 transitions. [2018-04-10 16:31:50,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-10 16:31:50,537 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:31:50,537 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:31:50,537 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:31:50,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1438606309, now seen corresponding path program 1 times [2018-04-10 16:31:50,538 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:31:50,538 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:31:50,539 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:50,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:31:50,539 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:50,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:31:50,554 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:31:50,557 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:31:50,557 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:31:50,557 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:31:50,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:31:50,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:31:50,575 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:31:50,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:31:50,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:50,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:31:50,585 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:50,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:50,589 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-10 16:31:50,620 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:50,620 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:50,621 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:31:50,621 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:50,627 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:31:50,628 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:50,633 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:31:50,633 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:21 [2018-04-10 16:31:50,643 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:31:50,643 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:31:50,643 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-10 16:31:50,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 16:31:50,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 16:31:50,644 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-10 16:31:50,644 INFO L87 Difference]: Start difference. First operand 175 states and 196 transitions. Second operand 7 states. [2018-04-10 16:31:51,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:31:51,014 INFO L93 Difference]: Finished difference Result 300 states and 327 transitions. [2018-04-10 16:31:51,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 16:31:51,015 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-04-10 16:31:51,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:31:51,017 INFO L225 Difference]: With dead ends: 300 [2018-04-10 16:31:51,017 INFO L226 Difference]: Without dead ends: 300 [2018-04-10 16:31:51,017 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:31:51,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-04-10 16:31:51,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 236. [2018-04-10 16:31:51,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-04-10 16:31:51,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 275 transitions. [2018-04-10 16:31:51,026 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 275 transitions. Word has length 16 [2018-04-10 16:31:51,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:31:51,026 INFO L459 AbstractCegarLoop]: Abstraction has 236 states and 275 transitions. [2018-04-10 16:31:51,026 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 16:31:51,027 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 275 transitions. [2018-04-10 16:31:51,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-10 16:31:51,027 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:31:51,027 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:31:51,027 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:31:51,028 INFO L82 PathProgramCache]: Analyzing trace with hash -478807353, now seen corresponding path program 1 times [2018-04-10 16:31:51,028 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:31:51,028 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:31:51,029 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:51,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:31:51,029 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:51,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:31:51,039 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:31:51,066 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:31:51,066 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:31:51,066 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:31:51,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:31:51,066 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:31:51,067 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:31:51,067 INFO L87 Difference]: Start difference. First operand 236 states and 275 transitions. Second operand 5 states. [2018-04-10 16:31:51,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:31:51,269 INFO L93 Difference]: Finished difference Result 416 states and 486 transitions. [2018-04-10 16:31:51,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:31:51,270 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-10 16:31:51,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:31:51,272 INFO L225 Difference]: With dead ends: 416 [2018-04-10 16:31:51,272 INFO L226 Difference]: Without dead ends: 416 [2018-04-10 16:31:51,272 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:31:51,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2018-04-10 16:31:51,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 235. [2018-04-10 16:31:51,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-04-10 16:31:51,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 273 transitions. [2018-04-10 16:31:51,280 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 273 transitions. Word has length 18 [2018-04-10 16:31:51,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:31:51,281 INFO L459 AbstractCegarLoop]: Abstraction has 235 states and 273 transitions. [2018-04-10 16:31:51,281 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:31:51,281 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 273 transitions. [2018-04-10 16:31:51,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-10 16:31:51,281 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:31:51,282 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:31:51,282 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:31:51,282 INFO L82 PathProgramCache]: Analyzing trace with hash -478807352, now seen corresponding path program 1 times [2018-04-10 16:31:51,282 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:31:51,282 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:31:51,283 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:51,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:31:51,283 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:51,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:31:51,293 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:31:51,335 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:31:51,335 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:31:51,335 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:31:51,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:31:51,336 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:31:51,336 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:31:51,336 INFO L87 Difference]: Start difference. First operand 235 states and 273 transitions. Second operand 5 states. [2018-04-10 16:31:51,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:31:51,575 INFO L93 Difference]: Finished difference Result 425 states and 495 transitions. [2018-04-10 16:31:51,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 16:31:51,575 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-10 16:31:51,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:31:51,576 INFO L225 Difference]: With dead ends: 425 [2018-04-10 16:31:51,577 INFO L226 Difference]: Without dead ends: 425 [2018-04-10 16:31:51,577 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:31:51,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2018-04-10 16:31:51,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 234. [2018-04-10 16:31:51,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-04-10 16:31:51,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 271 transitions. [2018-04-10 16:31:51,583 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 271 transitions. Word has length 18 [2018-04-10 16:31:51,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:31:51,583 INFO L459 AbstractCegarLoop]: Abstraction has 234 states and 271 transitions. [2018-04-10 16:31:51,583 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:31:51,583 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 271 transitions. [2018-04-10 16:31:51,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-10 16:31:51,583 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:31:51,583 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:31:51,584 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:31:51,584 INFO L82 PathProgramCache]: Analyzing trace with hash -287335223, now seen corresponding path program 1 times [2018-04-10 16:31:51,584 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:31:51,584 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:31:51,585 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:51,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:31:51,585 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:51,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:31:51,594 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:31:51,597 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:31:51,597 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:31:51,597 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:31:51,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:31:51,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:31:51,629 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:31:51,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:31:51,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:51,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:51,645 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-10 16:31:51,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:31:51,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:31:51,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:51,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:51,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:31:51,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:31:51,661 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:51,662 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:51,666 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:31:51,666 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:20 [2018-04-10 16:31:51,673 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:31:51,675 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:31:51,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:51,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:51,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:51,678 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:16 [2018-04-10 16:31:51,695 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:31:51,699 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:51,700 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:31:51,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:51,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:31:51,710 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:51,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:51,718 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:31:51,718 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:29, output treesize:25 [2018-04-10 16:31:51,743 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:31:51,746 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:31:51,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:51,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:51,754 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:31:51,754 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:5 [2018-04-10 16:31:51,769 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:31:51,769 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:31:51,770 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-10 16:31:51,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 16:31:51,770 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 16:31:51,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-04-10 16:31:51,770 INFO L87 Difference]: Start difference. First operand 234 states and 271 transitions. Second operand 11 states. [2018-04-10 16:31:52,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:31:52,231 INFO L93 Difference]: Finished difference Result 263 states and 288 transitions. [2018-04-10 16:31:52,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-10 16:31:52,232 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-04-10 16:31:52,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:31:52,232 INFO L225 Difference]: With dead ends: 263 [2018-04-10 16:31:52,232 INFO L226 Difference]: Without dead ends: 263 [2018-04-10 16:31:52,233 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=317, Unknown=0, NotChecked=0, Total=462 [2018-04-10 16:31:52,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-04-10 16:31:52,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 236. [2018-04-10 16:31:52,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-04-10 16:31:52,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 274 transitions. [2018-04-10 16:31:52,236 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 274 transitions. Word has length 22 [2018-04-10 16:31:52,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:31:52,236 INFO L459 AbstractCegarLoop]: Abstraction has 236 states and 274 transitions. [2018-04-10 16:31:52,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 16:31:52,236 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 274 transitions. [2018-04-10 16:31:52,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-10 16:31:52,236 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:31:52,236 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:31:52,236 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:31:52,236 INFO L82 PathProgramCache]: Analyzing trace with hash -287335222, now seen corresponding path program 1 times [2018-04-10 16:31:52,237 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:31:52,237 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:31:52,237 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:52,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:31:52,237 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:52,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:31:52,245 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:31:52,249 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:31:52,249 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:31:52,249 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:31:52,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:31:52,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:31:52,280 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:31:52,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:31:52,284 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:52,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:52,286 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-10 16:31:52,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:31:52,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:52,305 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:52,306 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:52,307 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:31:52,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:52,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:52,311 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-10 16:31:52,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:31:52,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 8 treesize of output 7 [2018-04-10 16:31:52,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:52,325 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:52,331 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:31:52,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:31:52,333 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:52,334 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:52,339 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:31:52,339 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-04-10 16:31:52,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2018-04-10 16:31:52,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:31:52,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:52,367 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:52,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-10 16:31:52,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:31:52,378 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:52,380 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:52,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:31:52,385 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:67, output treesize:51 [2018-04-10 16:31:52,400 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 51 treesize of output 37 [2018-04-10 16:31:52,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2018-04-10 16:31:52,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:52,407 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:31:52,407 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:52,410 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:52,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-04-10 16:31:52,417 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:31:52,417 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:52,421 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:31:52,421 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:52,422 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:52,424 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:31:52,424 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:65, output treesize:9 [2018-04-10 16:31:52,438 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:31:52,438 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:31:52,438 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-10 16:31:52,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 16:31:52,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 16:31:52,439 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-04-10 16:31:52,439 INFO L87 Difference]: Start difference. First operand 236 states and 274 transitions. Second operand 11 states. [2018-04-10 16:31:53,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:31:53,023 INFO L93 Difference]: Finished difference Result 238 states and 272 transitions. [2018-04-10 16:31:53,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-10 16:31:53,024 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-04-10 16:31:53,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:31:53,024 INFO L225 Difference]: With dead ends: 238 [2018-04-10 16:31:53,024 INFO L226 Difference]: Without dead ends: 238 [2018-04-10 16:31:53,025 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=224, Invalid=478, Unknown=0, NotChecked=0, Total=702 [2018-04-10 16:31:53,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-04-10 16:31:53,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 230. [2018-04-10 16:31:53,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-04-10 16:31:53,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 267 transitions. [2018-04-10 16:31:53,027 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 267 transitions. Word has length 22 [2018-04-10 16:31:53,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:31:53,028 INFO L459 AbstractCegarLoop]: Abstraction has 230 states and 267 transitions. [2018-04-10 16:31:53,028 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 16:31:53,028 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 267 transitions. [2018-04-10 16:31:53,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-10 16:31:53,028 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:31:53,028 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:31:53,028 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:31:53,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1793562549, now seen corresponding path program 1 times [2018-04-10 16:31:53,028 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:31:53,028 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:31:53,029 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:53,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:31:53,029 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:53,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:31:53,034 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:31:53,056 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:31:53,056 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:31:53,056 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 16:31:53,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-10 16:31:53,056 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-10 16:31:53,057 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 16:31:53,057 INFO L87 Difference]: Start difference. First operand 230 states and 267 transitions. Second operand 3 states. [2018-04-10 16:31:53,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:31:53,076 INFO L93 Difference]: Finished difference Result 272 states and 311 transitions. [2018-04-10 16:31:53,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-10 16:31:53,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-04-10 16:31:53,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:31:53,077 INFO L225 Difference]: With dead ends: 272 [2018-04-10 16:31:53,077 INFO L226 Difference]: Without dead ends: 272 [2018-04-10 16:31:53,077 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 16:31:53,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-04-10 16:31:53,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 244. [2018-04-10 16:31:53,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-04-10 16:31:53,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 282 transitions. [2018-04-10 16:31:53,080 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 282 transitions. Word has length 25 [2018-04-10 16:31:53,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:31:53,080 INFO L459 AbstractCegarLoop]: Abstraction has 244 states and 282 transitions. [2018-04-10 16:31:53,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-10 16:31:53,080 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 282 transitions. [2018-04-10 16:31:53,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-10 16:31:53,081 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:31:53,081 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:31:53,081 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:31:53,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1576809233, now seen corresponding path program 1 times [2018-04-10 16:31:53,081 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:31:53,081 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:31:53,082 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:53,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:31:53,082 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:53,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:31:53,091 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:31:53,093 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:31:53,093 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:31:53,094 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:31:53,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:31:53,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:31:53,126 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:31:53,133 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:53,134 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:53,135 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:31:53,135 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:53,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:53,138 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-10 16:31:53,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:31:53,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:31:53,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:53,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:53,158 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:31:53,159 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-04-10 16:31:53,184 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:31:53,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:31:53,186 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:53,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:53,195 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:31:53,195 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-04-10 16:31:53,213 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:31:53,215 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:31:53,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:53,219 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:31:53,219 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:53,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:53,237 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:31:53,237 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:43, output treesize:15 [2018-04-10 16:31:53,257 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:31:53,257 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:31:53,257 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-10 16:31:53,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 16:31:53,258 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 16:31:53,258 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-04-10 16:31:53,258 INFO L87 Difference]: Start difference. First operand 244 states and 282 transitions. Second operand 9 states. [2018-04-10 16:31:53,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:31:53,495 INFO L93 Difference]: Finished difference Result 266 states and 306 transitions. [2018-04-10 16:31:53,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-10 16:31:53,495 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-04-10 16:31:53,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:31:53,496 INFO L225 Difference]: With dead ends: 266 [2018-04-10 16:31:53,496 INFO L226 Difference]: Without dead ends: 266 [2018-04-10 16:31:53,496 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 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:31:53,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-04-10 16:31:53,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 232. [2018-04-10 16:31:53,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-04-10 16:31:53,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 269 transitions. [2018-04-10 16:31:53,499 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 269 transitions. Word has length 37 [2018-04-10 16:31:53,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:31:53,500 INFO L459 AbstractCegarLoop]: Abstraction has 232 states and 269 transitions. [2018-04-10 16:31:53,500 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 16:31:53,500 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 269 transitions. [2018-04-10 16:31:53,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-10 16:31:53,500 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:31:53,500 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:31:53,500 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:31:53,500 INFO L82 PathProgramCache]: Analyzing trace with hash -2135914195, now seen corresponding path program 1 times [2018-04-10 16:31:53,500 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:31:53,501 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:31:53,501 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:53,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:31:53,501 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:53,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:31:53,510 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:31:53,514 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:31:53,514 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:31:53,514 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:31:53,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:31:53,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:31:53,542 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:31:53,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:31:53,548 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:53,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:53,550 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:31:53,566 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:53,566 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:53,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-10 16:31:53,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:53,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:53,574 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-10 16:31:53,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:31:53,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:31:53,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:53,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:53,597 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:31:53,598 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:35 [2018-04-10 16:31:53,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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 43 [2018-04-10 16:31:53,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:31:53,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:53,657 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:53,669 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:31:53,669 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:48 [2018-04-10 16:31:53,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2018-04-10 16:31:53,748 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 20 treesize of output 31 [2018-04-10 16:31:53,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:31:53,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:31:53,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-10 16:31:53,773 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:102 [2018-04-10 16:31:56,613 WARN L148 SmtUtils]: Spent 2823ms on a formula simplification that was a NOOP. DAG size: 47 [2018-04-10 16:32:04,681 WARN L148 SmtUtils]: Spent 8015ms on a formula simplification that was a NOOP. DAG size: 47 [2018-04-10 16:32:14,750 WARN L148 SmtUtils]: Spent 10036ms on a formula simplification that was a NOOP. DAG size: 48 [2018-04-10 16:32:14,766 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 66 treesize of output 53 [2018-04-10 16:32:14,768 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:32:14,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-04-10 16:32:14,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:14,781 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 13 treesize of output 10 [2018-04-10 16:32:14,781 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-10 16:32:14,788 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:32:14,812 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 55 treesize of output 48 [2018-04-10 16:32:14,813 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:32:14,813 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:14,820 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:32:14,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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:32:14,821 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:14,825 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:14,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-10 16:32:14,845 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 11 variables, input treesize:122, output treesize:46 [2018-04-10 16:32:14,884 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:32:14,884 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:32:14,885 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-10 16:32:14,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-10 16:32:14,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-10 16:32:14,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-04-10 16:32:14,885 INFO L87 Difference]: Start difference. First operand 232 states and 269 transitions. Second operand 15 states. [2018-04-10 16:32:18,328 WARN L148 SmtUtils]: Spent 3207ms on a formula simplification that was a NOOP. DAG size: 53 [2018-04-10 16:32:22,195 WARN L151 SmtUtils]: Spent 3834ms on a formula simplification. DAG size of input: 94 DAG size of output 58 [2018-04-10 16:32:33,014 WARN L151 SmtUtils]: Spent 10764ms on a formula simplification. DAG size of input: 101 DAG size of output 61 [2018-04-10 16:32:37,034 WARN L151 SmtUtils]: Spent 3938ms on a formula simplification. DAG size of input: 63 DAG size of output 56 [2018-04-10 16:32:37,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:32:37,378 INFO L93 Difference]: Finished difference Result 353 states and 390 transitions. [2018-04-10 16:32:37,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-10 16:32:37,378 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2018-04-10 16:32:37,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:32:37,379 INFO L225 Difference]: With dead ends: 353 [2018-04-10 16:32:37,379 INFO L226 Difference]: Without dead ends: 353 [2018-04-10 16:32:37,380 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 43.0s TimeCoverageRelationStatistics Valid=170, Invalid=586, Unknown=0, NotChecked=0, Total=756 [2018-04-10 16:32:37,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-04-10 16:32:37,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 261. [2018-04-10 16:32:37,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-04-10 16:32:37,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 303 transitions. [2018-04-10 16:32:37,383 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 303 transitions. Word has length 40 [2018-04-10 16:32:37,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:32:37,384 INFO L459 AbstractCegarLoop]: Abstraction has 261 states and 303 transitions. [2018-04-10 16:32:37,384 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-10 16:32:37,384 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 303 transitions. [2018-04-10 16:32:37,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-10 16:32:37,385 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:32:37,385 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:32:37,385 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:32:37,385 INFO L82 PathProgramCache]: Analyzing trace with hash -2135914194, now seen corresponding path program 1 times [2018-04-10 16:32:37,385 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:32:37,385 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:32:37,386 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:32:37,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:32:37,386 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:32:37,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:32:37,397 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:32:37,405 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:32:37,405 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:32:37,405 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:32:37,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:32:37,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:32:37,439 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:32:37,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:32:37,442 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:37,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:37,444 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:32:37,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:32:37,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:37,467 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:32:37,468 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:32:37,469 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:32:37,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:37,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:37,475 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-04-10 16:32:37,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:32:37,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:32:37,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:37,504 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:37,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:32:37,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:32:37,517 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:37,519 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:37,527 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:32:37,528 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:37 [2018-04-10 16:32:37,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-10 16:32:37,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:32:37,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:37,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:37,579 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:32:37,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:32:37,585 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:37,601 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:37,615 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:32:37,615 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:79, output treesize:63 [2018-04-10 16:32:37,722 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 39 treesize of output 80 [2018-04-10 16:32:37,727 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:32:37,728 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 51 treesize of output 46 [2018-04-10 16:32:37,728 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:37,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-04-10 16:32:37,777 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:37,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:37,856 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:32:37,863 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-10 16:32:37,863 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:37,949 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:32:37,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:32:37,951 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:32:38,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 51 [2018-04-10 16:32:38,011 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:38,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 60 [2018-04-10 16:32:38,059 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-10 16:32:38,109 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-10 16:32:38,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 13 dim-0 vars, and 4 xjuncts. [2018-04-10 16:32:38,154 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:92, output treesize:338 [2018-04-10 16:32:38,732 WARN L151 SmtUtils]: Spent 152ms on a formula simplification. DAG size of input: 184 DAG size of output 121 [2018-04-10 16:32:38,814 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:32:38,816 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:32:38,820 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 109 treesize of output 112 [2018-04-10 16:32:38,834 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 105 treesize of output 110 [2018-04-10 16:32:38,835 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:32:38,900 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:32:38,900 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 95 treesize of output 85 [2018-04-10 16:32:38,901 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:38,967 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:32:38,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 84 [2018-04-10 16:32:38,968 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:39,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 71 [2018-04-10 16:32:39,018 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:39,074 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 79 treesize of output 77 [2018-04-10 16:32:39,075 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-10 16:32:39,136 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-10 16:32:39,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 68 [2018-04-10 16:32:39,243 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 64 treesize of output 55 [2018-04-10 16:32:39,244 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:39,277 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:32:39,278 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:39,306 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 56 treesize of output 47 [2018-04-10 16:32:39,307 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:39,333 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 39 [2018-04-10 16:32:39,333 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:39,382 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:32:39,382 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 47 treesize of output 38 [2018-04-10 16:32:39,382 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:39,397 INFO L267 ElimStorePlain]: Start of recursive call 8: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:39,402 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 73 treesize of output 71 [2018-04-10 16:32:39,405 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 67 treesize of output 60 [2018-04-10 16:32:39,405 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:39,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 60 treesize of output 51 [2018-04-10 16:32:39,441 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:39,476 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 63 treesize of output 54 [2018-04-10 16:32:39,476 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:39,506 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 51 treesize of output 46 [2018-04-10 16:32:39,507 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:39,537 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:32:39,537 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 54 treesize of output 45 [2018-04-10 16:32:39,537 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:39,556 INFO L267 ElimStorePlain]: Start of recursive call 14: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:39,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 61 [2018-04-10 16:32:39,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-04-10 16:32:39,561 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:39,574 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:32:39,574 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:39,585 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:32:39,585 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:39,594 INFO L267 ElimStorePlain]: Start of recursive call 20: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:39,644 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:32:39,644 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 91 treesize of output 87 [2018-04-10 16:32:39,646 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:32:39,646 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:39,661 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:32:39,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2018-04-10 16:32:39,662 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:39,688 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:39,748 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:32:39,748 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:32:39,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 66 [2018-04-10 16:32:39,751 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:32:39,756 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 31 [2018-04-10 16:32:39,757 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 16:32:39,803 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:32:39,803 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:39,812 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:39,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:39,862 INFO L202 ElimStorePlain]: Needed 29 recursive calls to eliminate 14 variables, input treesize:209, output treesize:16 [2018-04-10 16:32:39,902 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:32:39,902 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:32:39,902 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-10 16:32:39,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-10 16:32:39,903 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-10 16:32:39,903 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=233, Unknown=1, NotChecked=0, Total=272 [2018-04-10 16:32:39,903 INFO L87 Difference]: Start difference. First operand 261 states and 303 transitions. Second operand 17 states. [2018-04-10 16:32:40,827 WARN L151 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 232 DAG size of output 141 [2018-04-10 16:32:41,030 WARN L151 SmtUtils]: Spent 141ms on a formula simplification. DAG size of input: 240 DAG size of output 91 [2018-04-10 16:32:41,271 WARN L151 SmtUtils]: Spent 176ms on a formula simplification. DAG size of input: 247 DAG size of output 98 [2018-04-10 16:32:41,588 WARN L151 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 240 DAG size of output 97 [2018-04-10 16:32:42,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:32:42,691 INFO L93 Difference]: Finished difference Result 366 states and 404 transitions. [2018-04-10 16:32:42,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-10 16:32:42,691 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 40 [2018-04-10 16:32:42,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:32:42,692 INFO L225 Difference]: With dead ends: 366 [2018-04-10 16:32:42,692 INFO L226 Difference]: Without dead ends: 366 [2018-04-10 16:32:42,693 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=242, Invalid=877, Unknown=3, NotChecked=0, Total=1122 [2018-04-10 16:32:42,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-04-10 16:32:42,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 261. [2018-04-10 16:32:42,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-04-10 16:32:42,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 302 transitions. [2018-04-10 16:32:42,698 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 302 transitions. Word has length 40 [2018-04-10 16:32:42,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:32:42,698 INFO L459 AbstractCegarLoop]: Abstraction has 261 states and 302 transitions. [2018-04-10 16:32:42,698 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-10 16:32:42,698 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 302 transitions. [2018-04-10 16:32:42,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-10 16:32:42,699 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:32:42,699 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:32:42,699 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:32:42,699 INFO L82 PathProgramCache]: Analyzing trace with hash -808260317, now seen corresponding path program 1 times [2018-04-10 16:32:42,699 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:32:42,699 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:32:42,700 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:32:42,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:32:42,701 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:32:42,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:32:42,709 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:32:42,730 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-10 16:32:42,731 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:32:42,731 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 16:32:42,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-10 16:32:42,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-10 16:32:42,731 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 16:32:42,732 INFO L87 Difference]: Start difference. First operand 261 states and 302 transitions. Second operand 3 states. [2018-04-10 16:32:42,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:32:42,738 INFO L93 Difference]: Finished difference Result 263 states and 304 transitions. [2018-04-10 16:32:42,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-10 16:32:42,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-04-10 16:32:42,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:32:42,739 INFO L225 Difference]: With dead ends: 263 [2018-04-10 16:32:42,739 INFO L226 Difference]: Without dead ends: 263 [2018-04-10 16:32:42,740 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 16:32:42,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-04-10 16:32:42,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2018-04-10 16:32:42,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-04-10 16:32:42,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 304 transitions. [2018-04-10 16:32:42,744 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 304 transitions. Word has length 43 [2018-04-10 16:32:42,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:32:42,745 INFO L459 AbstractCegarLoop]: Abstraction has 263 states and 304 transitions. [2018-04-10 16:32:42,745 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-10 16:32:42,745 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 304 transitions. [2018-04-10 16:32:42,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-10 16:32:42,746 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:32:42,746 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:32:42,746 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:32:42,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1074525530, now seen corresponding path program 1 times [2018-04-10 16:32:42,746 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:32:42,746 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:32:42,747 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:32:42,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:32:42,747 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:32:42,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:32:42,756 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:32:42,799 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-10 16:32:42,799 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:32:42,799 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 16:32:42,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 16:32:42,800 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 16:32:42,800 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-10 16:32:42,800 INFO L87 Difference]: Start difference. First operand 263 states and 304 transitions. Second operand 6 states. [2018-04-10 16:32:43,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:32:43,065 INFO L93 Difference]: Finished difference Result 297 states and 346 transitions. [2018-04-10 16:32:43,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 16:32:43,065 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-04-10 16:32:43,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:32:43,066 INFO L225 Difference]: With dead ends: 297 [2018-04-10 16:32:43,067 INFO L226 Difference]: Without dead ends: 297 [2018-04-10 16:32:43,067 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-04-10 16:32:43,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-04-10 16:32:43,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 262. [2018-04-10 16:32:43,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-04-10 16:32:43,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 303 transitions. [2018-04-10 16:32:43,071 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 303 transitions. Word has length 46 [2018-04-10 16:32:43,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:32:43,071 INFO L459 AbstractCegarLoop]: Abstraction has 262 states and 303 transitions. [2018-04-10 16:32:43,071 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 16:32:43,071 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 303 transitions. [2018-04-10 16:32:43,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-10 16:32:43,072 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:32:43,072 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:32:43,072 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:32:43,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1074525531, now seen corresponding path program 1 times [2018-04-10 16:32:43,072 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:32:43,072 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:32:43,073 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:32:43,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:32:43,073 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:32:43,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:32:43,088 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:32:43,097 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:32:43,097 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:32:43,098 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:32:43,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:32:43,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:32:43,146 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:32:43,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:32:43,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:43,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:32:43,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:43,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:43,159 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-10 16:32:43,197 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:32:43,197 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:32:43,198 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:43,208 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:32:43,208 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:32:43,209 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:32:43,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:43,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:43,218 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-04-10 16:32:43,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:32:43,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:32:43,236 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:43,238 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:43,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:32:43,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:32:43,256 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:43,257 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:43,274 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:32:43,274 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:49, output treesize:42 [2018-04-10 16:32:43,296 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:32:43,298 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:32:43,299 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:43,301 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:43,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:43,311 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:38 [2018-04-10 16:32:43,347 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 31 treesize of output 41 [2018-04-10 16:32:43,350 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:32:43,351 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 27 treesize of output 36 [2018-04-10 16:32:43,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:43,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 27 [2018-04-10 16:32:43,366 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:43,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:43,382 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:32:43,382 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:51, output treesize:47 [2018-04-10 16:32:43,476 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:32:43,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 61 [2018-04-10 16:32:43,521 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 47 treesize of output 62 [2018-04-10 16:32:43,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:32:43,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 42 treesize of output 45 [2018-04-10 16:32:43,565 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:43,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:32:43,621 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:32:43,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 80 [2018-04-10 16:32:43,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-10 16:32:43,626 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:43,635 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:43,637 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:32:43,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 71 [2018-04-10 16:32:43,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 16:32:43,642 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:43,660 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:43,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-10 16:32:43,687 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:83, output treesize:188 [2018-04-10 16:32:43,952 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 5 new quantified variables, introduced 2 case distinctions, treesize of input 167 treesize of output 129 [2018-04-10 16:32:43,955 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 115 treesize of output 83 [2018-04-10 16:32:43,956 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:32:44,014 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:32:44,014 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 107 treesize of output 73 [2018-04-10 16:32:44,015 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:32:44,087 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:32:44,087 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 83 treesize of output 71 [2018-04-10 16:32:44,087 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:44,143 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 59 [2018-04-10 16:32:44,143 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:44,195 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:32:44,195 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:32:44,196 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 101 treesize of output 81 [2018-04-10 16:32:44,196 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:32:44,248 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:32:44,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 99 [2018-04-10 16:32:44,249 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:44,298 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:32:44,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 72 [2018-04-10 16:32:44,300 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:32:44,360 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 64 treesize of output 55 [2018-04-10 16:32:44,361 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:44,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-04-10 16:32:44,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 45 [2018-04-10 16:32:44,455 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:32:44,455 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:44,463 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:32:44,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2018-04-10 16:32:44,464 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:44,471 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:44,473 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 54 treesize of output 44 [2018-04-10 16:32:44,475 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:32:44,475 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 27 treesize of output 19 [2018-04-10 16:32:44,476 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:44,484 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:32:44,484 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:44,490 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:44,517 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 55 treesize of output 45 [2018-04-10 16:32:44,519 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:32:44,519 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 27 treesize of output 19 [2018-04-10 16:32:44,519 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:44,528 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:32:44,528 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:44,534 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:44,536 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 59 treesize of output 49 [2018-04-10 16:32:44,538 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:32:44,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2018-04-10 16:32:44,539 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:44,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 16:32:44,549 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:44,555 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:44,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-04-10 16:32:44,591 INFO L202 ElimStorePlain]: Needed 22 recursive calls to eliminate 6 variables, input treesize:182, output treesize:104 [2018-04-10 16:32:44,679 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:32:44,679 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:32:44,679 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-10 16:32:44,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-10 16:32:44,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-10 16:32:44,680 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=260, Unknown=4, NotChecked=0, Total=306 [2018-04-10 16:32:44,680 INFO L87 Difference]: Start difference. First operand 262 states and 303 transitions. Second operand 18 states. [2018-04-10 16:32:46,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:32:46,450 INFO L93 Difference]: Finished difference Result 464 states and 508 transitions. [2018-04-10 16:32:46,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-10 16:32:46,450 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 46 [2018-04-10 16:32:46,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:32:46,451 INFO L225 Difference]: With dead ends: 464 [2018-04-10 16:32:46,451 INFO L226 Difference]: Without dead ends: 464 [2018-04-10 16:32:46,452 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=244, Invalid=936, Unknown=10, NotChecked=0, Total=1190 [2018-04-10 16:32:46,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-04-10 16:32:46,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 266. [2018-04-10 16:32:46,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-04-10 16:32:46,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 308 transitions. [2018-04-10 16:32:46,455 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 308 transitions. Word has length 46 [2018-04-10 16:32:46,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:32:46,455 INFO L459 AbstractCegarLoop]: Abstraction has 266 states and 308 transitions. [2018-04-10 16:32:46,456 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-10 16:32:46,456 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 308 transitions. [2018-04-10 16:32:46,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-10 16:32:46,456 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:32:46,456 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:32:46,456 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:32:46,456 INFO L82 PathProgramCache]: Analyzing trace with hash 222607969, now seen corresponding path program 1 times [2018-04-10 16:32:46,456 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:32:46,456 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:32:46,457 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:32:46,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:32:46,457 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:32:46,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:32:46,462 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:32:46,511 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:32:46,511 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:32:46,511 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 16:32:46,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 16:32:46,512 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 16:32:46,512 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-10 16:32:46,512 INFO L87 Difference]: Start difference. First operand 266 states and 308 transitions. Second operand 7 states. [2018-04-10 16:32:46,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:32:46,679 INFO L93 Difference]: Finished difference Result 295 states and 343 transitions. [2018-04-10 16:32:46,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 16:32:46,679 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2018-04-10 16:32:46,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:32:46,680 INFO L225 Difference]: With dead ends: 295 [2018-04-10 16:32:46,680 INFO L226 Difference]: Without dead ends: 295 [2018-04-10 16:32:46,681 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-04-10 16:32:46,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-04-10 16:32:46,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 276. [2018-04-10 16:32:46,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-04-10 16:32:46,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 319 transitions. [2018-04-10 16:32:46,685 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 319 transitions. Word has length 47 [2018-04-10 16:32:46,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:32:46,685 INFO L459 AbstractCegarLoop]: Abstraction has 276 states and 319 transitions. [2018-04-10 16:32:46,685 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 16:32:46,685 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 319 transitions. [2018-04-10 16:32:46,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-10 16:32:46,686 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:32:46,686 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:32:46,686 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:32:46,686 INFO L82 PathProgramCache]: Analyzing trace with hash 224455011, now seen corresponding path program 1 times [2018-04-10 16:32:46,686 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:32:46,686 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:32:46,687 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:32:46,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:32:46,687 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:32:46,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:32:46,694 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:32:46,724 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:32:46,724 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:32:46,724 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 16:32:46,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 16:32:46,724 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 16:32:46,724 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 16:32:46,725 INFO L87 Difference]: Start difference. First operand 276 states and 319 transitions. Second operand 4 states. [2018-04-10 16:32:46,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:32:46,788 INFO L93 Difference]: Finished difference Result 276 states and 314 transitions. [2018-04-10 16:32:46,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 16:32:46,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-04-10 16:32:46,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:32:46,789 INFO L225 Difference]: With dead ends: 276 [2018-04-10 16:32:46,789 INFO L226 Difference]: Without dead ends: 276 [2018-04-10 16:32:46,789 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:32:46,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-04-10 16:32:46,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 272. [2018-04-10 16:32:46,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-04-10 16:32:46,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 311 transitions. [2018-04-10 16:32:46,794 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 311 transitions. Word has length 47 [2018-04-10 16:32:46,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:32:46,794 INFO L459 AbstractCegarLoop]: Abstraction has 272 states and 311 transitions. [2018-04-10 16:32:46,794 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 16:32:46,794 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 311 transitions. [2018-04-10 16:32:46,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-10 16:32:46,795 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:32:46,795 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:32:46,795 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:32:46,795 INFO L82 PathProgramCache]: Analyzing trace with hash 224455012, now seen corresponding path program 1 times [2018-04-10 16:32:46,795 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:32:46,795 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:32:46,796 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:32:46,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:32:46,796 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:32:46,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:32:46,805 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:32:46,834 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:32:46,835 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:32:46,835 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 16:32:46,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 16:32:46,835 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 16:32:46,835 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 16:32:46,836 INFO L87 Difference]: Start difference. First operand 272 states and 311 transitions. Second operand 4 states. [2018-04-10 16:32:46,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:32:46,896 INFO L93 Difference]: Finished difference Result 268 states and 303 transitions. [2018-04-10 16:32:46,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 16:32:46,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-04-10 16:32:46,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:32:46,897 INFO L225 Difference]: With dead ends: 268 [2018-04-10 16:32:46,897 INFO L226 Difference]: Without dead ends: 268 [2018-04-10 16:32:46,897 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:32:46,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-04-10 16:32:46,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2018-04-10 16:32:46,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-04-10 16:32:46,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 303 transitions. [2018-04-10 16:32:46,900 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 303 transitions. Word has length 47 [2018-04-10 16:32:46,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:32:46,900 INFO L459 AbstractCegarLoop]: Abstraction has 268 states and 303 transitions. [2018-04-10 16:32:46,900 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 16:32:46,900 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 303 transitions. [2018-04-10 16:32:46,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-10 16:32:46,901 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:32:46,901 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:32:46,901 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:32:46,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1004839968, now seen corresponding path program 1 times [2018-04-10 16:32:46,901 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:32:46,901 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:32:46,902 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:32:46,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:32:46,902 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:32:46,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:32:46,912 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:32:46,920 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:32:46,920 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:32:46,920 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:32:46,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:32:46,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:32:46,977 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:32:46,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:32:46,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:46,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:46,995 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:32:47,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:32:47,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:47,014 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:32:47,015 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:32:47,015 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:32:47,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:47,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:47,020 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-04-10 16:32:47,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:32:47,030 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:32:47,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:47,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:47,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:32:47,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:32:47,042 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:47,043 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:47,048 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:32:47,048 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:41, output treesize:34 [2018-04-10 16:32:47,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 64 [2018-04-10 16:32:47,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:32:47,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:47,077 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:47,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-10 16:32:47,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:32:47,089 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:47,092 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:47,099 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:32:47,100 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:76, output treesize:60 [2018-04-10 16:32:47,154 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 62 treesize of output 57 [2018-04-10 16:32:47,161 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 16 treesize of output 23 [2018-04-10 16:32:47,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:32:47,174 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:32:47,201 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:32:47,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 71 [2018-04-10 16:32:47,204 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 25 treesize of output 20 [2018-04-10 16:32:47,205 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:47,212 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:47,217 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 75 treesize of output 82 [2018-04-10 16:32:47,219 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:32:47,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2018-04-10 16:32:47,220 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:47,229 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:47,251 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 2 xjuncts. [2018-04-10 16:32:47,251 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:93, output treesize:153 [2018-04-10 16:32:47,291 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 21 treesize of output 14 [2018-04-10 16:32:47,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:32:47,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:47,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:47,308 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:32:47,308 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:92, output treesize:77 [2018-04-10 16:32:47,592 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:32:47,593 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:32:47,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 68 [2018-04-10 16:32:47,597 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:32:47,603 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 54 [2018-04-10 16:32:47,604 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:32:47,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 16:32:47,627 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:47,635 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:47,650 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:32:47,651 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:94, output treesize:60 [2018-04-10 16:32:47,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-04-10 16:32:47,693 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:47,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-10 16:32:47,732 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:32:47,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-10 16:32:47,733 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:47,735 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:47,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:32:47,746 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:76, output treesize:45 [2018-04-10 16:32:47,824 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:32:47,824 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:32:47,825 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-10 16:32:47,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-10 16:32:47,825 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-10 16:32:47,825 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2018-04-10 16:32:47,825 INFO L87 Difference]: Start difference. First operand 268 states and 303 transitions. Second operand 20 states. [2018-04-10 16:32:49,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:32:49,708 INFO L93 Difference]: Finished difference Result 331 states and 364 transitions. [2018-04-10 16:32:49,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-10 16:32:49,708 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 50 [2018-04-10 16:32:49,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:32:49,709 INFO L225 Difference]: With dead ends: 331 [2018-04-10 16:32:49,709 INFO L226 Difference]: Without dead ends: 331 [2018-04-10 16:32:49,709 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=282, Invalid=1278, Unknown=0, NotChecked=0, Total=1560 [2018-04-10 16:32:49,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-04-10 16:32:49,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 266. [2018-04-10 16:32:49,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-04-10 16:32:49,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 300 transitions. [2018-04-10 16:32:49,712 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 300 transitions. Word has length 50 [2018-04-10 16:32:49,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:32:49,712 INFO L459 AbstractCegarLoop]: Abstraction has 266 states and 300 transitions. [2018-04-10 16:32:49,712 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-10 16:32:49,712 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 300 transitions. [2018-04-10 16:32:49,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-10 16:32:49,712 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:32:49,713 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:32:49,713 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:32:49,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1801987223, now seen corresponding path program 1 times [2018-04-10 16:32:49,713 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:32:49,713 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:32:49,713 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:32:49,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:32:49,714 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:32:49,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:32:49,718 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:32:49,757 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:32:49,757 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:32:49,757 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 16:32:49,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 16:32:49,757 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 16:32:49,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-10 16:32:49,758 INFO L87 Difference]: Start difference. First operand 266 states and 300 transitions. Second operand 6 states. [2018-04-10 16:32:49,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:32:49,960 INFO L93 Difference]: Finished difference Result 296 states and 332 transitions. [2018-04-10 16:32:49,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 16:32:49,960 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2018-04-10 16:32:49,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:32:49,961 INFO L225 Difference]: With dead ends: 296 [2018-04-10 16:32:49,961 INFO L226 Difference]: Without dead ends: 296 [2018-04-10 16:32:49,961 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-04-10 16:32:49,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-04-10 16:32:49,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 275. [2018-04-10 16:32:49,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-04-10 16:32:49,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 314 transitions. [2018-04-10 16:32:49,964 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 314 transitions. Word has length 51 [2018-04-10 16:32:49,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:32:49,964 INFO L459 AbstractCegarLoop]: Abstraction has 275 states and 314 transitions. [2018-04-10 16:32:49,964 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 16:32:49,964 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 314 transitions. [2018-04-10 16:32:49,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-10 16:32:49,964 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:32:49,964 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:32:49,964 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:32:49,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1801987224, now seen corresponding path program 1 times [2018-04-10 16:32:49,965 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:32:49,965 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:32:49,966 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:32:49,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:32:49,966 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:32:49,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:32:49,973 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:32:49,976 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:32:49,976 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:32:49,976 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:32:49,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:32:49,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:32:49,993 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:32:50,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-10 16:32:50,008 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 11 [2018-04-10 16:32:50,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:50,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:50,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-04-10 16:32:50,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-04-10 16:32:50,015 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:50,017 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:50,019 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:32:50,019 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:13 [2018-04-10 16:32:50,032 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:32:50,033 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:32:50,033 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 16:32:50,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 16:32:50,033 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 16:32:50,033 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-10 16:32:50,033 INFO L87 Difference]: Start difference. First operand 275 states and 314 transitions. Second operand 6 states. [2018-04-10 16:32:50,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:32:50,183 INFO L93 Difference]: Finished difference Result 288 states and 323 transitions. [2018-04-10 16:32:50,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 16:32:50,183 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2018-04-10 16:32:50,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:32:50,184 INFO L225 Difference]: With dead ends: 288 [2018-04-10 16:32:50,184 INFO L226 Difference]: Without dead ends: 288 [2018-04-10 16:32:50,184 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 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:32:50,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-04-10 16:32:50,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 273. [2018-04-10 16:32:50,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-04-10 16:32:50,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 309 transitions. [2018-04-10 16:32:50,187 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 309 transitions. Word has length 51 [2018-04-10 16:32:50,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:32:50,187 INFO L459 AbstractCegarLoop]: Abstraction has 273 states and 309 transitions. [2018-04-10 16:32:50,187 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 16:32:50,187 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 309 transitions. [2018-04-10 16:32:50,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-10 16:32:50,187 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:32:50,188 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:32:50,188 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:32:50,188 INFO L82 PathProgramCache]: Analyzing trace with hash 2133118707, now seen corresponding path program 1 times [2018-04-10 16:32:50,188 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:32:50,188 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:32:50,189 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:32:50,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:32:50,189 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:32:50,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:32:50,198 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:32:50,203 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:32:50,203 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:32:50,203 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:32:50,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:32:50,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:32:50,224 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:32:50,297 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 19 treesize of output 31 [2018-04-10 16:32:50,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:32:50,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:50,320 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:50,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-04-10 16:32:50,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-10 16:32:50,340 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:50,349 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:50,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:50,354 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:43, output treesize:35 [2018-04-10 16:32:50,374 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:32:50,376 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:32:50,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 34 [2018-04-10 16:32:50,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:50,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:50,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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:32:50,416 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:32:50,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 34 [2018-04-10 16:32:50,417 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:50,428 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:50,435 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:32:50,435 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:61, output treesize:53 [2018-04-10 16:32:50,453 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 84 treesize of output 77 [2018-04-10 16:32:50,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 51 [2018-04-10 16:32:50,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:50,467 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:32:50,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 40 [2018-04-10 16:32:50,469 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:32:50,488 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:32:50,490 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:32:50,492 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 62 treesize of output 48 [2018-04-10 16:32:50,493 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:32:50,513 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:32:50,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 42 [2018-04-10 16:32:50,530 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:32:50,530 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 38 treesize of output 27 [2018-04-10 16:32:50,531 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:32:50,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2018-04-10 16:32:50,543 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:50,553 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:32:50,554 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:32:50,555 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2018-04-10 16:32:50,556 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:50,560 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:50,561 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 50 treesize of output 38 [2018-04-10 16:32:50,562 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:32:50,563 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 31 treesize of output 20 [2018-04-10 16:32:50,564 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:32:50,569 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:32:50,569 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:50,572 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:50,576 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:32:50,576 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:103, output treesize:7 [2018-04-10 16:32:50,584 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:32:50,584 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:32:50,584 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-10 16:32:50,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 16:32:50,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 16:32:50,585 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-04-10 16:32:50,585 INFO L87 Difference]: Start difference. First operand 273 states and 309 transitions. Second operand 11 states. [2018-04-10 16:32:50,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:32:50,927 INFO L93 Difference]: Finished difference Result 291 states and 323 transitions. [2018-04-10 16:32:50,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 16:32:50,927 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 53 [2018-04-10 16:32:50,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:32:50,928 INFO L225 Difference]: With dead ends: 291 [2018-04-10 16:32:50,928 INFO L226 Difference]: Without dead ends: 291 [2018-04-10 16:32:50,929 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2018-04-10 16:32:50,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-04-10 16:32:50,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 281. [2018-04-10 16:32:50,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-04-10 16:32:50,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 317 transitions. [2018-04-10 16:32:50,931 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 317 transitions. Word has length 53 [2018-04-10 16:32:50,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:32:50,931 INFO L459 AbstractCegarLoop]: Abstraction has 281 states and 317 transitions. [2018-04-10 16:32:50,931 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 16:32:50,931 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 317 transitions. [2018-04-10 16:32:50,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-10 16:32:50,931 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:32:50,931 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:32:50,931 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:32:50,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1401734189, now seen corresponding path program 1 times [2018-04-10 16:32:50,931 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:32:50,931 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:32:50,932 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:32:50,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:32:50,932 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:32:50,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:32:50,941 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:32:50,944 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:32:50,944 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:32:50,944 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:32:50,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:32:50,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:32:50,991 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:32:50,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:32:50,994 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:50,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:32:50,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:51,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:51,002 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-10 16:32:51,023 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:32:51,025 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:32:51,026 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:32:51,026 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:51,040 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:32:51,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:51,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:51,049 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:34 [2018-04-10 16:32:51,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:32:51,064 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:32:51,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:51,066 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:51,076 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:32:51,076 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:49 [2018-04-10 16:32:51,111 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 48 treesize of output 52 [2018-04-10 16:32:51,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:32:51,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:51,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:51,129 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:32:51,130 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:62 [2018-04-10 16:32:51,209 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 58 treesize of output 53 [2018-04-10 16:32:51,228 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 16 treesize of output 23 [2018-04-10 16:32:51,229 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:32:51,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:32:51,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 16:32:51,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:82, output treesize:114 [2018-04-10 16:32:51,325 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:32:51,325 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:32:51,326 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:32:51,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-10 16:32:51,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:51,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 40 [2018-04-10 16:32:51,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:51,374 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:32:51,374 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:55 [2018-04-10 16:32:51,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-04-10 16:32:51,399 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 14 treesize of output 7 [2018-04-10 16:32:51,399 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:51,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:51,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:32:51,417 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:65 [2018-04-10 16:32:51,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 63 [2018-04-10 16:32:51,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:32:51,495 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:51,503 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:51,517 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:32:51,517 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:86, output treesize:78 [2018-04-10 16:32:51,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 101 [2018-04-10 16:32:51,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2018-04-10 16:32:51,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:32:51,622 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:32:51,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:32:51,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:32:51,662 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:51,664 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:51,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-10 16:32:51,699 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:139, output treesize:218 [2018-04-10 16:32:51,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 40 [2018-04-10 16:32:51,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:51,773 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:32:51,773 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:130, output treesize:91 [2018-04-10 16:32:51,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2018-04-10 16:32:51,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 5 treesize of output 1 [2018-04-10 16:32:51,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:51,851 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:32:51,851 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:51,852 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:51,866 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:32:51,866 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:108, output treesize:86 [2018-04-10 16:32:51,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 48 [2018-04-10 16:32:51,994 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:32:51,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:51,999 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 15 treesize of output 11 [2018-04-10 16:32:52,000 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:52,003 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:32:52,003 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:32:52,004 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:52,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:52,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:52,015 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:86, output treesize:5 [2018-04-10 16:32:52,048 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:32:52,048 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:32:52,048 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-10 16:32:52,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-10 16:32:52,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-10 16:32:52,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2018-04-10 16:32:52,049 INFO L87 Difference]: Start difference. First operand 281 states and 317 transitions. Second operand 25 states. [2018-04-10 16:32:54,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:32:54,590 INFO L93 Difference]: Finished difference Result 443 states and 493 transitions. [2018-04-10 16:32:54,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-10 16:32:54,590 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 55 [2018-04-10 16:32:54,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:32:54,591 INFO L225 Difference]: With dead ends: 443 [2018-04-10 16:32:54,591 INFO L226 Difference]: Without dead ends: 443 [2018-04-10 16:32:54,592 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 649 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=392, Invalid=2688, Unknown=0, NotChecked=0, Total=3080 [2018-04-10 16:32:54,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-04-10 16:32:54,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 322. [2018-04-10 16:32:54,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-04-10 16:32:54,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 364 transitions. [2018-04-10 16:32:54,594 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 364 transitions. Word has length 55 [2018-04-10 16:32:54,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:32:54,595 INFO L459 AbstractCegarLoop]: Abstraction has 322 states and 364 transitions. [2018-04-10 16:32:54,595 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-10 16:32:54,595 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 364 transitions. [2018-04-10 16:32:54,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-10 16:32:54,595 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:32:54,595 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:32:54,595 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:32:54,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1401734188, now seen corresponding path program 1 times [2018-04-10 16:32:54,595 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:32:54,595 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:32:54,596 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:32:54,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:32:54,596 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:32:54,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:32:54,604 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:32:54,607 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:32:54,607 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:32:54,607 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:32:54,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:32:54,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:32:54,632 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:32:54,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:32:54,634 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:54,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:54,644 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:32:54,659 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:32:54,659 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:32:54,660 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:32:54,660 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:54,666 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:32:54,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:54,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:54,672 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-04-10 16:32:54,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:32:54,693 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:32:54,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:54,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:54,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:32:54,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:32:54,706 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:54,707 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:54,715 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:32:54,716 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-04-10 16:32:54,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 64 [2018-04-10 16:32:54,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:32:54,750 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:54,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:54,771 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:32:54,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:32:54,773 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:54,778 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:54,789 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:32:54,790 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:88, output treesize:72 [2018-04-10 16:32:54,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 56 [2018-04-10 16:32:54,867 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:32:54,867 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:32:54,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 48 [2018-04-10 16:32:54,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:54,876 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:54,896 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 77 treesize of output 68 [2018-04-10 16:32:54,898 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:32:54,899 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 27 [2018-04-10 16:32:54,899 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:54,907 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:54,921 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:32:54,921 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:107, output treesize:107 [2018-04-10 16:32:54,955 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:32:54,956 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:32:54,956 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:32:54,957 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:32:54,957 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 48 [2018-04-10 16:32:54,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:54,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 16:32:54,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:55,001 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:32:55,001 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:124, output treesize:131 [2018-04-10 16:32:55,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 102 [2018-04-10 16:32:55,044 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:32:55,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 83 [2018-04-10 16:32:55,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:55,058 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:55,084 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:32:55,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 141 [2018-04-10 16:32:55,086 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:32:55,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 121 [2018-04-10 16:32:55,088 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:55,105 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:55,123 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:32:55,123 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:158, output treesize:135 [2018-04-10 16:32:55,207 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:32:55,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 107 [2018-04-10 16:32:55,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:32:55,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:55,222 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:55,242 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:32:55,243 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:32:55,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 174 [2018-04-10 16:32:55,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:32:55,249 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:55,267 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:55,284 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:32:55,284 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:177, output treesize:161 [2018-04-10 16:32:55,379 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:32:55,380 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:32:55,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 394 treesize of output 287 [2018-04-10 16:32:55,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 71 [2018-04-10 16:32:55,394 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:32:55,426 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:32:55,517 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:32:55,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 368 treesize of output 376 [2018-04-10 16:32:55,526 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:32:55,527 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 52 treesize of output 78 [2018-04-10 16:32:55,527 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:55,548 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:55,550 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:32:55,552 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:32:55,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 338 treesize of output 351 [2018-04-10 16:32:55,557 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 57 treesize of output 52 [2018-04-10 16:32:55,558 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:55,588 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:55,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-10 16:32:55,653 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:397, output treesize:621 [2018-04-10 16:32:58,912 WARN L148 SmtUtils]: Spent 3223ms on a formula simplification that was a NOOP. DAG size: 89 [2018-04-10 16:33:04,305 WARN L148 SmtUtils]: Spent 5344ms on a formula simplification that was a NOOP. DAG size: 89 [2018-04-10 16:33:04,316 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:04,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 349 treesize of output 311 [2018-04-10 16:33:04,316 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:04,358 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:04,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 282 treesize of output 249 [2018-04-10 16:33:04,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:04,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-10 16:33:04,393 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:637, output treesize:525 [2018-04-10 16:33:14,452 WARN L148 SmtUtils]: Spent 10028ms on a formula simplification that was a NOOP. DAG size: 78 [2018-04-10 16:33:14,459 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:14,459 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:14,461 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:14,462 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 307 treesize of output 207 [2018-04-10 16:33:14,480 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:33:14,485 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 77 [2018-04-10 16:33:14,485 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:33:14,519 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 1 case distinctions, treesize of input 64 treesize of output 46 [2018-04-10 16:33:14,520 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-10 16:33:14,546 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 137 treesize of output 78 [2018-04-10 16:33:14,546 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:33:14,548 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 140 treesize of output 81 [2018-04-10 16:33:14,548 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:33:14,581 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:33:14,634 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:14,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 245 treesize of output 172 [2018-04-10 16:33:14,639 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:33:14,639 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:14,655 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:33:14,656 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 92 treesize of output 78 [2018-04-10 16:33:14,656 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:14,669 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:33:14,670 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:14,680 INFO L267 ElimStorePlain]: Start of recursive call 7: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:14,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 66 [2018-04-10 16:33:14,733 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:33:14,733 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:14,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-04-10 16:33:14,745 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:14,759 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:33:14,759 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:14,767 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:14,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 63 [2018-04-10 16:33:14,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-04-10 16:33:14,795 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:14,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-04-10 16:33:14,809 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:14,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:33:14,819 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:14,826 INFO L267 ElimStorePlain]: Start of recursive call 15: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:14,858 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:14,858 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:14,859 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:14,860 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 87 [2018-04-10 16:33:14,866 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 33 [2018-04-10 16:33:14,866 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 16:33:14,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 29 [2018-04-10 16:33:14,881 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:33:14,890 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:33:14,890 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:14,896 INFO L267 ElimStorePlain]: Start of recursive call 19: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:33:14,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 4 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-04-10 16:33:14,923 INFO L202 ElimStorePlain]: Needed 22 recursive calls to eliminate 13 variables, input treesize:553, output treesize:58 [2018-04-10 16:33:14,985 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:33:14,985 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:33:14,985 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-10 16:33:14,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-10 16:33:14,985 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-10 16:33:14,985 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2018-04-10 16:33:14,985 INFO L87 Difference]: Start difference. First operand 322 states and 364 transitions. Second operand 22 states. [2018-04-10 16:33:21,409 WARN L148 SmtUtils]: Spent 5561ms on a formula simplification that was a NOOP. DAG size: 95 [2018-04-10 16:33:35,580 WARN L151 SmtUtils]: Spent 14053ms on a formula simplification. DAG size of input: 196 DAG size of output 99 [2018-04-10 16:33:55,125 WARN L151 SmtUtils]: Spent 19379ms on a formula simplification. DAG size of input: 208 DAG size of output 104 [2018-04-10 16:33:55,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:33:55,785 INFO L93 Difference]: Finished difference Result 442 states and 492 transitions. [2018-04-10 16:33:55,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-10 16:33:55,785 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 55 [2018-04-10 16:33:55,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:33:55,786 INFO L225 Difference]: With dead ends: 442 [2018-04-10 16:33:55,786 INFO L226 Difference]: Without dead ends: 442 [2018-04-10 16:33:55,786 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 58.7s TimeCoverageRelationStatistics Valid=280, Invalid=1526, Unknown=0, NotChecked=0, Total=1806 [2018-04-10 16:33:55,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2018-04-10 16:33:55,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 322. [2018-04-10 16:33:55,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-04-10 16:33:55,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 363 transitions. [2018-04-10 16:33:55,789 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 363 transitions. Word has length 55 [2018-04-10 16:33:55,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:33:55,789 INFO L459 AbstractCegarLoop]: Abstraction has 322 states and 363 transitions. [2018-04-10 16:33:55,789 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-10 16:33:55,789 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 363 transitions. [2018-04-10 16:33:55,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-10 16:33:55,790 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:33:55,790 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:33:55,790 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:33:55,790 INFO L82 PathProgramCache]: Analyzing trace with hash 2067780318, now seen corresponding path program 1 times [2018-04-10 16:33:55,790 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:33:55,790 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:33:55,791 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:33:55,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:33:55,791 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:33:55,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:33:55,801 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:33:55,804 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:33:55,805 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:33:55,805 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:33:55,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:33:55,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:33:55,832 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:33:55,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:33:55,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:33:55,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:55,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:55,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:55,865 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2018-04-10 16:33:55,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-04-10 16:33:55,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-04-10 16:33:55,906 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:55,927 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:55,935 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:33:55,935 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2018-04-10 16:33:56,056 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 36 treesize of output 59 [2018-04-10 16:33:56,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2018-04-10 16:33:56,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:56,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:56,124 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:33:56,124 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2018-04-10 16:33:56,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2018-04-10 16:33:56,180 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:56,181 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:33:56,181 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 0 case distinctions, treesize of input 20 treesize of output 18 [2018-04-10 16:33:56,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:56,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:56,192 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:33:56,192 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:3 [2018-04-10 16:33:56,247 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:33:56,247 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:33:56,247 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-10 16:33:56,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-10 16:33:56,248 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-10 16:33:56,248 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-04-10 16:33:56,248 INFO L87 Difference]: Start difference. First operand 322 states and 363 transitions. Second operand 17 states. [2018-04-10 16:33:56,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:33:56,863 INFO L93 Difference]: Finished difference Result 416 states and 460 transitions. [2018-04-10 16:33:56,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-10 16:33:56,897 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 55 [2018-04-10 16:33:56,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:33:56,898 INFO L225 Difference]: With dead ends: 416 [2018-04-10 16:33:56,898 INFO L226 Difference]: Without dead ends: 416 [2018-04-10 16:33:56,898 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=338, Invalid=994, Unknown=0, NotChecked=0, Total=1332 [2018-04-10 16:33:56,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2018-04-10 16:33:56,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 339. [2018-04-10 16:33:56,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-04-10 16:33:56,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 384 transitions. [2018-04-10 16:33:56,901 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 384 transitions. Word has length 55 [2018-04-10 16:33:56,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:33:56,901 INFO L459 AbstractCegarLoop]: Abstraction has 339 states and 384 transitions. [2018-04-10 16:33:56,901 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-10 16:33:56,901 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 384 transitions. [2018-04-10 16:33:56,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-10 16:33:56,902 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:33:56,902 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:33:56,902 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:33:56,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1257449240, now seen corresponding path program 1 times [2018-04-10 16:33:56,902 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:33:56,902 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:33:56,903 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:33:56,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:33:56,903 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:33:56,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:33:56,913 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:33:56,915 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:33:56,916 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:33:56,916 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:33:56,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:33:56,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:33:56,954 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:33:56,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:33:56,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:56,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:33:56,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:56,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:56,982 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:23 [2018-04-10 16:33:56,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:33:56,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:33:56,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:56,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:57,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:33:57,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:33:57,006 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:57,008 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:57,017 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:33:57,017 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:40 [2018-04-10 16:33:57,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-10 16:33:57,030 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:33:57,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:57,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:57,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:57,040 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:36 [2018-04-10 16:33:57,062 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:33:57,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:33:57,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:57,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:57,083 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:33:57,083 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2018-04-10 16:33:57,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 12 [2018-04-10 16:33:57,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:33:57,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:57,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:57,161 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 57 treesize of output 78 [2018-04-10 16:33:57,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 66 [2018-04-10 16:33:57,171 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-10 16:33:57,266 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 46 treesize of output 47 [2018-04-10 16:33:57,266 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-10 16:33:57,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 53 [2018-04-10 16:33:57,332 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:57,371 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:57,372 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:33:57,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 58 [2018-04-10 16:33:57,382 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-04-10 16:33:57,433 INFO L267 ElimStorePlain]: Start of recursive call 4: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-10 16:33:57,468 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 3 xjuncts. [2018-04-10 16:33:57,468 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:71, output treesize:175 [2018-04-10 16:33:57,563 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-10 16:33:57,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:57,586 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 40 treesize of output 35 [2018-04-10 16:33:57,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:57,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 58 [2018-04-10 16:33:57,606 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:57,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-10 16:33:57,623 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:186, output treesize:94 [2018-04-10 16:33:57,715 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:57,716 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:57,717 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:57,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 99 [2018-04-10 16:33:57,718 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:57,747 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:57,748 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:57,748 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 49 treesize of output 68 [2018-04-10 16:33:57,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:57,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-10 16:33:57,774 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:122, output treesize:138 [2018-04-10 16:33:57,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 78 treesize of output 88 [2018-04-10 16:33:57,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:33:57,880 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:57,942 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:57,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 77 [2018-04-10 16:33:57,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:33:57,998 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:58,009 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:58,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 106 [2018-04-10 16:33:58,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:33:58,057 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:58,075 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:58,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 105 treesize of output 118 [2018-04-10 16:33:58,133 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:58,134 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 101 treesize of output 110 [2018-04-10 16:33:58,135 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:58,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 101 [2018-04-10 16:33:58,194 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:58,227 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:58,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-10 16:33:58,262 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 9 variables, input treesize:188, output treesize:178 [2018-04-10 16:33:58,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 138 [2018-04-10 16:33:58,353 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:58,354 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 126 treesize of output 133 [2018-04-10 16:33:58,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:58,425 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:58,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 107 [2018-04-10 16:33:58,492 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:58,492 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:33:58,493 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:58,513 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:58,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 118 [2018-04-10 16:33:58,574 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:58,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:33:58,574 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:58,596 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:58,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 98 treesize of output 104 [2018-04-10 16:33:58,660 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:58,660 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 97 treesize of output 104 [2018-04-10 16:33:58,661 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:58,735 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:58,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 4 dim-2 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2018-04-10 16:33:58,774 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 13 variables, input treesize:230, output treesize:214 [2018-04-10 16:33:58,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 144 [2018-04-10 16:33:58,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 135 [2018-04-10 16:33:58,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:58,916 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:58,917 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:33:58,917 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 121 treesize of output 115 [2018-04-10 16:33:58,917 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:58,976 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:33:58,977 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 109 treesize of output 105 [2018-04-10 16:33:58,977 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:59,043 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:59,044 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:33:59,044 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 130 treesize of output 124 [2018-04-10 16:33:59,044 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:59,098 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 118 treesize of output 113 [2018-04-10 16:33:59,099 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:59,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:33:59,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 94 [2018-04-10 16:33:59,229 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 15 [2018-04-10 16:33:59,229 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:59,246 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:59,246 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 27 treesize of output 13 [2018-04-10 16:33:59,247 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:59,260 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:59,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-2 vars, End of recursive call: 13 dim-0 vars, and 3 xjuncts. [2018-04-10 16:33:59,326 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 11 variables, input treesize:252, output treesize:288 [2018-04-10 16:33:59,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 123 treesize of output 108 [2018-04-10 16:33:59,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 59 [2018-04-10 16:33:59,458 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:59,572 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:59,573 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:33:59,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 53 [2018-04-10 16:33:59,574 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:33:59,681 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 53 treesize of output 48 [2018-04-10 16:33:59,681 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:59,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 72 [2018-04-10 16:33:59,789 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:59,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 61 [2018-04-10 16:33:59,891 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:59,983 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 61 treesize of output 56 [2018-04-10 16:33:59,983 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:00,079 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:00,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 41 [2018-04-10 16:34:00,080 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:34:00,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 59 [2018-04-10 16:34:00,170 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:00,256 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:00,257 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 48 treesize of output 37 [2018-04-10 16:34:00,257 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:34:00,343 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:00,344 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:00,344 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 71 treesize of output 69 [2018-04-10 16:34:00,345 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:00,430 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:00,431 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:34:00,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 44 [2018-04-10 16:34:00,432 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:34:00,513 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:00,513 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:34:00,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 39 [2018-04-10 16:34:00,514 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:34:00,595 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:00,596 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:00,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 42 [2018-04-10 16:34:00,598 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:34:00,676 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 79 treesize of output 74 [2018-04-10 16:34:00,676 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:00,750 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:00,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 69 [2018-04-10 16:34:00,751 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:00,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 63 [2018-04-10 16:34:00,822 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:00,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 52 [2018-04-10 16:34:00,888 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:00,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2018-04-10 16:34:00,953 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:01,015 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:01,016 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:01,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 46 [2018-04-10 16:34:01,018 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:34:01,080 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:01,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 37 [2018-04-10 16:34:01,081 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:34:01,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 20 dim-1 vars, End of recursive call: 8 dim-0 vars, and 8 xjuncts. [2018-04-10 16:34:01,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 16 dim-0 vars, and 8 xjuncts. [2018-04-10 16:34:01,210 INFO L202 ElimStorePlain]: Needed 22 recursive calls to eliminate 6 variables, input treesize:143, output treesize:243 [2018-04-10 16:34:01,293 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:34:01,293 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:34:01,293 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-10 16:34:01,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-10 16:34:01,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-10 16:34:01,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2018-04-10 16:34:01,294 INFO L87 Difference]: Start difference. First operand 339 states and 384 transitions. Second operand 21 states. [2018-04-10 16:34:01,907 WARN L151 SmtUtils]: Spent 218ms on a formula simplification. DAG size of input: 79 DAG size of output 77 [2018-04-10 16:34:02,422 WARN L151 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 109 DAG size of output 81 [2018-04-10 16:34:02,626 WARN L151 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 121 DAG size of output 93 [2018-04-10 16:34:02,912 WARN L151 SmtUtils]: Spent 188ms on a formula simplification. DAG size of input: 152 DAG size of output 123 [2018-04-10 16:34:03,232 WARN L151 SmtUtils]: Spent 261ms on a formula simplification. DAG size of input: 194 DAG size of output 152 [2018-04-10 16:34:03,595 WARN L151 SmtUtils]: Spent 230ms on a formula simplification. DAG size of input: 185 DAG size of output 145 [2018-04-10 16:34:03,897 WARN L151 SmtUtils]: Spent 241ms on a formula simplification. DAG size of input: 202 DAG size of output 148 [2018-04-10 16:34:04,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:34:04,581 INFO L93 Difference]: Finished difference Result 484 states and 535 transitions. [2018-04-10 16:34:04,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-10 16:34:04,581 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 56 [2018-04-10 16:34:04,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:34:04,582 INFO L225 Difference]: With dead ends: 484 [2018-04-10 16:34:04,582 INFO L226 Difference]: Without dead ends: 484 [2018-04-10 16:34:04,582 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=306, Invalid=1416, Unknown=0, NotChecked=0, Total=1722 [2018-04-10 16:34:04,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-04-10 16:34:04,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 349. [2018-04-10 16:34:04,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-04-10 16:34:04,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 396 transitions. [2018-04-10 16:34:04,586 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 396 transitions. Word has length 56 [2018-04-10 16:34:04,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:34:04,586 INFO L459 AbstractCegarLoop]: Abstraction has 349 states and 396 transitions. [2018-04-10 16:34:04,586 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-10 16:34:04,586 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 396 transitions. [2018-04-10 16:34:04,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-10 16:34:04,587 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:34:04,587 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:34:04,587 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:34:04,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1257449239, now seen corresponding path program 1 times [2018-04-10 16:34:04,587 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:34:04,587 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:34:04,588 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:34:04,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:34:04,588 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:34:04,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:34:04,599 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:34:04,613 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:34:04,613 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:34:04,613 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:34:04,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:34:04,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:34:04,668 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:34:04,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:34:04,678 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:04,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:04,683 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-04-10 16:34:04,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:34:04,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, 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:34:04,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:04,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:04,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:34:04,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:34:04,711 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:04,712 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:04,721 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:34:04,721 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:48, output treesize:31 [2018-04-10 16:34:04,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-10 16:34:04,746 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:34:04,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:04,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:04,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:04,757 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:27 [2018-04-10 16:34:04,790 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:34:04,793 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:04,795 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:34:04,795 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:04,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:34:04,813 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:04,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:04,830 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:34:04,831 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:40, output treesize:36 [2018-04-10 16:34:04,904 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 19 treesize of output 61 [2018-04-10 16:34:04,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 49 [2018-04-10 16:34:04,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:04,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:04,955 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 71 treesize of output 90 [2018-04-10 16:34:04,960 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:04,961 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:34:04,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 62 treesize of output 69 [2018-04-10 16:34:04,972 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-04-10 16:34:05,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 77 [2018-04-10 16:34:05,093 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:05,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 64 [2018-04-10 16:34:05,186 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-10 16:34:05,251 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 65 treesize of output 86 [2018-04-10 16:34:05,251 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-10 16:34:05,285 INFO L267 ElimStorePlain]: Start of recursive call 4: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-10 16:34:05,317 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 3 xjuncts. [2018-04-10 16:34:05,317 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:69, output treesize:227 [2018-04-10 16:34:05,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 117 [2018-04-10 16:34:05,611 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:05,652 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:05,653 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:05,654 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 117 treesize of output 136 [2018-04-10 16:34:05,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:05,690 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:05,691 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:05,691 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 91 treesize of output 110 [2018-04-10 16:34:05,691 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:05,736 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 3 case distinctions, treesize of input 95 treesize of output 111 [2018-04-10 16:34:05,736 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-10 16:34:05,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-10 16:34:05,788 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:235, output treesize:222 [2018-04-10 16:34:05,902 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 125 treesize of output 128 [2018-04-10 16:34:05,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:34:05,912 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:05,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:06,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 146 treesize of output 168 [2018-04-10 16:34:06,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 160 [2018-04-10 16:34:06,011 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:06,056 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:06,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 127 treesize of output 129 [2018-04-10 16:34:06,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 127 [2018-04-10 16:34:06,125 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:06,220 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:06,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 142 treesize of output 158 [2018-04-10 16:34:06,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 150 [2018-04-10 16:34:06,316 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:06,429 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:06,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-10 16:34:06,477 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:272, output treesize:262 [2018-04-10 16:34:06,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 164 treesize of output 182 [2018-04-10 16:34:06,588 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:06,590 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 171 treesize of output 178 [2018-04-10 16:34:06,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:06,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:06,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 149 treesize of output 149 [2018-04-10 16:34:06,963 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:06,965 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:06,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 130 [2018-04-10 16:34:06,967 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:07,033 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:07,035 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 144 treesize of output 151 [2018-04-10 16:34:07,035 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:07,084 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:07,154 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 145 treesize of output 150 [2018-04-10 16:34:07,156 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:07,156 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:34:07,156 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:07,185 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:07,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 160 treesize of output 188 [2018-04-10 16:34:07,258 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:07,259 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 173 treesize of output 180 [2018-04-10 16:34:07,259 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:07,371 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:07,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2018-04-10 16:34:07,417 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:314, output treesize:304 [2018-04-10 16:34:07,489 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 166 treesize of output 149 [2018-04-10 16:34:07,489 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:07,544 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 170 treesize of output 164 [2018-04-10 16:34:07,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:07,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2018-04-10 16:34:07,602 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:342, output treesize:300 [2018-04-10 16:34:07,771 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:07,774 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:07,775 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:07,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 168 treesize of output 163 [2018-04-10 16:34:07,793 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:07,806 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 144 treesize of output 158 [2018-04-10 16:34:07,808 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-04-10 16:34:08,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 107 [2018-04-10 16:34:08,077 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:08,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 75 [2018-04-10 16:34:08,287 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:34:08,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 66 [2018-04-10 16:34:08,507 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:08,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 119 [2018-04-10 16:34:08,729 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:08,938 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:08,939 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 119 treesize of output 109 [2018-04-10 16:34:08,939 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:09,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 110 [2018-04-10 16:34:09,145 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:09,351 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:09,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 72 [2018-04-10 16:34:09,353 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:34:09,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 110 [2018-04-10 16:34:09,552 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:09,758 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:09,759 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:09,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 81 [2018-04-10 16:34:09,761 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:34:09,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 110 [2018-04-10 16:34:09,964 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:10,181 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:10,182 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 104 treesize of output 77 [2018-04-10 16:34:10,182 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:34:10,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 106 [2018-04-10 16:34:10,382 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-10 16:34: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 71 treesize of output 62 [2018-04-10 16:34:10,573 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:10,765 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:10,766 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 106 treesize of output 96 [2018-04-10 16:34:10,767 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:10,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 62 [2018-04-10 16:34:10,962 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:34:11,144 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:11,145 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:11,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 99 [2018-04-10 16:34:11,148 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:34:11,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 71 [2018-04-10 16:34:11,336 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:11,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 93 [2018-04-10 16:34:11,513 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:11,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 62 [2018-04-10 16:34:11,682 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:11,849 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:11,849 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 87 treesize of output 64 [2018-04-10 16:34:11,850 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:34:12,025 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:12,027 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:12,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 81 [2018-04-10 16:34:12,029 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:34:12,199 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:12,200 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:12,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 90 [2018-04-10 16:34:12,202 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:34:12,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 54 [2018-04-10 16:34:12,359 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:12,522 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:12,524 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:12,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 94 [2018-04-10 16:34:12,526 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:34:12,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 58 [2018-04-10 16:34:12,675 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:12,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 26 dim-1 vars, End of recursive call: 10 dim-0 vars, and 10 xjuncts. [2018-04-10 16:34:12,976 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 1 case distinctions, treesize of input 74 treesize of output 68 [2018-04-10 16:34:12,978 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 64 treesize of output 57 [2018-04-10 16:34:12,978 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:13,006 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 55 treesize of output 44 [2018-04-10 16:34:13,006 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:13,031 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 57 treesize of output 48 [2018-04-10 16:34:13,031 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:13,056 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:13,056 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 48 treesize of output 42 [2018-04-10 16:34:13,056 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:13,079 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:13,079 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 44 treesize of output 38 [2018-04-10 16:34:13,079 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:13,094 INFO L267 ElimStorePlain]: Start of recursive call 29: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:13,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 64 [2018-04-10 16:34:13,098 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:34:13,099 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:13,111 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:13,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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:34:13,112 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:13,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-04-10 16:34:13,122 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:13,129 INFO L267 ElimStorePlain]: Start of recursive call 35: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:13,135 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 1 case distinctions, treesize of input 74 treesize of output 68 [2018-04-10 16:34:13,136 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:34:13,137 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:13,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 54 [2018-04-10 16:34:13,137 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:13,164 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:13,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 58 [2018-04-10 16:34:13,165 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:13,187 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 52 treesize of output 45 [2018-04-10 16:34:13,187 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:13,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-04-10 16:34:13,211 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:13,227 INFO L267 ElimStorePlain]: Start of recursive call 39: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:13,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 68 [2018-04-10 16:34:13,237 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 23 treesize of output 12 [2018-04-10 16:34:13,238 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:13,251 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:13,251 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:34:13,251 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:13,261 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:34:13,262 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:13,269 INFO L267 ElimStorePlain]: Start of recursive call 44: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:13,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 64 [2018-04-10 16:34:13,277 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:34:13,277 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:13,277 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 56 treesize of output 48 [2018-04-10 16:34:13,278 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:13,302 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 60 treesize of output 53 [2018-04-10 16:34:13,302 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:13,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-04-10 16:34:13,358 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:13,376 INFO L267 ElimStorePlain]: Start of recursive call 48: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:13,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 64 [2018-04-10 16:34:13,380 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 23 treesize of output 12 [2018-04-10 16:34:13,380 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:13,391 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:34:13,391 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:13,400 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:13,401 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:34:13,401 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:13,408 INFO L267 ElimStorePlain]: Start of recursive call 52: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:13,414 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 1 case distinctions, treesize of input 74 treesize of output 68 [2018-04-10 16:34:13,416 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 64 treesize of output 57 [2018-04-10 16:34:13,416 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:13,443 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 53 treesize of output 44 [2018-04-10 16:34:13,444 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:13,468 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:13,469 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 44 treesize of output 38 [2018-04-10 16:34:13,469 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:13,494 INFO L267 ElimStorePlain]: Start of recursive call 56: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:13,496 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 74 treesize of output 60 [2018-04-10 16:34:13,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 12 [2018-04-10 16:34:13,499 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:13,510 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:13,510 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:34:13,510 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:13,518 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:34:13,519 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:13,525 INFO L267 ElimStorePlain]: Start of recursive call 60: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:13,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 64 [2018-04-10 16:34:13,529 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:13,530 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:34:13,530 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:13,542 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:34:13,542 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:13,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-04-10 16:34:13,553 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:13,560 INFO L267 ElimStorePlain]: Start of recursive call 64: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:13,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 72 [2018-04-10 16:34:13,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 68 treesize of output 61 [2018-04-10 16:34:13,569 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:13,601 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 61 treesize of output 52 [2018-04-10 16:34:13,601 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:13,630 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:13,630 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:34:13,631 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:13,658 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:13,658 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 57 treesize of output 51 [2018-04-10 16:34:13,658 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:13,681 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 36 [2018-04-10 16:34:13,682 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:13,696 INFO L267 ElimStorePlain]: Start of recursive call 68: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:13,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-10 16:34:13,786 INFO L202 ElimStorePlain]: Needed 73 recursive calls to eliminate 6 variables, input treesize:198, output treesize:47 [2018-04-10 16:34:13,847 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:34:13,848 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:34:13,848 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-10 16:34:13,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-10 16:34:13,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-10 16:34:13,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=438, Unknown=1, NotChecked=0, Total=506 [2018-04-10 16:34:13,848 INFO L87 Difference]: Start difference. First operand 349 states and 396 transitions. Second operand 23 states. [2018-04-10 16:34:15,439 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 134 DAG size of output 92 [2018-04-10 16:34:15,699 WARN L151 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 167 DAG size of output 99 [2018-04-10 16:34:16,006 WARN L151 SmtUtils]: Spent 202ms on a formula simplification. DAG size of input: 180 DAG size of output 106 [2018-04-10 16:34:16,262 WARN L151 SmtUtils]: Spent 150ms on a formula simplification. DAG size of input: 212 DAG size of output 79 [2018-04-10 16:34:16,531 WARN L151 SmtUtils]: Spent 187ms on a formula simplification. DAG size of input: 172 DAG size of output 102 [2018-04-10 16:34:16,784 WARN L151 SmtUtils]: Spent 184ms on a formula simplification. DAG size of input: 220 DAG size of output 87 [2018-04-10 16:34:25,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:34:25,634 INFO L93 Difference]: Finished difference Result 489 states and 540 transitions. [2018-04-10 16:34:25,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-10 16:34:25,635 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 56 [2018-04-10 16:34:25,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:34:25,636 INFO L225 Difference]: With dead ends: 489 [2018-04-10 16:34:25,636 INFO L226 Difference]: Without dead ends: 489 [2018-04-10 16:34:25,636 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=435, Invalid=2014, Unknown=1, NotChecked=0, Total=2450 [2018-04-10 16:34:25,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2018-04-10 16:34:25,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 349. [2018-04-10 16:34:25,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-04-10 16:34:25,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 395 transitions. [2018-04-10 16:34:25,639 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 395 transitions. Word has length 56 [2018-04-10 16:34:25,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:34:25,639 INFO L459 AbstractCegarLoop]: Abstraction has 349 states and 395 transitions. [2018-04-10 16:34:25,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-10 16:34:25,640 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 395 transitions. [2018-04-10 16:34:25,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-10 16:34:25,640 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:34:25,640 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:34:25,640 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:34:25,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1959498625, now seen corresponding path program 1 times [2018-04-10 16:34:25,641 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:34:25,641 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:34:25,641 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:34:25,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:34:25,642 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:34:25,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:34:25,654 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:34:25,659 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:34:25,660 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:34:25,660 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:34:25,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:34:25,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:34:25,705 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:34:25,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:34:25,708 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:25,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:34:25,714 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:25,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:25,719 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-10 16:34:25,745 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:25,746 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:25,746 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:34:25,746 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:25,772 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:34:25,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:25,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:25,786 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:37 [2018-04-10 16:34:25,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:34:25,812 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:34:25,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:25,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:25,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:34:25,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:34:25,839 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:25,841 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:25,857 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:34:25,857 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:59, output treesize:56 [2018-04-10 16:34:25,874 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:34:25,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2018-04-10 16:34:25,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:25,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:25,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:25,889 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:63, output treesize:44 [2018-04-10 16:34:25,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-04-10 16:34:25,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:34:25,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:25,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:25,933 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:34:25,934 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:53 [2018-04-10 16:34:26,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 79 [2018-04-10 16:34:26,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 64 [2018-04-10 16:34:26,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:26,087 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:26,130 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:34:26,131 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:86, output treesize:82 [2018-04-10 16:34:26,159 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:26,159 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:26,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-04-10 16:34:26,160 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:26,182 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:26,183 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:26,184 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:26,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-10 16:34:26,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:26,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 16:34:26,201 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:96, output treesize:88 [2018-04-10 16:34:26,226 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:34:26,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 60 [2018-04-10 16:34:26,239 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 14 treesize of output 7 [2018-04-10 16:34:26,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:26,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:26,260 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:34:26,260 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:96, output treesize:85 [2018-04-10 16:34:26,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 72 treesize of output 108 [2018-04-10 16:34:26,335 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-10 16:34:26,347 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:34:26,347 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 76 treesize of output 68 [2018-04-10 16:34:26,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:26,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 68 [2018-04-10 16:34:26,733 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:26,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:26,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-04-10 16:34:26,774 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:105, output treesize:101 [2018-04-10 16:34:27,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 17 case distinctions, treesize of input 110 treesize of output 151 [2018-04-10 16:34:27,008 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-04-10 16:34:27,033 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-10 16:34:27,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:28,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 106 [2018-04-10 16:34:28,738 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:28,762 INFO L267 ElimStorePlain]: Start of recursive call 2: 16 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:28,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-04-10 16:34:28,782 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:143, output treesize:139 [2018-04-10 16:34:29,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-10 16:34:29,074 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 11 [2018-04-10 16:34:29,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:29,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:29,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 117 treesize of output 131 [2018-04-10 16:34:29,134 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:34:29,134 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 107 treesize of output 95 [2018-04-10 16:34:29,134 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:30,391 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:34:30,391 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 84 treesize of output 55 [2018-04-10 16:34:30,391 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:31,596 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:34:31,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 91 [2018-04-10 16:34:31,596 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:32,811 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 70 [2018-04-10 16:34:32,811 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:34,061 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:34:34,061 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:34:34,063 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:34,066 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:34:34,066 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 82 treesize of output 40 [2018-04-10 16:34:34,066 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:35,392 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:34:35,392 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:34:35,394 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:35,396 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:34:35,397 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 82 treesize of output 40 [2018-04-10 16:34:35,397 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:37,229 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 78 treesize of output 62 [2018-04-10 16:34:37,230 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:34:37,726 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:34:37,726 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:34:37,727 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:37,727 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:34:37,727 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 62 treesize of output 39 [2018-04-10 16:34:37,728 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:38,126 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:34:38,126 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:34:38,128 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:38,130 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:34:38,130 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 78 treesize of output 36 [2018-04-10 16:34:38,130 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:38,205 INFO L267 ElimStorePlain]: Start of recursive call 4: 57 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:38,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-10 16:34:38,217 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 10 variables, input treesize:161, output treesize:48 [2018-04-10 16:34:38,307 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:34:38,307 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:34:38,308 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-10 16:34:38,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-10 16:34:38,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-10 16:34:38,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2018-04-10 16:34:38,308 INFO L87 Difference]: Start difference. First operand 349 states and 395 transitions. Second operand 25 states. [2018-04-10 16:34:48,479 WARN L151 SmtUtils]: Spent 1426ms on a formula simplification. DAG size of input: 69 DAG size of output 67 [2018-04-10 16:34:54,976 WARN L151 SmtUtils]: Spent 1307ms on a formula simplification. DAG size of input: 93 DAG size of output 73 [2018-04-10 16:34:57,821 WARN L151 SmtUtils]: Spent 836ms on a formula simplification. DAG size of input: 103 DAG size of output 79 [2018-04-10 16:35:01,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:35:01,881 INFO L93 Difference]: Finished difference Result 482 states and 533 transitions. [2018-04-10 16:35:01,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-10 16:35:01,881 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 61 [2018-04-10 16:35:01,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:35:01,882 INFO L225 Difference]: With dead ends: 482 [2018-04-10 16:35:01,882 INFO L226 Difference]: Without dead ends: 482 [2018-04-10 16:35:01,883 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 778 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=608, Invalid=2583, Unknown=1, NotChecked=0, Total=3192 [2018-04-10 16:35:01,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2018-04-10 16:35:01,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 364. [2018-04-10 16:35:01,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-04-10 16:35:01,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 414 transitions. [2018-04-10 16:35:01,887 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 414 transitions. Word has length 61 [2018-04-10 16:35:01,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:35:01,888 INFO L459 AbstractCegarLoop]: Abstraction has 364 states and 414 transitions. [2018-04-10 16:35:01,888 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-10 16:35:01,888 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 414 transitions. [2018-04-10 16:35:01,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-10 16:35:01,889 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:35:01,889 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:35:01,889 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:35:01,889 INFO L82 PathProgramCache]: Analyzing trace with hash 426787439, now seen corresponding path program 1 times [2018-04-10 16:35:01,889 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:35:01,889 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:35:01,890 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:01,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:01,890 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:01,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:01,899 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:35:01,906 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:35:01,906 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:35:01,907 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:35:01,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:01,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:01,942 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:35:01,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:35:01,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:02,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:02,002 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:35:02,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:35:02,017 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:02,024 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:02,024 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:02,025 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:35:02,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:02,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:02,030 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-04-10 16:35:02,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:35:02,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:35:02,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:02,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:02,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:35:02,052 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:35:02,052 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:02,053 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:02,059 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:35:02,059 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:41, output treesize:34 [2018-04-10 16:35:02,091 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:35:02,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:35:02,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:02,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:02,121 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:35:02,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:35:02,123 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:02,129 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:02,141 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:35:02,141 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:83, output treesize:67 [2018-04-10 16:35:02,236 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 46 treesize of output 52 [2018-04-10 16:35:02,240 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:02,240 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:35:02,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 48 [2018-04-10 16:35:02,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:02,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:02,274 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 77 treesize of output 72 [2018-04-10 16:35:02,276 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:02,278 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 27 [2018-04-10 16:35:02,278 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:02,294 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:02,308 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:35:02,308 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:100, output treesize:93 [2018-04-10 16:35:02,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2018-04-10 16:35:02,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:02,346 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:35:02,347 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:106, output treesize:82 [2018-04-10 16:35:02,494 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:35:02,496 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 87 treesize of output 73 [2018-04-10 16:35:02,498 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:35:02,498 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 47 treesize of output 35 [2018-04-10 16:35:02,499 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:02,509 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:35:02,510 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:02,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 32 [2018-04-10 16:35:02,512 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:02,521 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:35:02,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 44 [2018-04-10 16:35:02,539 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:35:02,540 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:02,540 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 18 [2018-04-10 16:35:02,540 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:02,549 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:35:02,550 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:35:02,550 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:02,554 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:02,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:02,561 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:117, output treesize:10 [2018-04-10 16:35:02,605 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:35:02,606 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:35:02,606 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-10 16:35:02,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-10 16:35:02,606 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-10 16:35:02,606 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2018-04-10 16:35:02,606 INFO L87 Difference]: Start difference. First operand 364 states and 414 transitions. Second operand 19 states. [2018-04-10 16:35:04,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:35:04,005 INFO L93 Difference]: Finished difference Result 412 states and 460 transitions. [2018-04-10 16:35:04,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-10 16:35:04,005 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 62 [2018-04-10 16:35:04,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:35:04,006 INFO L225 Difference]: With dead ends: 412 [2018-04-10 16:35:04,006 INFO L226 Difference]: Without dead ends: 412 [2018-04-10 16:35:04,006 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=225, Invalid=1107, Unknown=0, NotChecked=0, Total=1332 [2018-04-10 16:35:04,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2018-04-10 16:35:04,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 360. [2018-04-10 16:35:04,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-04-10 16:35:04,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 408 transitions. [2018-04-10 16:35:04,009 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 408 transitions. Word has length 62 [2018-04-10 16:35:04,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:35:04,010 INFO L459 AbstractCegarLoop]: Abstraction has 360 states and 408 transitions. [2018-04-10 16:35:04,010 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-10 16:35:04,010 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 408 transitions. [2018-04-10 16:35:04,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-10 16:35:04,010 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:35:04,011 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:35:04,011 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:35:04,011 INFO L82 PathProgramCache]: Analyzing trace with hash 362823375, now seen corresponding path program 1 times [2018-04-10 16:35:04,011 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:35:04,011 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:35:04,011 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:04,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:04,011 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:04,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:04,019 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:35:04,034 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:35:04,034 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:35:04,034 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:35:04,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:04,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:04,051 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:35:04,081 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:04,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-04-10 16:35:04,082 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:04,092 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:04,093 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:04,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-10 16:35:04,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:04,100 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:35:04,100 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-04-10 16:35:04,115 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-10 16:35:04,115 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:35:04,115 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:35:04,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:35:04,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:35:04,116 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:35:04,116 INFO L87 Difference]: Start difference. First operand 360 states and 408 transitions. Second operand 5 states. [2018-04-10 16:35:04,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:35:04,298 INFO L93 Difference]: Finished difference Result 388 states and 437 transitions. [2018-04-10 16:35:04,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:35:04,299 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2018-04-10 16:35:04,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:35:04,300 INFO L225 Difference]: With dead ends: 388 [2018-04-10 16:35:04,300 INFO L226 Difference]: Without dead ends: 388 [2018-04-10 16:35:04,300 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-10 16:35:04,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-04-10 16:35:04,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 358. [2018-04-10 16:35:04,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-04-10 16:35:04,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 405 transitions. [2018-04-10 16:35:04,303 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 405 transitions. Word has length 64 [2018-04-10 16:35:04,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:35:04,303 INFO L459 AbstractCegarLoop]: Abstraction has 358 states and 405 transitions. [2018-04-10 16:35:04,303 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:35:04,303 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 405 transitions. [2018-04-10 16:35:04,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-10 16:35:04,304 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:35:04,304 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:35:04,304 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:35:04,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1445991722, now seen corresponding path program 1 times [2018-04-10 16:35:04,304 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:35:04,304 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:35:04,305 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:04,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:04,305 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:04,312 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:35:04,376 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:35:04,376 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:35:04,376 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-10 16:35:04,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 16:35:04,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 16:35:04,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-10 16:35:04,376 INFO L87 Difference]: Start difference. First operand 358 states and 405 transitions. Second operand 6 states. [2018-04-10 16:35:04,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:35:04,479 INFO L93 Difference]: Finished difference Result 394 states and 439 transitions. [2018-04-10 16:35:04,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 16:35:04,480 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-04-10 16:35:04,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:35:04,481 INFO L225 Difference]: With dead ends: 394 [2018-04-10 16:35:04,481 INFO L226 Difference]: Without dead ends: 394 [2018-04-10 16:35:04,481 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-04-10 16:35:04,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-04-10 16:35:04,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 358. [2018-04-10 16:35:04,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-04-10 16:35:04,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 402 transitions. [2018-04-10 16:35:04,484 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 402 transitions. Word has length 64 [2018-04-10 16:35:04,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:35:04,485 INFO L459 AbstractCegarLoop]: Abstraction has 358 states and 402 transitions. [2018-04-10 16:35:04,485 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 16:35:04,485 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 402 transitions. [2018-04-10 16:35:04,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-10 16:35:04,485 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:35:04,485 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:35:04,486 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:35:04,486 INFO L82 PathProgramCache]: Analyzing trace with hash 905148166, now seen corresponding path program 1 times [2018-04-10 16:35:04,486 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:35:04,486 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:35:04,487 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:04,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:04,487 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:04,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:04,499 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:35:04,505 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:35:04,505 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:35:04,505 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:35:04,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:04,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:04,556 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:35:04,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:35:04,559 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:04,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:04,562 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:35:04,591 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:04,592 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:04,592 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:35:04,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:04,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:04,604 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-10 16:35:04,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:35:04,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:35:04,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:04,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:04,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:35:04,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:35:04,642 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:04,643 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:04,654 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:35:04,654 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:49, output treesize:42 [2018-04-10 16:35:04,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 64 [2018-04-10 16:35:04,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:35:04,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:04,698 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:04,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-10 16:35:04,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:35:04,716 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:04,720 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:04,733 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:35:04,733 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:84, output treesize:68 [2018-04-10 16:35:04,789 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 62 treesize of output 57 [2018-04-10 16:35:04,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 16:35:04,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:35:04,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:35:04,856 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 79 treesize of output 90 [2018-04-10 16:35:04,858 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:35:04,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2018-04-10 16:35:04,859 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:04,871 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:04,873 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:35:04,875 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 75 treesize of output 79 [2018-04-10 16:35:04,877 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 25 treesize of output 20 [2018-04-10 16:35:04,877 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:04,888 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:04,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 16:35:04,921 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:104, output treesize:183 [2018-04-10 16:35:04,963 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:04,964 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:04,965 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:04,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2018-04-10 16:35:04,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:04,989 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:35:04,990 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:88, output treesize:94 [2018-04-10 16:35:05,016 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:05,018 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:05,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 70 [2018-04-10 16:35:05,021 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 23 treesize of output 16 [2018-04-10 16:35:05,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:05,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:05,050 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:05,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 43 [2018-04-10 16:35:05,055 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 11 [2018-04-10 16:35:05,055 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:05,060 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:05,075 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:35:05,075 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:116, output treesize:88 [2018-04-10 16:35:05,134 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:05,135 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:05,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 115 [2018-04-10 16:35:05,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:35:05,142 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:05,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:05,178 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:05,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 78 [2018-04-10 16:35:05,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:35:05,186 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:05,194 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:05,214 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:35:05,215 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:137, output treesize:121 [2018-04-10 16:35:05,341 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:05,342 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:05,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 142 [2018-04-10 16:35:05,364 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 43 [2018-04-10 16:35:05,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:35:05,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:35:05,451 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:05,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 154 [2018-04-10 16:35:05,460 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:35:05,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 36 [2018-04-10 16:35:05,460 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:05,481 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:05,483 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:05,489 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:35:05,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 143 [2018-04-10 16:35:05,493 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 24 [2018-04-10 16:35:05,493 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:05,509 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:05,562 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:35:05,562 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:196, output treesize:311 [2018-04-10 16:35:06,241 WARN L148 SmtUtils]: Spent 543ms on a formula simplification that was a NOOP. DAG size: 87 [2018-04-10 16:35:06,328 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:06,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 159 [2018-04-10 16:35:06,333 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:35:06,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:06,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-04-10 16:35:06,361 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:06,384 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:35:06,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-04-10 16:35:06,385 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:06,403 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:06,447 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:06,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 151 [2018-04-10 16:35:06,451 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:35:06,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-04-10 16:35:06,451 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:06,475 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:35:06,475 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:06,492 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:35:06,492 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:06,507 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:06,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-2 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2018-04-10 16:35:06,543 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 13 variables, input treesize:345, output treesize:216 [2018-04-10 16:35:06,788 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:06,790 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:06,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 94 [2018-04-10 16:35:06,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-10 16:35:06,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:35:06,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-04-10 16:35:06,814 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:06,815 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 28 treesize of output 22 [2018-04-10 16:35:06,816 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:35:06,836 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:35:06,836 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 32 [2018-04-10 16:35:06,837 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:06,838 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:35:06,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2018-04-10 16:35:06,838 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:06,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 16:35:06,912 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:06,913 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:06,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 87 [2018-04-10 16:35:06,916 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:35:06,916 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:06,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-04-10 16:35:06,931 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:06,945 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:35:06,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-04-10 16:35:06,946 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:06,957 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:06,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-04-10 16:35:07,000 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 13 variables, input treesize:230, output treesize:85 [2018-04-10 16:35:07,080 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:35:07,080 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:35:07,080 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-10 16:35:07,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-10 16:35:07,080 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-10 16:35:07,081 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=526, Unknown=1, NotChecked=0, Total=600 [2018-04-10 16:35:07,081 INFO L87 Difference]: Start difference. First operand 358 states and 402 transitions. Second operand 25 states. [2018-04-10 16:35:08,664 WARN L148 SmtUtils]: Spent 537ms on a formula simplification that was a NOOP. DAG size: 93 [2018-04-10 16:35:09,357 WARN L151 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 188 DAG size of output 100 Received shutdown request... [2018-04-10 16:35:13,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-10 16:35:13,620 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-10 16:35:13,623 WARN L197 ceAbstractionStarter]: Timeout [2018-04-10 16:35:13,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.04 04:35:13 BoogieIcfgContainer [2018-04-10 16:35:13,624 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-10 16:35:13,624 INFO L168 Benchmark]: Toolchain (without parser) took 204953.02 ms. Allocated memory was 402.1 MB in the beginning and 640.2 MB in the end (delta: 238.0 MB). Free memory was 336.8 MB in the beginning and 500.7 MB in the end (delta: -163.9 MB). Peak memory consumption was 74.2 MB. Max. memory is 5.3 GB. [2018-04-10 16:35:13,625 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 402.1 MB. Free memory is still 362.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-10 16:35:13,625 INFO L168 Benchmark]: CACSL2BoogieTranslator took 238.01 ms. Allocated memory is still 402.1 MB. Free memory was 336.8 MB in the beginning and 309.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:35:13,625 INFO L168 Benchmark]: Boogie Preprocessor took 48.10 ms. Allocated memory is still 402.1 MB. Free memory was 309.0 MB in the beginning and 305.1 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. [2018-04-10 16:35:13,626 INFO L168 Benchmark]: RCFGBuilder took 539.66 ms. Allocated memory was 402.1 MB in the beginning and 589.3 MB in the end (delta: 187.2 MB). Free memory was 305.1 MB in the beginning and 500.0 MB in the end (delta: -194.9 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. [2018-04-10 16:35:13,626 INFO L168 Benchmark]: TraceAbstraction took 204124.40 ms. Allocated memory was 589.3 MB in the beginning and 640.2 MB in the end (delta: 50.9 MB). Free memory was 498.6 MB in the beginning and 500.7 MB in the end (delta: -2.1 MB). Peak memory consumption was 48.8 MB. Max. memory is 5.3 GB. [2018-04-10 16:35:13,627 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.20 ms. Allocated memory is still 402.1 MB. Free memory is still 362.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 238.01 ms. Allocated memory is still 402.1 MB. Free memory was 336.8 MB in the beginning and 309.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 48.10 ms. Allocated memory is still 402.1 MB. Free memory was 309.0 MB in the beginning and 305.1 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 539.66 ms. Allocated memory was 402.1 MB in the beginning and 589.3 MB in the end (delta: 187.2 MB). Free memory was 305.1 MB in the beginning and 500.0 MB in the end (delta: -194.9 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 204124.40 ms. Allocated memory was 589.3 MB in the beginning and 640.2 MB in the end (delta: 50.9 MB). Free memory was 498.6 MB in the beginning and 500.7 MB in the end (delta: -2.1 MB). Peak memory consumption was 48.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1041]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1067]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1067). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1021]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1048]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1048). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1060]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1060). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1019]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1033). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1026]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1040]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1040). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1024]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 988). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1051]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1051). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1057]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1057). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1001]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1041]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1000]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1000). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 998]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1031]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1031). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1048]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1048). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1058]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1058). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1009]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1009). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1036]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1036). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1068]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1068). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1026]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 999]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1050]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1050). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1057]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1057). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1019]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1040]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1040). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 999]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1036]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1036). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1041]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 983]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 983). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1032]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1032). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1000]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1000). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1032]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1032). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1053). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1051]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1051). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1024]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1027]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1027). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1068]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1068). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1019]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1034]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1034). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1050]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1050). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1058]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1058). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1041]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1033). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1009]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1009). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1019]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 988). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1042]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1067]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1067). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1040]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1040). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1019]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1027]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1027). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1021]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1053). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 999]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1060]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1060). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1042]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 998]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1019]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 999]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1031]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1031). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1040]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1040). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1001]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - TimeoutResultAtElement [Line: 1034]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1034). Cancelled while BasicCegarLoop was constructing difference of abstraction (358states) and interpolant automaton (currently 24 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 218. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 185 locations, 73 error locations. TIMEOUT Result, 204.0s OverallTime, 32 OverallIterations, 3 TraceHistogramMax, 123.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3897 SDtfs, 15770 SDslu, 17573 SDs, 0 SdLazy, 21828 SolverSat, 1336 SolverUnsat, 50 SolverUnknown, 0 SolverNotchecked, 30.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1287 GetRequests, 643 SyntacticMatches, 3 SemanticMatches, 640 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4419 ImplicationChecksByTransitivity, 132.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=364occurred in iteration=28, 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, 31 MinimizatonAttempts, 1997 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 79.0s InterpolantComputationTime, 2266 NumberOfCodeBlocks, 2266 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 1312 ConstructedInterpolants, 412 QuantifiedInterpolants, 3362258 SizeOfPredicates, 300 NumberOfNonLiveVariables, 3750 ConjunctsInSsa, 719 ConjunctsInUnsatCore, 32 InterpolantComputations, 20 PerfectInterpolantSequences, 61/181 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-sorted_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-10_16-35-13-633.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-sorted_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-10_16-35-13-633.csv Completed graceful shutdown