java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/memsafety-ext/tree_parent_ptr_true-valid-memsafety_false-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 15:51:51,613 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 15:51:51,615 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 15:51:51,629 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 15:51:51,629 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 15:51:51,630 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 15:51:51,631 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 15:51:51,633 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 15:51:51,635 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 15:51:51,636 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 15:51:51,637 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 15:51:51,637 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 15:51:51,638 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 15:51:51,639 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 15:51:51,640 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 15:51:51,642 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 15:51:51,644 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 15:51:51,645 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 15:51:51,646 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 15:51:51,647 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 15:51:51,649 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 15:51:51,649 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 15:51:51,650 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 15:51:51,650 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 15:51:51,651 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 15:51:51,652 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 15:51:51,652 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 15:51:51,653 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 15:51:51,653 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 15:51:51,653 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 15:51:51,654 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 15:51:51,654 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-11 15:51:51,675 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 15:51:51,675 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 15:51:51,676 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 15:51:51,677 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 15:51:51,677 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 15:51:51,677 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 15:51:51,677 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 15:51:51,677 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 15:51:51,677 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 15:51:51,677 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 15:51:51,678 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 15:51:51,678 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 15:51:51,678 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 15:51:51,678 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 15:51:51,678 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 15:51:51,678 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 15:51:51,678 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 15:51:51,679 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 15:51:51,679 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 15:51:51,679 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 15:51:51,679 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 15:51:51,679 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 15:51:51,679 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 15:51:51,679 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-11 15:51:51,708 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 15:51:51,719 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 15:51:51,723 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 15:51:51,724 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 15:51:51,725 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 15:51:51,725 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,027 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGa4bab51d8 [2018-04-11 15:51:52,177 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 15:51:52,177 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 15:51:52,178 INFO L168 CDTParser]: Scanning tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,184 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 15:51:52,185 INFO L215 ultiparseSymbolTable]: [2018-04-11 15:51:52,185 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 15:51:52,185 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,185 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 15:51:52,185 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____ssize_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,185 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____mode_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,185 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__fsfilcnt_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,185 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__int8_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,185 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__u_int64_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,185 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__int32_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,185 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____socklen_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,185 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__pthread_mutexattr_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,185 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__gid_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,186 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__ldiv_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,186 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____blkcnt64_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,186 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__u_short in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,186 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____fsfilcnt64_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,186 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__pthread_mutex_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,186 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____time_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,186 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__pid_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,186 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__ino_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,186 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__timer_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,186 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__mode_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,186 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__u_int in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,186 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____int8_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,186 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____u_short in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,186 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____fsblkcnt64_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,186 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__key_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,186 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____nlink_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,186 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____fsfilcnt_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,186 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__fsblkcnt_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,186 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____timer_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,187 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____id_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,187 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____int32_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,187 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____fd_mask in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,187 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__nlink_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,187 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____qaddr_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,187 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____blksize_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,187 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__pthread_rwlock_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,187 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__pthread_key_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,187 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____rlim64_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,187 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____fsblkcnt_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,187 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____sig_atomic_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,187 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__u_quad_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,188 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____useconds_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,188 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____uint64_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,188 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__loff_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,188 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__uint in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,188 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____uint8_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,188 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____key_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,188 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____uid_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,188 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__ssize_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,188 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____int64_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,188 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__pthread_barrierattr_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,189 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____swblk_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,189 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__register_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,189 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__sigset_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,189 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__dev_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,189 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__id_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,189 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____u_int in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,189 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__time_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,189 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____blkcnt_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,189 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____quad_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,189 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____off_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,189 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____fsid_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,189 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____uint16_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,190 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____gid_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,190 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__daddr_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,190 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____ino64_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,190 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__clock_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,190 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____pid_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,190 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____ino_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,190 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__ushort in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,190 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__fd_mask in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,190 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__u_long in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,190 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__pthread_barrier_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,191 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__ulong in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,191 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__pthread_rwlockattr_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,191 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____u_quad_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,191 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__fsid_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,191 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__clockid_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,191 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__u_int32_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,191 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__int64_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,191 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__suseconds_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,191 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____daddr_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,191 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____WAIT_STATUS in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,191 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__u_int8_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,192 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__pthread_condattr_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,192 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____loff_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,192 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____clock_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,192 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__pthread_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,192 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__blksize_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,192 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____u_char in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,192 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__fd_set in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,192 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__wchar_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,192 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__uid_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,192 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__pthread_attr_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,192 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__lldiv_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,192 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____dev_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,193 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__int16_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,193 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____off64_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,193 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____suseconds_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,193 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____caddr_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,193 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__caddr_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,193 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__u_int16_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,193 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__u_char in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,193 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__pthread_spinlock_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,193 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____rlim_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,193 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__quad_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,193 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__blkcnt_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,193 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____sigset_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,193 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____clockid_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,193 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____pthread_list_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,193 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__size_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,193 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____int16_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,194 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__off_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,194 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____intptr_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,194 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__div_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,194 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____uint32_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,194 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____u_long in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,194 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__pthread_cond_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,194 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__pthread_once_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:52,207 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGa4bab51d8 [2018-04-11 15:51:52,211 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 15:51:52,212 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 15:51:52,213 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 15:51:52,213 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 15:51:52,217 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 15:51:52,218 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 03:51:52" (1/1) ... [2018-04-11 15:51:52,219 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45317404 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:51:52, skipping insertion in model container [2018-04-11 15:51:52,219 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 03:51:52" (1/1) ... [2018-04-11 15:51:52,230 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 15:51:52,253 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 15:51:52,386 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 15:51:52,423 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 15:51:52,429 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 110 non ball SCCs. Number of states in SCCs 110. [2018-04-11 15:51:52,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:51:52 WrapperNode [2018-04-11 15:51:52,465 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 15:51:52,466 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 15:51:52,466 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 15:51:52,466 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 15:51:52,474 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:51:52" (1/1) ... [2018-04-11 15:51:52,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:51:52" (1/1) ... [2018-04-11 15:51:52,486 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:51:52" (1/1) ... [2018-04-11 15:51:52,486 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:51:52" (1/1) ... [2018-04-11 15:51:52,496 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:51:52" (1/1) ... [2018-04-11 15:51:52,501 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:51:52" (1/1) ... [2018-04-11 15:51:52,503 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:51:52" (1/1) ... [2018-04-11 15:51:52,506 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 15:51:52,506 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 15:51:52,506 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 15:51:52,506 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 15:51:52,507 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:51:52" (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-11 15:51:52,590 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 15:51:52,590 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 15:51:52,591 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 15:51:52,591 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 15:51:52,591 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-11 15:51:52,591 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 15:51:52,591 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 15:51:52,591 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 15:51:52,591 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 15:51:52,591 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 15:51:52,592 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 15:51:52,592 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 15:51:52,592 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 15:51:52,592 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 15:51:52,592 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 15:51:52,592 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 15:51:52,592 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 15:51:52,592 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 15:51:52,592 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 15:51:52,592 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 15:51:52,593 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 15:51:52,593 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 15:51:52,593 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 15:51:52,593 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 15:51:52,593 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 15:51:52,593 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 15:51:52,593 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 15:51:52,593 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 15:51:52,593 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 15:51:52,593 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 15:51:52,594 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 15:51:52,594 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 15:51:52,594 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 15:51:52,594 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 15:51:52,594 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 15:51:52,594 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 15:51:52,594 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 15:51:52,594 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 15:51:52,594 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 15:51:52,595 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 15:51:52,595 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 15:51:52,595 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 15:51:52,595 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 15:51:52,595 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 15:51:52,595 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 15:51:52,595 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 15:51:52,595 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 15:51:52,595 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 15:51:52,595 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 15:51:52,596 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 15:51:52,596 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 15:51:52,596 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 15:51:52,596 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 15:51:52,596 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 15:51:52,596 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 15:51:52,596 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 15:51:52,596 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 15:51:52,596 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 15:51:52,596 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 15:51:52,597 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 15:51:52,597 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 15:51:52,597 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 15:51:52,597 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 15:51:52,597 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 15:51:52,597 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 15:51:52,597 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 15:51:52,597 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 15:51:52,597 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 15:51:52,597 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 15:51:52,597 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-11 15:51:52,598 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 15:51:52,598 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 15:51:52,598 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 15:51:52,598 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 15:51:52,598 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 15:51:52,598 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 15:51:52,598 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 15:51:52,598 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 15:51:52,598 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 15:51:52,598 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 15:51:52,599 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 15:51:52,599 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 15:51:52,599 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 15:51:52,599 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 15:51:52,599 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 15:51:52,599 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 15:51:52,599 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 15:51:52,599 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 15:51:52,599 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 15:51:52,599 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 15:51:52,599 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 15:51:52,599 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 15:51:52,599 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 15:51:52,599 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 15:51:52,599 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 15:51:52,599 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 15:51:52,599 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 15:51:52,599 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 15:51:52,600 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 15:51:52,600 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 15:51:52,600 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 15:51:52,600 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 15:51:52,600 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 15:51:52,600 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 15:51:52,600 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 15:51:52,600 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 15:51:52,600 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 15:51:52,600 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 15:51:52,601 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-11 15:51:52,601 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-11 15:51:52,601 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 15:51:52,601 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 15:51:52,601 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 15:51:53,040 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 15:51:53,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 03:51:53 BoogieIcfgContainer [2018-04-11 15:51:53,040 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 15:51:53,041 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 15:51:53,041 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 15:51:53,043 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 15:51:53,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 03:51:52" (1/3) ... [2018-04-11 15:51:53,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42f9a75c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 03:51:53, skipping insertion in model container [2018-04-11 15:51:53,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:51:52" (2/3) ... [2018-04-11 15:51:53,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42f9a75c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 03:51:53, skipping insertion in model container [2018-04-11 15:51:53,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 03:51:53" (3/3) ... [2018-04-11 15:51:53,045 INFO L107 eAbstractionObserver]: Analyzing ICFG tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 15:51:53,050 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 15:51:53,056 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 75 error locations. [2018-04-11 15:51:53,082 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 15:51:53,082 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 15:51:53,082 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 15:51:53,082 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 15:51:53,083 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 15:51:53,083 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 15:51:53,083 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 15:51:53,083 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 15:51:53,083 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 15:51:53,083 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 15:51:53,095 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states. [2018-04-11 15:51:53,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-11 15:51:53,102 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:51:53,103 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:51:53,103 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 15:51:53,106 INFO L82 PathProgramCache]: Analyzing trace with hash 921047381, now seen corresponding path program 1 times [2018-04-11 15:51:53,107 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:51:53,107 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:51:53,135 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:51:53,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:51:53,135 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:51:53,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:51:53,164 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:51:53,204 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-11 15:51:53,205 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:51:53,206 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:51:53,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:51:53,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:51:53,215 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:51:53,217 INFO L87 Difference]: Start difference. First operand 168 states. Second operand 4 states. [2018-04-11 15:51:53,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:51:53,463 INFO L93 Difference]: Finished difference Result 184 states and 195 transitions. [2018-04-11 15:51:53,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 15:51:53,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-11 15:51:53,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:51:53,474 INFO L225 Difference]: With dead ends: 184 [2018-04-11 15:51:53,474 INFO L226 Difference]: Without dead ends: 180 [2018-04-11 15:51:53,476 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-11 15:51:53,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-04-11 15:51:53,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 162. [2018-04-11 15:51:53,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-04-11 15:51:53,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 172 transitions. [2018-04-11 15:51:53,512 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 172 transitions. Word has length 8 [2018-04-11 15:51:53,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:51:53,512 INFO L459 AbstractCegarLoop]: Abstraction has 162 states and 172 transitions. [2018-04-11 15:51:53,512 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:51:53,512 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 172 transitions. [2018-04-11 15:51:53,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-11 15:51:53,513 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:51:53,513 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:51:53,513 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 15:51:53,513 INFO L82 PathProgramCache]: Analyzing trace with hash 921047382, now seen corresponding path program 1 times [2018-04-11 15:51:53,513 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:51:53,513 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:51:53,514 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:51:53,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:51:53,514 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:51:53,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:51:53,525 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:51:53,562 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-11 15:51:53,563 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:51:53,563 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:51:53,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:51:53,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:51:53,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:51:53,565 INFO L87 Difference]: Start difference. First operand 162 states and 172 transitions. Second operand 4 states. [2018-04-11 15:51:53,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:51:53,717 INFO L93 Difference]: Finished difference Result 159 states and 169 transitions. [2018-04-11 15:51:53,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 15:51:53,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-11 15:51:53,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:51:53,718 INFO L225 Difference]: With dead ends: 159 [2018-04-11 15:51:53,719 INFO L226 Difference]: Without dead ends: 159 [2018-04-11 15:51:53,719 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-11 15:51:53,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-04-11 15:51:53,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-04-11 15:51:53,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-04-11 15:51:53,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 169 transitions. [2018-04-11 15:51:53,724 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 169 transitions. Word has length 8 [2018-04-11 15:51:53,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:51:53,724 INFO L459 AbstractCegarLoop]: Abstraction has 159 states and 169 transitions. [2018-04-11 15:51:53,724 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:51:53,724 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 169 transitions. [2018-04-11 15:51:53,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-11 15:51:53,725 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:51:53,725 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:51:53,725 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 15:51:53,725 INFO L82 PathProgramCache]: Analyzing trace with hash -394420831, now seen corresponding path program 1 times [2018-04-11 15:51:53,725 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:51:53,725 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:51:53,726 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:51:53,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:51:53,726 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:51:53,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:51:53,739 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:51:53,764 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-11 15:51:53,764 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:51:53,764 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:51:53,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:51:53,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:51:53,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:51:53,765 INFO L87 Difference]: Start difference. First operand 159 states and 169 transitions. Second operand 4 states. [2018-04-11 15:51:53,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:51:53,890 INFO L93 Difference]: Finished difference Result 167 states and 178 transitions. [2018-04-11 15:51:53,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 15:51:53,890 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-04-11 15:51:53,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:51:53,891 INFO L225 Difference]: With dead ends: 167 [2018-04-11 15:51:53,891 INFO L226 Difference]: Without dead ends: 167 [2018-04-11 15:51:53,891 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-11 15:51:53,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-04-11 15:51:53,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 144. [2018-04-11 15:51:53,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-04-11 15:51:53,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 155 transitions. [2018-04-11 15:51:53,897 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 155 transitions. Word has length 15 [2018-04-11 15:51:53,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:51:53,897 INFO L459 AbstractCegarLoop]: Abstraction has 144 states and 155 transitions. [2018-04-11 15:51:53,897 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:51:53,897 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 155 transitions. [2018-04-11 15:51:53,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-11 15:51:53,897 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:51:53,897 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:51:53,897 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 15:51:53,897 INFO L82 PathProgramCache]: Analyzing trace with hash -394420830, now seen corresponding path program 1 times [2018-04-11 15:51:53,898 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:51:53,898 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:51:53,898 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:51:53,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:51:53,898 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:51:53,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:51:53,909 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:51:53,965 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-11 15:51:53,966 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:51:53,966 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:51:53,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:51:53,966 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:51:53,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:51:53,967 INFO L87 Difference]: Start difference. First operand 144 states and 155 transitions. Second operand 5 states. [2018-04-11 15:51:54,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:51:54,141 INFO L93 Difference]: Finished difference Result 200 states and 218 transitions. [2018-04-11 15:51:54,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 15:51:54,141 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-04-11 15:51:54,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:51:54,144 INFO L225 Difference]: With dead ends: 200 [2018-04-11 15:51:54,144 INFO L226 Difference]: Without dead ends: 200 [2018-04-11 15:51:54,144 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-11 15:51:54,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-04-11 15:51:54,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 180. [2018-04-11 15:51:54,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-04-11 15:51:54,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 207 transitions. [2018-04-11 15:51:54,152 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 207 transitions. Word has length 15 [2018-04-11 15:51:54,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:51:54,152 INFO L459 AbstractCegarLoop]: Abstraction has 180 states and 207 transitions. [2018-04-11 15:51:54,152 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:51:54,153 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 207 transitions. [2018-04-11 15:51:54,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-11 15:51:54,153 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:51:54,153 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:51:54,153 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 15:51:54,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1079358145, now seen corresponding path program 1 times [2018-04-11 15:51:54,153 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:51:54,154 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:51:54,154 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:51:54,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:51:54,155 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:51:54,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:51:54,165 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:51:54,182 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-11 15:51:54,182 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:51:54,183 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:51:54,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:51:54,183 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:51:54,183 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:51:54,183 INFO L87 Difference]: Start difference. First operand 180 states and 207 transitions. Second operand 4 states. [2018-04-11 15:51:54,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:51:54,265 INFO L93 Difference]: Finished difference Result 195 states and 222 transitions. [2018-04-11 15:51:54,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 15:51:54,265 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-04-11 15:51:54,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:51:54,266 INFO L225 Difference]: With dead ends: 195 [2018-04-11 15:51:54,266 INFO L226 Difference]: Without dead ends: 195 [2018-04-11 15:51:54,266 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-11 15:51:54,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-04-11 15:51:54,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 181. [2018-04-11 15:51:54,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-04-11 15:51:54,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 210 transitions. [2018-04-11 15:51:54,272 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 210 transitions. Word has length 17 [2018-04-11 15:51:54,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:51:54,272 INFO L459 AbstractCegarLoop]: Abstraction has 181 states and 210 transitions. [2018-04-11 15:51:54,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:51:54,273 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 210 transitions. [2018-04-11 15:51:54,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-11 15:51:54,273 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:51:54,273 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:51:54,274 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 15:51:54,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1079358144, now seen corresponding path program 1 times [2018-04-11 15:51:54,274 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:51:54,274 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:51:54,275 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:51:54,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:51:54,275 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:51:54,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:51:54,290 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:51:54,323 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-11 15:51:54,324 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:51:54,324 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:51:54,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:51:54,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:51:54,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:51:54,325 INFO L87 Difference]: Start difference. First operand 181 states and 210 transitions. Second operand 4 states. [2018-04-11 15:51:54,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:51:54,439 INFO L93 Difference]: Finished difference Result 183 states and 210 transitions. [2018-04-11 15:51:54,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 15:51:54,439 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-04-11 15:51:54,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:51:54,440 INFO L225 Difference]: With dead ends: 183 [2018-04-11 15:51:54,440 INFO L226 Difference]: Without dead ends: 183 [2018-04-11 15:51:54,440 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-11 15:51:54,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-04-11 15:51:54,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 179. [2018-04-11 15:51:54,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-04-11 15:51:54,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 207 transitions. [2018-04-11 15:51:54,443 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 207 transitions. Word has length 17 [2018-04-11 15:51:54,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:51:54,444 INFO L459 AbstractCegarLoop]: Abstraction has 179 states and 207 transitions. [2018-04-11 15:51:54,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:51:54,444 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 207 transitions. [2018-04-11 15:51:54,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-11 15:51:54,444 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:51:54,444 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-11 15:51:54,444 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 15:51:54,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1382861924, now seen corresponding path program 1 times [2018-04-11 15:51:54,445 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:51:54,445 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:51:54,445 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:51:54,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:51:54,446 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:51:54,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:51:54,456 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:51:54,476 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-11 15:51:54,476 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:51:54,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:51:54,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:51:54,476 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:51:54,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:51:54,477 INFO L87 Difference]: Start difference. First operand 179 states and 207 transitions. Second operand 4 states. [2018-04-11 15:51:54,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:51:54,490 INFO L93 Difference]: Finished difference Result 180 states and 207 transitions. [2018-04-11 15:51:54,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 15:51:54,490 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-04-11 15:51:54,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:51:54,491 INFO L225 Difference]: With dead ends: 180 [2018-04-11 15:51:54,491 INFO L226 Difference]: Without dead ends: 180 [2018-04-11 15:51:54,491 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:51:54,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-04-11 15:51:54,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 179. [2018-04-11 15:51:54,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-04-11 15:51:54,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 206 transitions. [2018-04-11 15:51:54,495 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 206 transitions. Word has length 22 [2018-04-11 15:51:54,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:51:54,496 INFO L459 AbstractCegarLoop]: Abstraction has 179 states and 206 transitions. [2018-04-11 15:51:54,496 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:51:54,496 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 206 transitions. [2018-04-11 15:51:54,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-11 15:51:54,496 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:51:54,497 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:51:54,497 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 15:51:54,497 INFO L82 PathProgramCache]: Analyzing trace with hash -80956025, now seen corresponding path program 1 times [2018-04-11 15:51:54,497 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:51:54,497 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:51:54,497 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:51:54,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:51:54,498 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:51:54,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:51:54,506 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:51:54,538 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-11 15:51:54,539 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:51:54,539 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:51:54,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:51:54,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:51:54,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:51:54,540 INFO L87 Difference]: Start difference. First operand 179 states and 206 transitions. Second operand 5 states. [2018-04-11 15:51:54,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:51:54,654 INFO L93 Difference]: Finished difference Result 196 states and 224 transitions. [2018-04-11 15:51:54,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:51:54,654 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-04-11 15:51:54,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:51:54,655 INFO L225 Difference]: With dead ends: 196 [2018-04-11 15:51:54,655 INFO L226 Difference]: Without dead ends: 196 [2018-04-11 15:51:54,655 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:51:54,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-04-11 15:51:54,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 178. [2018-04-11 15:51:54,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-04-11 15:51:54,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 206 transitions. [2018-04-11 15:51:54,658 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 206 transitions. Word has length 23 [2018-04-11 15:51:54,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:51:54,658 INFO L459 AbstractCegarLoop]: Abstraction has 178 states and 206 transitions. [2018-04-11 15:51:54,658 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:51:54,658 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 206 transitions. [2018-04-11 15:51:54,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-11 15:51:54,659 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:51:54,659 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:51:54,659 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 15:51:54,659 INFO L82 PathProgramCache]: Analyzing trace with hash -80956024, now seen corresponding path program 1 times [2018-04-11 15:51:54,659 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:51:54,659 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:51:54,660 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:51:54,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:51:54,660 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:51:54,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:51:54,671 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:51:54,703 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-11 15:51:54,704 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:51:54,704 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:51:54,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:51:54,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:51:54,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:51:54,704 INFO L87 Difference]: Start difference. First operand 178 states and 206 transitions. Second operand 5 states. [2018-04-11 15:51:54,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:51:54,867 INFO L93 Difference]: Finished difference Result 202 states and 231 transitions. [2018-04-11 15:51:54,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:51:54,867 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-04-11 15:51:54,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:51:54,868 INFO L225 Difference]: With dead ends: 202 [2018-04-11 15:51:54,868 INFO L226 Difference]: Without dead ends: 202 [2018-04-11 15:51:54,869 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-11 15:51:54,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-04-11 15:51:54,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 180. [2018-04-11 15:51:54,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-04-11 15:51:54,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 207 transitions. [2018-04-11 15:51:54,871 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 207 transitions. Word has length 23 [2018-04-11 15:51:54,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:51:54,871 INFO L459 AbstractCegarLoop]: Abstraction has 180 states and 207 transitions. [2018-04-11 15:51:54,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:51:54,871 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 207 transitions. [2018-04-11 15:51:54,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-11 15:51:54,872 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:51:54,872 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:51:54,872 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 15:51:54,872 INFO L82 PathProgramCache]: Analyzing trace with hash -2040041390, now seen corresponding path program 1 times [2018-04-11 15:51:54,872 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:51:54,872 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:51:54,873 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:51:54,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:51:54,873 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:51:54,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:51:54,881 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:51:54,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:51:54,896 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:51:54,896 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:51:54,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 15:51:54,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 15:51:54,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 15:51:54,897 INFO L87 Difference]: Start difference. First operand 180 states and 207 transitions. Second operand 3 states. [2018-04-11 15:51:54,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:51:54,901 INFO L93 Difference]: Finished difference Result 182 states and 209 transitions. [2018-04-11 15:51:54,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 15:51:54,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-04-11 15:51:54,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:51:54,903 INFO L225 Difference]: With dead ends: 182 [2018-04-11 15:51:54,904 INFO L226 Difference]: Without dead ends: 182 [2018-04-11 15:51:54,904 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-11 15:51:54,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-04-11 15:51:54,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-04-11 15:51:54,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-04-11 15:51:54,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 209 transitions. [2018-04-11 15:51:54,907 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 209 transitions. Word has length 23 [2018-04-11 15:51:54,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:51:54,908 INFO L459 AbstractCegarLoop]: Abstraction has 182 states and 209 transitions. [2018-04-11 15:51:54,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 15:51:54,908 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 209 transitions. [2018-04-11 15:51:54,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-11 15:51:54,909 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:51:54,909 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:51:54,909 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 15:51:54,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1293948495, now seen corresponding path program 1 times [2018-04-11 15:51:54,909 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:51:54,909 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:51:54,910 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:51:54,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:51:54,910 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:51:54,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:51:54,921 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:51:54,926 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:51:54,926 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:51:54,926 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:51:54,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:51:54,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:51:54,965 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:51:54,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 15:51:55,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 15:51:55,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:51:55,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:51:55,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 15:51:55,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 10 treesize of output 9 [2018-04-11 15:51:55,008 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:51:55,009 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:51:55,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:51:55,013 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-04-11 15:51:55,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-04-11 15:51:55,026 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:51:55,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-11 15:51:55,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:51:55,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:51:55,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-04-11 15:51:55,045 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:51:55,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-11 15:51:55,046 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:51:55,050 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:51:55,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:51:55,055 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:45, output treesize:37 [2018-04-11 15:51:55,077 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-11 15:51:55,079 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:51:55,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 12 [2018-04-11 15:51:55,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:51:55,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:51:55,088 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-11 15:51:55,090 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:51:55,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 12 [2018-04-11 15:51:55,091 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:51:55,093 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:51:55,095 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-11 15:51:55,095 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:55, output treesize:7 [2018-04-11 15:51:55,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:51:55,113 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:51:55,113 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 15:51:55,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 15:51:55,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 15:51:55,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-11 15:51:55,113 INFO L87 Difference]: Start difference. First operand 182 states and 209 transitions. Second operand 7 states. [2018-04-11 15:51:55,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:51:55,356 INFO L93 Difference]: Finished difference Result 228 states and 262 transitions. [2018-04-11 15:51:55,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 15:51:55,356 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-04-11 15:51:55,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:51:55,357 INFO L225 Difference]: With dead ends: 228 [2018-04-11 15:51:55,357 INFO L226 Difference]: Without dead ends: 228 [2018-04-11 15:51:55,357 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-04-11 15:51:55,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-04-11 15:51:55,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 200. [2018-04-11 15:51:55,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-04-11 15:51:55,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 233 transitions. [2018-04-11 15:51:55,362 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 233 transitions. Word has length 25 [2018-04-11 15:51:55,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:51:55,362 INFO L459 AbstractCegarLoop]: Abstraction has 200 states and 233 transitions. [2018-04-11 15:51:55,362 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 15:51:55,362 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 233 transitions. [2018-04-11 15:51:55,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 15:51:55,363 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:51:55,363 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:51:55,363 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 15:51:55,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1343522610, now seen corresponding path program 1 times [2018-04-11 15:51:55,363 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:51:55,363 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:51:55,364 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:51:55,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:51:55,364 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:51:55,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:51:55,374 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:51:55,397 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-11 15:51:55,397 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:51:55,397 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:51:55,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:51:55,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:51:55,398 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:51:55,398 INFO L87 Difference]: Start difference. First operand 200 states and 233 transitions. Second operand 5 states. [2018-04-11 15:51:55,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:51:55,576 INFO L93 Difference]: Finished difference Result 295 states and 346 transitions. [2018-04-11 15:51:55,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:51:55,576 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-04-11 15:51:55,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:51:55,577 INFO L225 Difference]: With dead ends: 295 [2018-04-11 15:51:55,577 INFO L226 Difference]: Without dead ends: 295 [2018-04-11 15:51:55,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-11 15:51:55,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-04-11 15:51:55,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 199. [2018-04-11 15:51:55,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-04-11 15:51:55,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 231 transitions. [2018-04-11 15:51:55,580 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 231 transitions. Word has length 26 [2018-04-11 15:51:55,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:51:55,580 INFO L459 AbstractCegarLoop]: Abstraction has 199 states and 231 transitions. [2018-04-11 15:51:55,580 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:51:55,580 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 231 transitions. [2018-04-11 15:51:55,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 15:51:55,581 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:51:55,581 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:51:55,581 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 15:51:55,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1343522611, now seen corresponding path program 1 times [2018-04-11 15:51:55,581 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:51:55,581 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:51:55,581 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:51:55,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:51:55,581 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:51:55,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:51:55,587 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:51:55,634 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-11 15:51:55,634 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:51:55,634 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:51:55,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:51:55,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:51:55,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:51:55,635 INFO L87 Difference]: Start difference. First operand 199 states and 231 transitions. Second operand 5 states. [2018-04-11 15:51:55,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:51:55,821 INFO L93 Difference]: Finished difference Result 282 states and 332 transitions. [2018-04-11 15:51:55,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:51:55,822 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-04-11 15:51:55,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:51:55,822 INFO L225 Difference]: With dead ends: 282 [2018-04-11 15:51:55,822 INFO L226 Difference]: Without dead ends: 282 [2018-04-11 15:51:55,823 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-11 15:51:55,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-04-11 15:51:55,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 198. [2018-04-11 15:51:55,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-04-11 15:51:55,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 229 transitions. [2018-04-11 15:51:55,826 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 229 transitions. Word has length 26 [2018-04-11 15:51:55,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:51:55,826 INFO L459 AbstractCegarLoop]: Abstraction has 198 states and 229 transitions. [2018-04-11 15:51:55,826 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:51:55,827 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 229 transitions. [2018-04-11 15:51:55,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 15:51:55,827 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:51:55,827 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:51:55,828 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 15:51:55,828 INFO L82 PathProgramCache]: Analyzing trace with hash -332817586, now seen corresponding path program 1 times [2018-04-11 15:51:55,828 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:51:55,828 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:51:55,828 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:51:55,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:51:55,829 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:51:55,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:51:55,838 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:51:55,857 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:51:55,857 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:51:55,857 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:51:55,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:51:55,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:51:55,882 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:51:55,902 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:51:55,903 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:51:55,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 15:51:55,904 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:51:55,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:51:55,909 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-04-11 15:51:55,927 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-11 15:51:55,929 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-11 15:51:55,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:51:55,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:51:55,933 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-11 15:51:55,934 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-04-11 15:51:55,950 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 27 treesize of output 21 [2018-04-11 15:51:55,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2018-04-11 15:51:55,960 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-11 15:51:55,966 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 15:51:55,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 15:51:55,974 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:37 [2018-04-11 15:51:56,042 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:51:56,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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 15 [2018-04-11 15:51:56,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:51:56,049 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-11 15:51:56,049 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2018-04-11 15:51:56,068 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-11 15:51:56,069 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:51:56,069 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-04-11 15:51:56,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 15:51:56,070 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 15:51:56,070 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-04-11 15:51:56,070 INFO L87 Difference]: Start difference. First operand 198 states and 229 transitions. Second operand 13 states. [2018-04-11 15:51:56,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:51:56,563 INFO L93 Difference]: Finished difference Result 212 states and 245 transitions. [2018-04-11 15:51:56,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 15:51:56,563 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2018-04-11 15:51:56,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:51:56,564 INFO L225 Difference]: With dead ends: 212 [2018-04-11 15:51:56,564 INFO L226 Difference]: Without dead ends: 212 [2018-04-11 15:51:56,564 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2018-04-11 15:51:56,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-04-11 15:51:56,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 201. [2018-04-11 15:51:56,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-04-11 15:51:56,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 233 transitions. [2018-04-11 15:51:56,567 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 233 transitions. Word has length 28 [2018-04-11 15:51:56,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:51:56,575 INFO L459 AbstractCegarLoop]: Abstraction has 201 states and 233 transitions. [2018-04-11 15:51:56,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 15:51:56,575 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 233 transitions. [2018-04-11 15:51:56,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 15:51:56,575 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:51:56,576 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:51:56,576 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 15:51:56,576 INFO L82 PathProgramCache]: Analyzing trace with hash -332817585, now seen corresponding path program 1 times [2018-04-11 15:51:56,576 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:51:56,576 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:51:56,576 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:51:56,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:51:56,577 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:51:56,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:51:56,586 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:51:56,589 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:51:56,589 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:51:56,589 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:51:56,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:51:56,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:51:56,614 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:51:56,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:51:56,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:51:56,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:51:56,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:51:56,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:51:56,655 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:51:56,671 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:51:56,671 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:51:56,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-11 15:51:56,672 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:51:56,680 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:51:56,681 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:51:56,681 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-11 15:51:56,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:51:56,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:51:56,686 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:20 [2018-04-11 15:51:56,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11 15:51:56,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 15:51:56,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:51:56,705 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:51:56,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:51:56,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 15:51:56,713 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:51:56,714 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:51:56,720 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-11 15:51:56,720 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:29 [2018-04-11 15:51:56,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-11 15:51:56,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 16 [2018-04-11 15:51:56,747 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-11 15:51:56,751 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 15:51:56,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-04-11 15:51:56,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2018-04-11 15:51:56,765 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 15:51:56,769 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:51:56,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-04-11 15:51:56,778 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:47, output treesize:75 [2018-04-11 15:51:56,857 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-11 15:51:56,857 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:51:56,857 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-11 15:51:56,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 15:51:56,858 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 15:51:56,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-04-11 15:51:56,858 INFO L87 Difference]: Start difference. First operand 201 states and 233 transitions. Second operand 12 states. [2018-04-11 15:51:57,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:51:57,732 INFO L93 Difference]: Finished difference Result 278 states and 314 transitions. [2018-04-11 15:51:57,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 15:51:57,732 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-04-11 15:51:57,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:51:57,733 INFO L225 Difference]: With dead ends: 278 [2018-04-11 15:51:57,733 INFO L226 Difference]: Without dead ends: 278 [2018-04-11 15:51:57,734 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2018-04-11 15:51:57,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-04-11 15:51:57,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 205. [2018-04-11 15:51:57,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-04-11 15:51:57,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 238 transitions. [2018-04-11 15:51:57,738 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 238 transitions. Word has length 28 [2018-04-11 15:51:57,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:51:57,738 INFO L459 AbstractCegarLoop]: Abstraction has 205 states and 238 transitions. [2018-04-11 15:51:57,738 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 15:51:57,738 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 238 transitions. [2018-04-11 15:51:57,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 15:51:57,739 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:51:57,739 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:51:57,739 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 15:51:57,739 INFO L82 PathProgramCache]: Analyzing trace with hash 81900715, now seen corresponding path program 1 times [2018-04-11 15:51:57,739 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:51:57,739 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:51:57,740 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:51:57,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:51:57,740 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:51:57,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:51:57,748 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:51:57,750 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:51:57,750 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:51:57,750 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:51:57,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:51:57,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:51:57,773 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:51:57,785 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:51:57,786 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:51:57,787 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-11 15:51:57,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:51:57,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:51:57,792 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-11 15:51:57,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 15:51:57,808 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-11 15:51:57,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:51:57,810 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:51:57,815 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-11 15:51:57,815 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-04-11 15:51:57,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-04-11 15:51:57,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 15:51:57,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:51:57,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:51:57,851 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-11 15:51:57,851 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-04-11 15:51:57,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2018-04-11 15:51:57,872 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-11 15:51:57,873 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:51:57,877 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-11 15:51:57,877 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:51:57,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:51:57,883 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-11 15:51:57,883 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2018-04-11 15:51:57,892 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-11 15:51:57,893 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:51:57,893 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 15:51:57,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 15:51:57,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 15:51:57,893 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:51:57,894 INFO L87 Difference]: Start difference. First operand 205 states and 238 transitions. Second operand 8 states. [2018-04-11 15:51:58,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:51:58,182 INFO L93 Difference]: Finished difference Result 251 states and 293 transitions. [2018-04-11 15:51:58,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 15:51:58,183 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-04-11 15:51:58,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:51:58,184 INFO L225 Difference]: With dead ends: 251 [2018-04-11 15:51:58,184 INFO L226 Difference]: Without dead ends: 251 [2018-04-11 15:51:58,184 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-04-11 15:51:58,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-04-11 15:51:58,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 204. [2018-04-11 15:51:58,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-04-11 15:51:58,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 236 transitions. [2018-04-11 15:51:58,187 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 236 transitions. Word has length 29 [2018-04-11 15:51:58,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:51:58,188 INFO L459 AbstractCegarLoop]: Abstraction has 204 states and 236 transitions. [2018-04-11 15:51:58,188 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 15:51:58,188 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 236 transitions. [2018-04-11 15:51:58,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 15:51:58,188 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:51:58,188 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:51:58,189 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 15:51:58,189 INFO L82 PathProgramCache]: Analyzing trace with hash 81900716, now seen corresponding path program 1 times [2018-04-11 15:51:58,189 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:51:58,189 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:51:58,190 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:51:58,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:51:58,190 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:51:58,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:51:58,199 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:51:58,202 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:51:58,202 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:51:58,202 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:51:58,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:51:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:51:58,230 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:51:58,244 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:51:58,245 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:51:58,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, 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-11 15:51:58,246 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:51:58,252 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-11 15:51:58,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:51:58,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:51:58,257 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-11 15:51:58,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 15:51:58,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:51:58,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 15:51:58,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 15:51:58,279 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:51:58,283 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:51:58,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 11 treesize of output 8 [2018-04-11 15:51:58,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, 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-11 15:51:58,294 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 15:51:58,295 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:51:58,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:51:58,302 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2018-04-11 15:51:58,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-04-11 15:51:58,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 15:51:58,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:51:58,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:51:58,364 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 44 [2018-04-11 15:51:58,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 12 treesize of output 11 [2018-04-11 15:51:58,366 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:51:58,371 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:51:58,376 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-11 15:51:58,376 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:63, output treesize:47 [2018-04-11 15:51:58,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 47 treesize of output 33 [2018-04-11 15:51:58,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, 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-11 15:51:58,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:51:58,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2018-04-11 15:51:58,412 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:51:58,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:51:58,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-04-11 15:51:58,427 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-11 15:51:58,427 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 15:51:58,432 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-11 15:51:58,432 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:51:58,434 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:51:58,437 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-11 15:51:58,438 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2018-04-11 15:51:58,448 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-11 15:51:58,449 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:51:58,449 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 15:51:58,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 15:51:58,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 15:51:58,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:51:58,449 INFO L87 Difference]: Start difference. First operand 204 states and 236 transitions. Second operand 8 states. [2018-04-11 15:51:58,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:51:58,821 INFO L93 Difference]: Finished difference Result 250 states and 291 transitions. [2018-04-11 15:51:58,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 15:51:58,855 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-04-11 15:51:58,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:51:58,855 INFO L225 Difference]: With dead ends: 250 [2018-04-11 15:51:58,855 INFO L226 Difference]: Without dead ends: 250 [2018-04-11 15:51:58,856 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-04-11 15:51:58,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-04-11 15:51:58,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 203. [2018-04-11 15:51:58,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-04-11 15:51:58,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 234 transitions. [2018-04-11 15:51:58,858 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 234 transitions. Word has length 29 [2018-04-11 15:51:58,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:51:58,858 INFO L459 AbstractCegarLoop]: Abstraction has 203 states and 234 transitions. [2018-04-11 15:51:58,858 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 15:51:58,858 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 234 transitions. [2018-04-11 15:51:58,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 15:51:58,858 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:51:58,858 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:51:58,859 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 15:51:58,859 INFO L82 PathProgramCache]: Analyzing trace with hash -13014505, now seen corresponding path program 1 times [2018-04-11 15:51:58,859 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:51:58,859 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:51:58,859 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:51:58,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:51:58,859 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:51:58,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:51:58,866 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:51:58,913 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-11 15:51:58,913 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:51:58,913 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:51:58,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:51:58,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:51:58,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:51:58,914 INFO L87 Difference]: Start difference. First operand 203 states and 234 transitions. Second operand 5 states. [2018-04-11 15:51:59,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:51:59,172 INFO L93 Difference]: Finished difference Result 284 states and 331 transitions. [2018-04-11 15:51:59,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:51:59,173 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-04-11 15:51:59,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:51:59,174 INFO L225 Difference]: With dead ends: 284 [2018-04-11 15:51:59,174 INFO L226 Difference]: Without dead ends: 284 [2018-04-11 15:51:59,174 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-11 15:51:59,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-04-11 15:51:59,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 202. [2018-04-11 15:51:59,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-04-11 15:51:59,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 232 transitions. [2018-04-11 15:51:59,177 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 232 transitions. Word has length 30 [2018-04-11 15:51:59,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:51:59,178 INFO L459 AbstractCegarLoop]: Abstraction has 202 states and 232 transitions. [2018-04-11 15:51:59,178 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:51:59,178 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 232 transitions. [2018-04-11 15:51:59,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 15:51:59,178 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:51:59,178 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:51:59,178 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 15:51:59,179 INFO L82 PathProgramCache]: Analyzing trace with hash -13014506, now seen corresponding path program 1 times [2018-04-11 15:51:59,179 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:51:59,179 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:51:59,180 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:51:59,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:51:59,180 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:51:59,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:51:59,188 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:51:59,225 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-11 15:51:59,225 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:51:59,225 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:51:59,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:51:59,226 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:51:59,226 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:51:59,226 INFO L87 Difference]: Start difference. First operand 202 states and 232 transitions. Second operand 5 states. [2018-04-11 15:51:59,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:51:59,423 INFO L93 Difference]: Finished difference Result 295 states and 341 transitions. [2018-04-11 15:51:59,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:51:59,423 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-04-11 15:51:59,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:51:59,424 INFO L225 Difference]: With dead ends: 295 [2018-04-11 15:51:59,424 INFO L226 Difference]: Without dead ends: 295 [2018-04-11 15:51:59,425 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-11 15:51:59,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-04-11 15:51:59,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 201. [2018-04-11 15:51:59,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-04-11 15:51:59,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 230 transitions. [2018-04-11 15:51:59,428 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 230 transitions. Word has length 30 [2018-04-11 15:51:59,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:51:59,428 INFO L459 AbstractCegarLoop]: Abstraction has 201 states and 230 transitions. [2018-04-11 15:51:59,428 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:51:59,428 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 230 transitions. [2018-04-11 15:51:59,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 15:51:59,429 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:51:59,429 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:51:59,429 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 15:51:59,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1014564753, now seen corresponding path program 1 times [2018-04-11 15:51:59,429 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:51:59,429 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:51:59,430 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:51:59,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:51:59,430 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:51:59,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:51:59,451 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:51:59,517 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-11 15:51:59,518 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:51:59,518 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 15:51:59,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 15:51:59,519 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 15:51:59,519 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-11 15:51:59,519 INFO L87 Difference]: Start difference. First operand 201 states and 230 transitions. Second operand 7 states. [2018-04-11 15:51:59,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:51:59,855 INFO L93 Difference]: Finished difference Result 263 states and 295 transitions. [2018-04-11 15:51:59,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 15:51:59,855 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-04-11 15:51:59,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:51:59,856 INFO L225 Difference]: With dead ends: 263 [2018-04-11 15:51:59,856 INFO L226 Difference]: Without dead ends: 263 [2018-04-11 15:51:59,857 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-04-11 15:51:59,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-04-11 15:51:59,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 199. [2018-04-11 15:51:59,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-04-11 15:51:59,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 228 transitions. [2018-04-11 15:51:59,860 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 228 transitions. Word has length 32 [2018-04-11 15:51:59,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:51:59,860 INFO L459 AbstractCegarLoop]: Abstraction has 199 states and 228 transitions. [2018-04-11 15:51:59,860 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 15:51:59,861 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 228 transitions. [2018-04-11 15:51:59,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 15:51:59,861 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:51:59,861 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:51:59,861 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 15:51:59,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1014564752, now seen corresponding path program 1 times [2018-04-11 15:51:59,861 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:51:59,862 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:51:59,862 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:51:59,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:51:59,862 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:51:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:51:59,869 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:51:59,884 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-11 15:51:59,885 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:51:59,885 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:51:59,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:51:59,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:51:59,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:51:59,885 INFO L87 Difference]: Start difference. First operand 199 states and 228 transitions. Second operand 4 states. [2018-04-11 15:51:59,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:51:59,992 INFO L93 Difference]: Finished difference Result 219 states and 249 transitions. [2018-04-11 15:51:59,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 15:51:59,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-04-11 15:51:59,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:51:59,993 INFO L225 Difference]: With dead ends: 219 [2018-04-11 15:51:59,994 INFO L226 Difference]: Without dead ends: 219 [2018-04-11 15:51:59,994 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-11 15:51:59,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-04-11 15:51:59,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 198. [2018-04-11 15:51:59,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-04-11 15:51:59,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 227 transitions. [2018-04-11 15:51:59,997 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 227 transitions. Word has length 32 [2018-04-11 15:51:59,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:51:59,997 INFO L459 AbstractCegarLoop]: Abstraction has 198 states and 227 transitions. [2018-04-11 15:51:59,997 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:51:59,998 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 227 transitions. [2018-04-11 15:51:59,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 15:51:59,998 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:51:59,998 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:51:59,998 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 15:51:59,998 INFO L82 PathProgramCache]: Analyzing trace with hash 362841017, now seen corresponding path program 1 times [2018-04-11 15:51:59,998 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:51:59,998 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:51:59,999 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:51:59,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:51:59,999 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:52:00,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:52:00,007 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:52:00,009 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:52:00,009 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:52:00,009 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:52:00,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:52:00,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:52:00,038 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:52:00,044 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:52:00,045 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:52:00,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-11 15:52:00,046 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:00,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:52:00,050 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-11 15:52:00,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 15:52:00,061 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-11 15:52:00,061 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:00,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:52:00,067 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-11 15:52:00,068 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-04-11 15:52:00,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-04-11 15:52:00,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 12 treesize of output 11 [2018-04-11 15:52:00,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:00,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:52:00,103 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-11 15:52:00,103 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-04-11 15:52:00,136 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-11 15:52:00,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-04-11 15:52:00,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:00,146 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:52:00,153 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-11 15:52:00,153 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:47 [2018-04-11 15:52:06,174 WARN L151 SmtUtils]: Spent 2009ms on a formula simplification. DAG size of input: 26 DAG size of output 22 [2018-04-11 15:52:06,178 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-11 15:52:06,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 15:52:06,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:06,184 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-11 15:52:06,184 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:06,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:52:06,191 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-11 15:52:06,191 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:43, output treesize:15 [2018-04-11 15:52:06,200 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-11 15:52:06,200 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:52:06,200 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-11 15:52:06,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 15:52:06,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 15:52:06,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=59, Unknown=2, NotChecked=0, Total=90 [2018-04-11 15:52:06,201 INFO L87 Difference]: Start difference. First operand 198 states and 227 transitions. Second operand 10 states. [2018-04-11 15:52:20,717 WARN L151 SmtUtils]: Spent 2015ms on a formula simplification. DAG size of input: 33 DAG size of output 29 [2018-04-11 15:52:27,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:52:27,281 INFO L93 Difference]: Finished difference Result 242 states and 278 transitions. [2018-04-11 15:52:27,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 15:52:27,283 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-04-11 15:52:27,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:52:27,283 INFO L225 Difference]: With dead ends: 242 [2018-04-11 15:52:27,283 INFO L226 Difference]: Without dead ends: 242 [2018-04-11 15:52:27,284 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 22.2s TimeCoverageRelationStatistics Valid=105, Invalid=228, Unknown=9, NotChecked=0, Total=342 [2018-04-11 15:52:27,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-04-11 15:52:27,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 197. [2018-04-11 15:52:27,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-04-11 15:52:27,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 225 transitions. [2018-04-11 15:52:27,287 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 225 transitions. Word has length 32 [2018-04-11 15:52:27,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:52:27,287 INFO L459 AbstractCegarLoop]: Abstraction has 197 states and 225 transitions. [2018-04-11 15:52:27,287 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 15:52:27,287 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 225 transitions. [2018-04-11 15:52:27,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 15:52:27,287 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:52:27,288 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:52:27,288 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 15:52:27,288 INFO L82 PathProgramCache]: Analyzing trace with hash 362841018, now seen corresponding path program 1 times [2018-04-11 15:52:27,288 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:52:27,288 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:52:27,289 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:52:27,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:52:27,289 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:52:27,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:52:27,298 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:52:27,303 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:52:27,303 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:52:27,303 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:52:27,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:52:27,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:52:27,331 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:52:27,340 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:52:27,341 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:52:27,341 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-11 15:52:27,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:27,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11 15:52:27,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:27,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:52:27,355 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-11 15:52:27,367 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-11 15:52:27,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 15:52:27,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:27,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:52:27,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:52:27,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11 15:52:27,383 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:27,385 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:52:27,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:52:27,389 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-04-11 15:52:27,410 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 9 treesize of output 1 [2018-04-11 15:52:27,410 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:27,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-04-11 15:52:27,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 15:52:27,427 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:27,434 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:52:27,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-04-11 15:52:27,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 15:52:27,449 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:27,453 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:52:27,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:52:27,461 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:72, output treesize:47 [2018-04-11 15:52:27,505 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 82 treesize of output 72 [2018-04-11 15:52:27,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-04-11 15:52:27,514 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:27,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:52:27,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-04-11 15:52:27,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-04-11 15:52:27,546 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:27,552 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:52:27,563 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-11 15:52:27,563 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:89, output treesize:73 [2018-04-11 15:52:31,595 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-11 15:52:31,597 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-11 15:52:31,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:31,603 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-11 15:52:31,603 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:31,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:52:31,612 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-11 15:52:31,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 15:52:31,615 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:31,618 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-11 15:52:31,619 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:31,619 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:52:31,622 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-11 15:52:31,622 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:65, output treesize:9 [2018-04-11 15:52:31,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:52:31,630 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:52:31,630 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-11 15:52:31,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 15:52:31,630 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 15:52:31,630 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=65, Unknown=2, NotChecked=0, Total=90 [2018-04-11 15:52:31,630 INFO L87 Difference]: Start difference. First operand 197 states and 225 transitions. Second operand 10 states. [2018-04-11 15:52:31,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:52:31,991 INFO L93 Difference]: Finished difference Result 241 states and 276 transitions. [2018-04-11 15:52:31,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 15:52:31,992 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-04-11 15:52:31,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:52:31,992 INFO L225 Difference]: With dead ends: 241 [2018-04-11 15:52:31,992 INFO L226 Difference]: Without dead ends: 241 [2018-04-11 15:52:31,993 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=91, Invalid=213, Unknown=2, NotChecked=0, Total=306 [2018-04-11 15:52:31,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-04-11 15:52:31,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 196. [2018-04-11 15:52:31,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-04-11 15:52:31,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 223 transitions. [2018-04-11 15:52:31,995 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 223 transitions. Word has length 32 [2018-04-11 15:52:31,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:52:31,996 INFO L459 AbstractCegarLoop]: Abstraction has 196 states and 223 transitions. [2018-04-11 15:52:31,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 15:52:31,996 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 223 transitions. [2018-04-11 15:52:31,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 15:52:31,996 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:52:31,996 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:52:31,996 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 15:52:31,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1386736404, now seen corresponding path program 1 times [2018-04-11 15:52:31,997 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:52:31,997 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:52:31,997 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:52:31,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:52:31,998 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:52:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:52:32,006 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:52:32,009 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:52:32,009 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:52:32,009 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:52:32,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:52:32,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:52:32,024 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:52:32,041 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:52:32,042 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:52:32,042 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-11 15:52:32,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:32,052 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-11 15:52:32,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:32,059 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-11 15:52:32,059 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-04-11 15:52:32,069 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-11 15:52:32,069 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:52:32,069 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:52:32,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:52:32,070 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:52:32,070 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:52:32,070 INFO L87 Difference]: Start difference. First operand 196 states and 223 transitions. Second operand 4 states. [2018-04-11 15:52:32,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:52:32,177 INFO L93 Difference]: Finished difference Result 214 states and 243 transitions. [2018-04-11 15:52:32,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 15:52:32,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-04-11 15:52:32,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:52:32,178 INFO L225 Difference]: With dead ends: 214 [2018-04-11 15:52:32,178 INFO L226 Difference]: Without dead ends: 214 [2018-04-11 15:52:32,178 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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-11 15:52:32,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-04-11 15:52:32,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 188. [2018-04-11 15:52:32,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-04-11 15:52:32,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 215 transitions. [2018-04-11 15:52:32,180 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 215 transitions. Word has length 33 [2018-04-11 15:52:32,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:52:32,181 INFO L459 AbstractCegarLoop]: Abstraction has 188 states and 215 transitions. [2018-04-11 15:52:32,181 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:52:32,181 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 215 transitions. [2018-04-11 15:52:32,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 15:52:32,181 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:52:32,181 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:52:32,181 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 15:52:32,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1167993264, now seen corresponding path program 1 times [2018-04-11 15:52:32,182 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:52:32,182 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:52:32,182 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:52:32,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:52:32,183 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:52:32,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:52:32,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:52:32,193 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:52:32,193 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:52:32,193 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:52:32,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:52:32,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:52:32,212 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:52:32,236 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:52:32,237 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:52:32,238 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-11 15:52:32,238 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:32,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:52:32,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-11 15:52:32,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 15:52:32,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 15:52:32,254 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:32,256 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:52:32,262 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-11 15:52:32,262 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-04-11 15:52:32,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-04-11 15:52:32,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 15:52:32,289 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:32,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:52:32,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:52:32,300 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:40 [2018-04-11 15:52:32,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 30 [2018-04-11 15:52:32,318 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-11 15:52:32,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:32,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2018-04-11 15:52:32,324 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:32,328 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:52:32,344 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-11 15:52:32,345 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:49, output treesize:15 [2018-04-11 15:52:32,353 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-11 15:52:32,353 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:52:32,353 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 15:52:32,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 15:52:32,353 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 15:52:32,354 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:52:32,354 INFO L87 Difference]: Start difference. First operand 188 states and 215 transitions. Second operand 8 states. [2018-04-11 15:52:32,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:52:32,555 INFO L93 Difference]: Finished difference Result 195 states and 223 transitions. [2018-04-11 15:52:32,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 15:52:32,555 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-04-11 15:52:32,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:52:32,556 INFO L225 Difference]: With dead ends: 195 [2018-04-11 15:52:32,556 INFO L226 Difference]: Without dead ends: 195 [2018-04-11 15:52:32,556 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-04-11 15:52:32,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-04-11 15:52:32,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 187. [2018-04-11 15:52:32,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-04-11 15:52:32,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 213 transitions. [2018-04-11 15:52:32,558 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 213 transitions. Word has length 33 [2018-04-11 15:52:32,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:52:32,558 INFO L459 AbstractCegarLoop]: Abstraction has 187 states and 213 transitions. [2018-04-11 15:52:32,558 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 15:52:32,558 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 213 transitions. [2018-04-11 15:52:32,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 15:52:32,559 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:52:32,559 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:52:32,559 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 15:52:32,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1167993263, now seen corresponding path program 1 times [2018-04-11 15:52:32,559 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:52:32,559 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:52:32,559 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:52:32,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:52:32,559 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:52:32,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:52:32,565 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:52:32,568 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:52:32,568 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:52:32,568 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:52:32,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:52:32,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:52:32,582 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:52:32,590 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:52:32,591 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:52:32,591 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-11 15:52:32,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:32,597 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-11 15:52:32,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:32,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:52:32,601 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-04-11 15:52:32,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 15:52:32,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 15:52:32,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:32,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:52:32,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 15:52:32,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 15:52:32,630 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:32,631 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:52:32,636 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-11 15:52:32,637 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:39, output treesize:34 [2018-04-11 15:52:32,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-04-11 15:52:32,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:32,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 62 [2018-04-11 15:52:32,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 15:52:32,673 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:32,678 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:52:32,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2018-04-11 15:52:32,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 15:52:32,692 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:32,697 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:52:32,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:52:32,705 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:100, output treesize:69 [2018-04-11 15:52:32,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 41 [2018-04-11 15:52:32,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 17 [2018-04-11 15:52:32,724 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:32,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, 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-11 15:52:32,729 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:32,733 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:52:32,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2018-04-11 15:52:32,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2018-04-11 15:52:32,744 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:32,749 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-11 15:52:32,749 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:32,751 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:52:32,756 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-11 15:52:32,757 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:87, output treesize:9 [2018-04-11 15:52:32,764 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-11 15:52:32,764 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:52:32,765 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 15:52:32,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 15:52:32,765 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 15:52:32,765 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:52:32,765 INFO L87 Difference]: Start difference. First operand 187 states and 213 transitions. Second operand 8 states. [2018-04-11 15:52:33,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:52:33,030 INFO L93 Difference]: Finished difference Result 194 states and 221 transitions. [2018-04-11 15:52:33,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 15:52:33,031 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-04-11 15:52:33,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:52:33,031 INFO L225 Difference]: With dead ends: 194 [2018-04-11 15:52:33,031 INFO L226 Difference]: Without dead ends: 194 [2018-04-11 15:52:33,032 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-04-11 15:52:33,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-04-11 15:52:33,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 186. [2018-04-11 15:52:33,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-04-11 15:52:33,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 211 transitions. [2018-04-11 15:52:33,033 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 211 transitions. Word has length 33 [2018-04-11 15:52:33,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:52:33,034 INFO L459 AbstractCegarLoop]: Abstraction has 186 states and 211 transitions. [2018-04-11 15:52:33,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 15:52:33,034 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 211 transitions. [2018-04-11 15:52:33,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 15:52:33,034 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:52:33,034 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:52:33,034 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 15:52:33,034 INFO L82 PathProgramCache]: Analyzing trace with hash 454401458, now seen corresponding path program 1 times [2018-04-11 15:52:33,034 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:52:33,034 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:52:33,035 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:52:33,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:52:33,035 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:52:33,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:52:33,040 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:52:33,052 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-11 15:52:33,052 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:52:33,053 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:52:33,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:52:33,053 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:52:33,053 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:52:33,053 INFO L87 Difference]: Start difference. First operand 186 states and 211 transitions. Second operand 4 states. [2018-04-11 15:52:33,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:52:33,147 INFO L93 Difference]: Finished difference Result 198 states and 224 transitions. [2018-04-11 15:52:33,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 15:52:33,147 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-04-11 15:52:33,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:52:33,148 INFO L225 Difference]: With dead ends: 198 [2018-04-11 15:52:33,148 INFO L226 Difference]: Without dead ends: 198 [2018-04-11 15:52:33,148 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-11 15:52:33,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-04-11 15:52:33,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 185. [2018-04-11 15:52:33,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-04-11 15:52:33,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 210 transitions. [2018-04-11 15:52:33,151 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 210 transitions. Word has length 34 [2018-04-11 15:52:33,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:52:33,151 INFO L459 AbstractCegarLoop]: Abstraction has 185 states and 210 transitions. [2018-04-11 15:52:33,151 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:52:33,151 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 210 transitions. [2018-04-11 15:52:33,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 15:52:33,151 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:52:33,152 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:52:33,152 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 15:52:33,152 INFO L82 PathProgramCache]: Analyzing trace with hash 454401459, now seen corresponding path program 1 times [2018-04-11 15:52:33,152 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:52:33,152 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:52:33,153 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:52:33,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:52:33,153 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:52:33,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:52:33,164 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:52:33,215 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-11 15:52:33,215 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:52:33,215 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 15:52:33,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 15:52:33,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 15:52:33,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-11 15:52:33,216 INFO L87 Difference]: Start difference. First operand 185 states and 210 transitions. Second operand 7 states. [2018-04-11 15:52:33,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:52:33,407 INFO L93 Difference]: Finished difference Result 238 states and 265 transitions. [2018-04-11 15:52:33,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 15:52:33,407 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-04-11 15:52:33,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:52:33,407 INFO L225 Difference]: With dead ends: 238 [2018-04-11 15:52:33,408 INFO L226 Difference]: Without dead ends: 238 [2018-04-11 15:52:33,408 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-04-11 15:52:33,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-04-11 15:52:33,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 183. [2018-04-11 15:52:33,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-04-11 15:52:33,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 208 transitions. [2018-04-11 15:52:33,410 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 208 transitions. Word has length 34 [2018-04-11 15:52:33,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:52:33,410 INFO L459 AbstractCegarLoop]: Abstraction has 183 states and 208 transitions. [2018-04-11 15:52:33,410 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 15:52:33,410 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 208 transitions. [2018-04-11 15:52:33,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-11 15:52:33,410 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:52:33,410 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:52:33,410 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 15:52:33,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1201543495, now seen corresponding path program 1 times [2018-04-11 15:52:33,410 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:52:33,410 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:52:33,411 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:52:33,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:52:33,411 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:52:33,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:52:33,418 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:52:33,421 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:52:33,421 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:52:33,422 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:52:33,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:52:33,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:52:33,435 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:52:33,459 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:52:33,460 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:52:33,460 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-11 15:52:33,461 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:33,466 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-11 15:52:33,466 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:33,469 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-11 15:52:33,470 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-04-11 15:52:33,476 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-11 15:52:33,476 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:52:33,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:52:33,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:52:33,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:52:33,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:52:33,477 INFO L87 Difference]: Start difference. First operand 183 states and 208 transitions. Second operand 5 states. [2018-04-11 15:52:33,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:52:33,594 INFO L93 Difference]: Finished difference Result 236 states and 268 transitions. [2018-04-11 15:52:33,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:52:33,594 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-04-11 15:52:33,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:52:33,595 INFO L225 Difference]: With dead ends: 236 [2018-04-11 15:52:33,595 INFO L226 Difference]: Without dead ends: 236 [2018-04-11 15:52:33,595 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 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-11 15:52:33,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-04-11 15:52:33,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 161. [2018-04-11 15:52:33,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-04-11 15:52:33,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 182 transitions. [2018-04-11 15:52:33,597 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 182 transitions. Word has length 35 [2018-04-11 15:52:33,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:52:33,597 INFO L459 AbstractCegarLoop]: Abstraction has 161 states and 182 transitions. [2018-04-11 15:52:33,597 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:52:33,598 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 182 transitions. [2018-04-11 15:52:33,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 15:52:33,598 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:52:33,598 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:52:33,598 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 15:52:33,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1026073512, now seen corresponding path program 1 times [2018-04-11 15:52:33,599 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:52:33,599 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:52:33,599 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:52:33,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:52:33,599 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:52:33,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:52:33,609 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:52:33,613 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:52:33,613 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:52:33,613 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:52:33,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:52:33,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:52:33,637 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:52:33,666 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:52:33,668 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:52:33,668 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 23 [2018-04-11 15:52:33,669 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:33,680 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:52:33,681 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:52:33,681 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-11 15:52:33,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:33,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:52:33,685 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:19 [2018-04-11 15:52:33,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11 15:52:33,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 15:52:33,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:33,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:52:33,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11 15:52:33,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 8 treesize of output 7 [2018-04-11 15:52:33,708 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:33,709 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:52:33,712 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-11 15:52:33,713 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:22 [2018-04-11 15:52:33,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-11 15:52:33,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 16 [2018-04-11 15:52:33,733 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-11 15:52:33,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 15:52:33,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-11 15:52:33,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 14 [2018-04-11 15:52:33,749 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 15:52:33,751 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:52:33,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-04-11 15:52:33,758 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:69 [2018-04-11 15:52:33,834 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:52:33,835 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:52:33,835 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:52:33,836 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 30 [2018-04-11 15:52:33,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:33,850 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:52:33,850 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:52:33,851 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-11 15:52:33,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:33,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 15:52:33,858 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:32 [2018-04-11 15:52:33,879 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:52:33,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:52:33,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:33,884 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-11 15:52:33,884 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:17 [2018-04-11 15:52:33,898 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-11 15:52:33,899 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:52:33,899 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-04-11 15:52:33,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 15:52:33,899 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 15:52:33,899 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-04-11 15:52:33,899 INFO L87 Difference]: Start difference. First operand 161 states and 182 transitions. Second operand 16 states. [2018-04-11 15:52:34,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:52:34,619 INFO L93 Difference]: Finished difference Result 229 states and 253 transitions. [2018-04-11 15:52:34,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 15:52:34,619 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 36 [2018-04-11 15:52:34,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:52:34,620 INFO L225 Difference]: With dead ends: 229 [2018-04-11 15:52:34,620 INFO L226 Difference]: Without dead ends: 229 [2018-04-11 15:52:34,621 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=256, Invalid=800, Unknown=0, NotChecked=0, Total=1056 [2018-04-11 15:52:34,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-04-11 15:52:34,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 173. [2018-04-11 15:52:34,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-04-11 15:52:34,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 194 transitions. [2018-04-11 15:52:34,624 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 194 transitions. Word has length 36 [2018-04-11 15:52:34,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:52:34,624 INFO L459 AbstractCegarLoop]: Abstraction has 173 states and 194 transitions. [2018-04-11 15:52:34,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 15:52:34,624 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 194 transitions. [2018-04-11 15:52:34,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 15:52:34,625 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:52:34,625 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:52:34,625 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 15:52:34,625 INFO L82 PathProgramCache]: Analyzing trace with hash 2137809661, now seen corresponding path program 1 times [2018-04-11 15:52:34,625 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:52:34,625 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:52:34,626 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:52:34,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:52:34,626 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:52:34,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:52:34,632 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:52:34,635 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:52:34,635 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:52:34,635 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:52:34,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:52:34,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:52:34,651 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:52:34,659 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:52:34,660 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:52:34,661 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-11 15:52:34,661 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:34,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:52:34,664 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-11 15:52:34,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 15:52:34,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 15:52:34,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:34,673 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:52:34,677 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-11 15:52:34,677 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-04-11 15:52:34,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-04-11 15:52:34,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 15:52:34,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:34,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:52:34,712 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-11 15:52:34,712 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:40 [2018-04-11 15:52:34,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 46 [2018-04-11 15:52:34,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-11 15:52:34,737 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:34,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:52:34,745 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-11 15:52:34,745 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:55 [2018-04-11 15:52:38,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 32 [2018-04-11 15:52:38,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 15:52:38,773 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:38,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2018-04-11 15:52:38,777 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:38,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:52:38,782 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-11 15:52:38,782 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:51, output treesize:15 [2018-04-11 15:52:38,790 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-11 15:52:38,790 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:52:38,790 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-11 15:52:38,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 15:52:38,790 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 15:52:38,790 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=59, Unknown=2, NotChecked=0, Total=90 [2018-04-11 15:52:38,791 INFO L87 Difference]: Start difference. First operand 173 states and 194 transitions. Second operand 10 states. [2018-04-11 15:52:57,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:52:57,334 INFO L93 Difference]: Finished difference Result 180 states and 203 transitions. [2018-04-11 15:52:57,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 15:52:57,334 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2018-04-11 15:52:57,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:52:57,334 INFO L225 Difference]: With dead ends: 180 [2018-04-11 15:52:57,334 INFO L226 Difference]: Without dead ends: 180 [2018-04-11 15:52:57,335 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=105, Invalid=228, Unknown=9, NotChecked=0, Total=342 [2018-04-11 15:52:57,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-04-11 15:52:57,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 172. [2018-04-11 15:52:57,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-04-11 15:52:57,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 193 transitions. [2018-04-11 15:52:57,336 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 193 transitions. Word has length 36 [2018-04-11 15:52:57,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:52:57,336 INFO L459 AbstractCegarLoop]: Abstraction has 172 states and 193 transitions. [2018-04-11 15:52:57,336 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 15:52:57,337 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 193 transitions. [2018-04-11 15:52:57,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 15:52:57,337 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:52:57,337 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:52:57,337 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 15:52:57,337 INFO L82 PathProgramCache]: Analyzing trace with hash 2137809662, now seen corresponding path program 1 times [2018-04-11 15:52:57,337 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:52:57,337 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:52:57,338 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:52:57,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:52:57,338 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:52:57,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:52:57,342 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:52:57,344 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:52:57,345 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:52:57,345 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:52:57,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:52:57,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:52:57,363 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:52:57,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:52:57,367 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:57,374 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:52:57,375 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:52:57,375 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-11 15:52:57,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:57,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:52:57,380 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-04-11 15:52:57,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:52:57,389 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:57,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 15:52:57,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 15:52:57,398 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:57,399 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:52:57,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 15:52:57,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 15:52:57,407 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:57,408 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:52:57,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:52:57,413 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:46, output treesize:31 [2018-04-11 15:52:57,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 62 [2018-04-11 15:52:57,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 15:52:57,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:57,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:52:57,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-04-11 15:52:57,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 15:52:57,465 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:57,469 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:52:57,475 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-11 15:52:57,475 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:77, output treesize:57 [2018-04-11 15:52:57,516 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 98 treesize of output 84 [2018-04-11 15:52:57,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-11 15:52:57,519 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:57,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:52:57,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2018-04-11 15:52:57,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-11 15:52:57,545 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:52:57,549 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:52:57,555 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-11 15:52:57,556 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:107, output treesize:87 [2018-04-11 15:53:01,588 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 61 treesize of output 45 [2018-04-11 15:53:01,590 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-11 15:53:01,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:01,596 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 38 treesize of output 19 [2018-04-11 15:53:01,596 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:01,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:01,613 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 28 treesize of output 26 [2018-04-11 15:53:01,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 15:53:01,615 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:01,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-11 15:53:01,623 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:01,624 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:01,627 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-11 15:53:01,627 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:79, output treesize:9 [2018-04-11 15:53:01,635 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-11 15:53:01,635 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:53:01,635 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-11 15:53:01,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 15:53:01,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 15:53:01,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=64, Unknown=2, NotChecked=0, Total=90 [2018-04-11 15:53:01,636 INFO L87 Difference]: Start difference. First operand 172 states and 193 transitions. Second operand 10 states. [2018-04-11 15:53:02,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:53:02,009 INFO L93 Difference]: Finished difference Result 179 states and 202 transitions. [2018-04-11 15:53:02,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 15:53:02,011 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2018-04-11 15:53:02,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:53:02,012 INFO L225 Difference]: With dead ends: 179 [2018-04-11 15:53:02,012 INFO L226 Difference]: Without dead ends: 179 [2018-04-11 15:53:02,012 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=81, Invalid=189, Unknown=2, NotChecked=0, Total=272 [2018-04-11 15:53:02,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-04-11 15:53:02,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 171. [2018-04-11 15:53:02,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-04-11 15:53:02,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 192 transitions. [2018-04-11 15:53:02,014 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 192 transitions. Word has length 36 [2018-04-11 15:53:02,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:53:02,015 INFO L459 AbstractCegarLoop]: Abstraction has 171 states and 192 transitions. [2018-04-11 15:53:02,015 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 15:53:02,015 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 192 transitions. [2018-04-11 15:53:02,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-11 15:53:02,015 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:53:02,015 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:53:02,015 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 15:53:02,016 INFO L82 PathProgramCache]: Analyzing trace with hash -648528079, now seen corresponding path program 1 times [2018-04-11 15:53:02,016 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:53:02,016 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:53:02,016 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:53:02,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:53:02,017 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:53:02,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:53:02,023 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:53:02,025 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:53:02,025 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:53:02,025 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:53:02,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:53:02,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:53:02,058 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:53:02,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11 15:53:02,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 15:53:02,141 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:02,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:02,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:53:02,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:53:02,147 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:02,153 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:02,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:02,156 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-04-11 15:53:02,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 15:53:02,173 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:02,199 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-11 15:53:02,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:02,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:02,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 15:53:02,216 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:02,218 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-11 15:53:02,218 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:02,222 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:02,228 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-11 15:53:02,229 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2018-04-11 15:53:02,231 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-11 15:53:02,232 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-11 15:53:02,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:02,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:02,239 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-11 15:53:02,240 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-11 15:53:02,241 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:02,242 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:02,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:02,244 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-04-11 15:53:02,256 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:53:02,256 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:53:02,256 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-04-11 15:53:02,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:53:02,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:53:02,257 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:53:02,257 INFO L87 Difference]: Start difference. First operand 171 states and 192 transitions. Second operand 5 states. [2018-04-11 15:53:02,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:53:02,324 INFO L93 Difference]: Finished difference Result 184 states and 206 transitions. [2018-04-11 15:53:02,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 15:53:02,325 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-04-11 15:53:02,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:53:02,325 INFO L225 Difference]: With dead ends: 184 [2018-04-11 15:53:02,326 INFO L226 Difference]: Without dead ends: 184 [2018-04-11 15:53:02,326 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:53:02,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-04-11 15:53:02,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 178. [2018-04-11 15:53:02,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-04-11 15:53:02,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 200 transitions. [2018-04-11 15:53:02,328 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 200 transitions. Word has length 37 [2018-04-11 15:53:02,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:53:02,329 INFO L459 AbstractCegarLoop]: Abstraction has 178 states and 200 transitions. [2018-04-11 15:53:02,329 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:53:02,329 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 200 transitions. [2018-04-11 15:53:02,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 15:53:02,329 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:53:02,329 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:53:02,329 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 15:53:02,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1370466265, now seen corresponding path program 1 times [2018-04-11 15:53:02,330 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:53:02,330 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:53:02,330 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:53:02,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:53:02,330 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:53:02,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:53:02,337 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:53:02,339 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:53:02,340 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:53:02,340 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:53:02,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:53:02,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:53:02,355 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:53:02,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11 15:53:02,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:53:02,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:02,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:02,422 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-11 15:53:02,422 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:35 [2018-04-11 15:53:02,454 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 44 treesize of output 36 [2018-04-11 15:53:02,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 33 [2018-04-11 15:53:02,462 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-11 15:53:02,476 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 15:53:02,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 15:53:02,490 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:53 [2018-04-11 15:53:02,567 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~st~0.base Int) (main_~n~0.base Int)) (let ((.cse0 (store |c_old(#valid)| main_~n~0.base 1))) (and (= (store (store .cse0 main_~st~0.base 0) main_~n~0.base 0) |c_#valid|) (= (select |c_old(#valid)| main_~n~0.base) 0) (= 0 (select .cse0 main_~st~0.base))))) is different from true [2018-04-11 15:53:02,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-04-11 15:53:02,575 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:53:02,575 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-11 15:53:02,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 15:53:02,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 15:53:02,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=155, Unknown=2, NotChecked=24, Total=210 [2018-04-11 15:53:02,576 INFO L87 Difference]: Start difference. First operand 178 states and 200 transitions. Second operand 15 states. [2018-04-11 15:53:03,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:53:03,283 INFO L93 Difference]: Finished difference Result 207 states and 230 transitions. [2018-04-11 15:53:03,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 15:53:03,283 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 38 [2018-04-11 15:53:03,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:53:03,284 INFO L225 Difference]: With dead ends: 207 [2018-04-11 15:53:03,284 INFO L226 Difference]: Without dead ends: 200 [2018-04-11 15:53:03,284 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=426, Unknown=4, NotChecked=42, Total=552 [2018-04-11 15:53:03,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-04-11 15:53:03,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 196. [2018-04-11 15:53:03,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-04-11 15:53:03,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 219 transitions. [2018-04-11 15:53:03,285 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 219 transitions. Word has length 38 [2018-04-11 15:53:03,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:53:03,285 INFO L459 AbstractCegarLoop]: Abstraction has 196 states and 219 transitions. [2018-04-11 15:53:03,286 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 15:53:03,286 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 219 transitions. [2018-04-11 15:53:03,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 15:53:03,286 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:53:03,286 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] [2018-04-11 15:53:03,286 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 15:53:03,286 INFO L82 PathProgramCache]: Analyzing trace with hash 2138852874, now seen corresponding path program 1 times [2018-04-11 15:53:03,286 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:53:03,286 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:53:03,287 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:53:03,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:53:03,287 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:53:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:53:03,292 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:53:03,295 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:53:03,295 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:53:03,295 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:53:03,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:53:03,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:53:03,306 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:53:03,323 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:03,324 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:03,325 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:03,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-04-11 15:53:03,345 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:03,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:03,351 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-11 15:53:03,375 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:03,376 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:03,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-04-11 15:53:03,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:03,382 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-11 15:53:03,382 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2018-04-11 15:53:03,392 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:53:03,392 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:53:03,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 15:53:03,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 15:53:03,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 15:53:03,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-04-11 15:53:03,393 INFO L87 Difference]: Start difference. First operand 196 states and 219 transitions. Second operand 7 states. [2018-04-11 15:53:03,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:53:03,569 INFO L93 Difference]: Finished difference Result 213 states and 237 transitions. [2018-04-11 15:53:03,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 15:53:03,569 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-04-11 15:53:03,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:53:03,569 INFO L225 Difference]: With dead ends: 213 [2018-04-11 15:53:03,569 INFO L226 Difference]: Without dead ends: 213 [2018-04-11 15:53:03,570 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-04-11 15:53:03,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-04-11 15:53:03,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 203. [2018-04-11 15:53:03,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-04-11 15:53:03,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 229 transitions. [2018-04-11 15:53:03,571 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 229 transitions. Word has length 43 [2018-04-11 15:53:03,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:53:03,571 INFO L459 AbstractCegarLoop]: Abstraction has 203 states and 229 transitions. [2018-04-11 15:53:03,571 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 15:53:03,571 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 229 transitions. [2018-04-11 15:53:03,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 15:53:03,572 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:53:03,572 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] [2018-04-11 15:53:03,572 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 15:53:03,572 INFO L82 PathProgramCache]: Analyzing trace with hash 2138852875, now seen corresponding path program 1 times [2018-04-11 15:53:03,572 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:53:03,572 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:53:03,572 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:53:03,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:53:03,572 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:53:03,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:53:03,576 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:53:03,640 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-11 15:53:03,640 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:53:03,641 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:53:03,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:53:03,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:53:03,657 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:53:03,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 6 treesize of output 5 [2018-04-11 15:53:03,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:03,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:03,664 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:53:03,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:53:03,702 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:53:03,702 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2018-04-11 15:53:03,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 15:53:03,703 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 15:53:03,703 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-04-11 15:53:03,703 INFO L87 Difference]: Start difference. First operand 203 states and 229 transitions. Second operand 12 states. [2018-04-11 15:53:03,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:53:03,966 INFO L93 Difference]: Finished difference Result 274 states and 300 transitions. [2018-04-11 15:53:03,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 15:53:03,967 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 43 [2018-04-11 15:53:03,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:53:03,967 INFO L225 Difference]: With dead ends: 274 [2018-04-11 15:53:03,967 INFO L226 Difference]: Without dead ends: 274 [2018-04-11 15:53:03,967 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2018-04-11 15:53:03,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-04-11 15:53:03,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 207. [2018-04-11 15:53:03,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-04-11 15:53:03,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 233 transitions. [2018-04-11 15:53:03,970 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 233 transitions. Word has length 43 [2018-04-11 15:53:03,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:53:03,970 INFO L459 AbstractCegarLoop]: Abstraction has 207 states and 233 transitions. [2018-04-11 15:53:03,970 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 15:53:03,970 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 233 transitions. [2018-04-11 15:53:03,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 15:53:03,970 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:53:03,970 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] [2018-04-11 15:53:03,970 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 15:53:03,971 INFO L82 PathProgramCache]: Analyzing trace with hash -342823382, now seen corresponding path program 1 times [2018-04-11 15:53:03,971 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:53:03,971 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:53:03,971 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:53:03,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:53:03,971 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:53:03,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:53:03,975 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:53:03,977 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:53:03,977 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:53:03,977 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:53:03,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:53:03,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:53:03,994 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:53:04,000 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:04,001 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:04,001 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-11 15:53:04,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:04,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:04,006 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-11 15:53:04,025 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:04,025 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-11 15:53:04,026 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:04,028 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-11 15:53:04,028 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2018-04-11 15:53:04,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:53:04,034 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:53:04,034 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 15:53:04,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 15:53:04,035 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 15:53:04,035 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-04-11 15:53:04,035 INFO L87 Difference]: Start difference. First operand 207 states and 233 transitions. Second operand 7 states. [2018-04-11 15:53:04,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:53:04,197 INFO L93 Difference]: Finished difference Result 243 states and 271 transitions. [2018-04-11 15:53:04,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 15:53:04,197 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-04-11 15:53:04,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:53:04,198 INFO L225 Difference]: With dead ends: 243 [2018-04-11 15:53:04,198 INFO L226 Difference]: Without dead ends: 243 [2018-04-11 15:53:04,198 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-04-11 15:53:04,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-04-11 15:53:04,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 215. [2018-04-11 15:53:04,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-04-11 15:53:04,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 246 transitions. [2018-04-11 15:53:04,199 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 246 transitions. Word has length 43 [2018-04-11 15:53:04,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:53:04,199 INFO L459 AbstractCegarLoop]: Abstraction has 215 states and 246 transitions. [2018-04-11 15:53:04,200 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 15:53:04,200 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 246 transitions. [2018-04-11 15:53:04,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 15:53:04,200 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:53:04,200 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] [2018-04-11 15:53:04,200 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 15:53:04,200 INFO L82 PathProgramCache]: Analyzing trace with hash -342823381, now seen corresponding path program 1 times [2018-04-11 15:53:04,200 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:53:04,200 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:53:04,201 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:53:04,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:53:04,201 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:53:04,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:53:04,204 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:53:04,258 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-11 15:53:04,258 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:53:04,258 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:53:04,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:53:04,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:53:04,272 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:53:04,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:53:04,274 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:04,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:04,277 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:53:04,326 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:53:04,327 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:53:04,327 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2018-04-11 15:53:04,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 15:53:04,327 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 15:53:04,327 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-04-11 15:53:04,328 INFO L87 Difference]: Start difference. First operand 215 states and 246 transitions. Second operand 12 states. [2018-04-11 15:53:04,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:53:04,623 INFO L93 Difference]: Finished difference Result 308 states and 341 transitions. [2018-04-11 15:53:04,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 15:53:04,623 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 43 [2018-04-11 15:53:04,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:53:04,624 INFO L225 Difference]: With dead ends: 308 [2018-04-11 15:53:04,624 INFO L226 Difference]: Without dead ends: 308 [2018-04-11 15:53:04,624 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2018-04-11 15:53:04,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-04-11 15:53:04,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 208. [2018-04-11 15:53:04,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-04-11 15:53:04,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 236 transitions. [2018-04-11 15:53:04,626 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 236 transitions. Word has length 43 [2018-04-11 15:53:04,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:53:04,626 INFO L459 AbstractCegarLoop]: Abstraction has 208 states and 236 transitions. [2018-04-11 15:53:04,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 15:53:04,626 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 236 transitions. [2018-04-11 15:53:04,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-11 15:53:04,627 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:53:04,627 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:53:04,627 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 15:53:04,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1879929888, now seen corresponding path program 1 times [2018-04-11 15:53:04,627 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:53:04,627 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:53:04,627 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:53:04,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:53:04,628 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:53:04,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:53:04,632 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:53:04,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:53:04,645 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:53:04,645 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 15:53:04,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:53:04,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:53:04,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:53:04,645 INFO L87 Difference]: Start difference. First operand 208 states and 236 transitions. Second operand 5 states. [2018-04-11 15:53:04,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:53:04,680 INFO L93 Difference]: Finished difference Result 290 states and 327 transitions. [2018-04-11 15:53:04,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 15:53:04,680 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-04-11 15:53:04,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:53:04,680 INFO L225 Difference]: With dead ends: 290 [2018-04-11 15:53:04,680 INFO L226 Difference]: Without dead ends: 290 [2018-04-11 15:53:04,681 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-11 15:53:04,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-04-11 15:53:04,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 214. [2018-04-11 15:53:04,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-04-11 15:53:04,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 243 transitions. [2018-04-11 15:53:04,682 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 243 transitions. Word has length 44 [2018-04-11 15:53:04,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:53:04,682 INFO L459 AbstractCegarLoop]: Abstraction has 214 states and 243 transitions. [2018-04-11 15:53:04,682 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:53:04,683 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 243 transitions. [2018-04-11 15:53:04,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-11 15:53:04,683 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:53:04,683 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:53:04,683 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 15:53:04,683 INFO L82 PathProgramCache]: Analyzing trace with hash -2037590016, now seen corresponding path program 1 times [2018-04-11 15:53:04,683 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:53:04,683 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:53:04,684 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:53:04,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:53:04,684 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:53:04,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:53:04,687 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:53:04,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:53:04,711 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:53:04,711 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 15:53:04,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:53:04,712 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:53:04,712 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:53:04,712 INFO L87 Difference]: Start difference. First operand 214 states and 243 transitions. Second operand 5 states. [2018-04-11 15:53:04,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:53:04,776 INFO L93 Difference]: Finished difference Result 302 states and 334 transitions. [2018-04-11 15:53:04,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:53:04,776 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-04-11 15:53:04,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:53:04,777 INFO L225 Difference]: With dead ends: 302 [2018-04-11 15:53:04,777 INFO L226 Difference]: Without dead ends: 302 [2018-04-11 15:53:04,777 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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-11 15:53:04,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-04-11 15:53:04,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 208. [2018-04-11 15:53:04,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-04-11 15:53:04,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 235 transitions. [2018-04-11 15:53:04,780 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 235 transitions. Word has length 44 [2018-04-11 15:53:04,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:53:04,780 INFO L459 AbstractCegarLoop]: Abstraction has 208 states and 235 transitions. [2018-04-11 15:53:04,780 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:53:04,780 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 235 transitions. [2018-04-11 15:53:04,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-11 15:53:04,781 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:53:04,781 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:53:04,781 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 15:53:04,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1851718325, now seen corresponding path program 1 times [2018-04-11 15:53:04,781 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:53:04,781 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:53:04,782 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:53:04,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:53:04,782 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:53:04,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:53:04,788 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:53:04,802 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 15:53:04,802 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:53:04,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:53:04,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:53:04,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:53:04,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:53:04,803 INFO L87 Difference]: Start difference. First operand 208 states and 235 transitions. Second operand 4 states. [2018-04-11 15:53:04,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:53:04,875 INFO L93 Difference]: Finished difference Result 213 states and 237 transitions. [2018-04-11 15:53:04,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 15:53:04,875 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-04-11 15:53:04,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:53:04,876 INFO L225 Difference]: With dead ends: 213 [2018-04-11 15:53:04,876 INFO L226 Difference]: Without dead ends: 213 [2018-04-11 15:53:04,876 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:53:04,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-04-11 15:53:04,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 207. [2018-04-11 15:53:04,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-04-11 15:53:04,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 233 transitions. [2018-04-11 15:53:04,879 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 233 transitions. Word has length 45 [2018-04-11 15:53:04,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:53:04,879 INFO L459 AbstractCegarLoop]: Abstraction has 207 states and 233 transitions. [2018-04-11 15:53:04,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:53:04,879 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 233 transitions. [2018-04-11 15:53:04,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 15:53:04,880 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:53:04,880 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-11 15:53:04,880 INFO L408 AbstractCegarLoop]: === Iteration 42 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 15:53:04,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1535411722, now seen corresponding path program 1 times [2018-04-11 15:53:04,880 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:53:04,880 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:53:04,881 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:53:04,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:53:04,881 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:53:04,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:53:04,890 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:53:04,894 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:53:04,894 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:53:04,894 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:53:04,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:53:04,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:53:04,921 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:53:04,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 15:53:04,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 15:53:04,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:04,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:04,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 15:53:04,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 15:53:04,950 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:04,951 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:04,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:04,958 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2018-04-11 15:53:04,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-04-11 15:53:04,974 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:04,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-11 15:53:04,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:04,980 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:04,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-04-11 15:53:04,996 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:04,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-11 15:53:04,997 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:05,008 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:05,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:05,018 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:56, output treesize:48 [2018-04-11 15:53:05,037 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:05,037 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:05,038 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-11 15:53:05,038 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:05,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:05,050 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:50 [2018-04-11 15:53:05,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-04-11 15:53:05,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:53:05,096 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:05,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:05,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-04-11 15:53:05,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 15:53:05,127 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:05,133 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:05,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:05,150 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:72, output treesize:64 [2018-04-11 15:53:05,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-04-11 15:53: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, 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 15 [2018-04-11 15:53:05,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:05,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:05,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 44 [2018-04-11 15:53:05,221 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:53:05,222 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 22 [2018-04-11 15:53:05,222 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:05,228 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:05,240 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-11 15:53:05,240 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:83, output treesize:113 [2018-04-11 15:53:05,424 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:05,425 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:05,425 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 143 treesize of output 137 [2018-04-11 15:53:05,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:05,456 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:05,457 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:05,457 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 143 treesize of output 137 [2018-04-11 15:53:05,458 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:05,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 15:53:05,488 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:287, output treesize:275 [2018-04-11 15:53:05,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 159 treesize of output 161 [2018-04-11 15:53:05,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 159 [2018-04-11 15:53:05,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:05,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 137 treesize of output 142 [2018-04-11 15:53:05,710 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-04-11 15:53:05,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 15:53:05,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 147 treesize of output 151 [2018-04-11 15:53:05,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 155 [2018-04-11 15:53:05,902 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:05,978 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:05,988 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 125 treesize of output 135 [2018-04-11 15:53:05,990 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-04-11 15:53:06,077 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-04-11 15:53:06,083 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 130 treesize of output 109 [2018-04-11 15:53:06,085 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:06,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 67 [2018-04-11 15:53:06,089 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-11 15:53:06,127 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:53:06,135 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 130 treesize of output 117 [2018-04-11 15:53:06,138 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:06,139 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:53:06,141 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 80 treesize of output 97 [2018-04-11 15:53:06,142 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:06,169 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:06,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 159 treesize of output 167 [2018-04-11 15:53:06,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 171 [2018-04-11 15:53:06,392 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:06,493 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:06,508 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 141 treesize of output 151 [2018-04-11 15:53:06,510 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-04-11 15:53:06,605 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-04-11 15:53:06,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 150 treesize of output 127 [2018-04-11 15:53:06,791 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:06,792 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:53:06,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 89 [2018-04-11 15:53:06,794 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:06,811 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:06,816 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 129 treesize of output 106 [2018-04-11 15:53:06,822 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 59 treesize of output 50 [2018-04-11 15:53:06,822 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:06,837 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:06,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 163 treesize of output 155 [2018-04-11 15:53:06,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 155 [2018-04-11 15:53:06,854 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:06,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 135 treesize of output 138 [2018-04-11 15:53:06,953 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 4 xjuncts. [2018-04-11 15:53:07,032 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 15:53:07,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-2 vars, End of recursive call: 5 dim-0 vars, and 8 xjuncts. [2018-04-11 15:53:07,226 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 10 variables, input treesize:319, output treesize:835 [2018-04-11 15:53:07,472 WARN L151 SmtUtils]: Spent 188ms on a formula simplification. DAG size of input: 175 DAG size of output 150 [2018-04-11 15:53:07,661 WARN L148 SmtUtils]: Spent 120ms on a formula simplification that was a NOOP. DAG size: 179 [2018-04-11 15:53:07,668 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 138 treesize of output 115 [2018-04-11 15:53:07,671 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:07,671 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 31 treesize of output 45 [2018-04-11 15:53:07,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:07,687 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 35 [2018-04-11 15:53:07,687 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-11 15:53:07,699 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-11 15:53:07,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 76 [2018-04-11 15:53:07,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 33 [2018-04-11 15:53:07,828 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:07,836 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 19 treesize of output 17 [2018-04-11 15:53:07,836 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:07,842 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:07,937 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 91 treesize of output 69 [2018-04-11 15:53:07,939 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:07,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, 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 12 [2018-04-11 15:53:07,939 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:07,947 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:07,947 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-04-11 15:53:07,949 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 3 xjuncts. [2018-04-11 15:53:07,961 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:53:08,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 40 [2018-04-11 15:53:08,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-04-11 15:53:08,046 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:08,049 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:08,163 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 77 treesize of output 71 [2018-04-11 15:53:08,164 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:08,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 15 treesize of output 8 [2018-04-11 15:53:08,165 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:08,174 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:08,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2018-04-11 15:53:08,228 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:08,228 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 23 treesize of output 29 [2018-04-11 15:53:08,228 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:08,247 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 5 treesize of output 1 [2018-04-11 15:53:08,247 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:08,253 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:08,313 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 138 treesize of output 102 [2018-04-11 15:53:08,315 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:08,315 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 27 treesize of output 37 [2018-04-11 15:53:08,316 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:08,328 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:08,329 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 59 [2018-04-11 15:53:08,329 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:53:08,339 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:53:08,386 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 69 treesize of output 56 [2018-04-11 15:53:08,388 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 18 treesize of output 9 [2018-04-11 15:53:08,388 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:08,395 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:08,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-04-11 15:53:08,395 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:08,399 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:08,438 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 77 treesize of output 71 [2018-04-11 15:53:08,439 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:08,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-04-11 15:53:08,439 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:08,450 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-11 15:53:08,450 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:08,458 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:08,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2018-04-11 15:53:08,525 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:08,526 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 23 treesize of output 29 [2018-04-11 15:53:08,526 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:08,537 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:08,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 12 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-11 15:53:08,568 INFO L202 ElimStorePlain]: Needed 28 recursive calls to eliminate 18 variables, input treesize:650, output treesize:89 [2018-04-11 15:53:08,619 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:53:08,620 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:53:08,620 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-04-11 15:53:08,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 15:53:08,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 15:53:08,620 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=438, Unknown=2, NotChecked=0, Total=506 [2018-04-11 15:53:08,620 INFO L87 Difference]: Start difference. First operand 207 states and 233 transitions. Second operand 23 states. [2018-04-11 15:53:10,106 WARN L151 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 116 DAG size of output 85 [2018-04-11 15:53:11,222 WARN L151 SmtUtils]: Spent 702ms on a formula simplification. DAG size of input: 241 DAG size of output 240 [2018-04-11 15:53:11,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:53:11,505 INFO L93 Difference]: Finished difference Result 221 states and 246 transitions. [2018-04-11 15:53:11,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 15:53:11,505 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 50 [2018-04-11 15:53:11,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:53:11,506 INFO L225 Difference]: With dead ends: 221 [2018-04-11 15:53:11,506 INFO L226 Difference]: Without dead ends: 212 [2018-04-11 15:53:11,506 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=357, Invalid=1710, Unknown=3, NotChecked=0, Total=2070 [2018-04-11 15:53:11,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-04-11 15:53:11,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 205. [2018-04-11 15:53:11,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-04-11 15:53:11,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 230 transitions. [2018-04-11 15:53:11,508 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 230 transitions. Word has length 50 [2018-04-11 15:53:11,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:53:11,508 INFO L459 AbstractCegarLoop]: Abstraction has 205 states and 230 transitions. [2018-04-11 15:53:11,508 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 15:53:11,508 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 230 transitions. [2018-04-11 15:53:11,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 15:53:11,509 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:53:11,509 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-11 15:53:11,509 INFO L408 AbstractCegarLoop]: === Iteration 43 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 15:53:11,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1457421846, now seen corresponding path program 1 times [2018-04-11 15:53:11,509 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:53:11,509 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:53:11,510 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:53:11,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:53:11,510 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:53:11,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:53:11,518 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:53:11,521 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:53:11,521 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:53:11,521 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:53:11,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:53:11,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:53:11,542 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:53:11,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 15:53:11,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:11,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:11,579 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:53:11,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11 15:53:11,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 15:53:11,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:11,590 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:11,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:53:11,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 15:53:11,597 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:11,598 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:11,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:11,603 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-04-11 15:53:11,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 15:53:11,625 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:11,625 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-11 15:53:11,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:11,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:11,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 15:53:11,639 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:11,640 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-11 15:53:11,640 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:11,643 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:11,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:11,651 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:44 [2018-04-11 15:53:11,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-04-11 15:53:11,667 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:11,668 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:11,668 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:11,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-11 15:53:11,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:11,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:11,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-04-11 15:53:11,690 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:11,690 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:11,690 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:11,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, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-11 15:53:11,691 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:11,696 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:11,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:11,704 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:70, output treesize:62 [2018-04-11 15:53:11,718 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:11,718 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:11,719 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-11 15:53:11,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:11,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:11,728 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:70, output treesize:64 [2018-04-11 15:53:11,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2018-04-11 15:53:11,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 8 treesize of output 7 [2018-04-11 15:53:11,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:11,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:11,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2018-04-11 15:53:11,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:53:11,801 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:11,806 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:11,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:11,816 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:86, output treesize:78 [2018-04-11 15:53:11,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-04-11 15:53:11,844 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:11,844 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:53:11,845 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 30 [2018-04-11 15:53:11,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:11,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:11,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-04-11 15:53:11,877 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:11,878 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-11 15:53:11,878 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:11,885 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:11,902 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-11 15:53:11,902 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:104, output treesize:174 [2018-04-11 15:53:12,101 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 145 treesize of output 112 [2018-04-11 15:53:12,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 54 [2018-04-11 15:53:12,103 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-11 15:53:12,116 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:12,117 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:12,118 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:12,153 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 3 case distinctions, treesize of input 37 treesize of output 85 [2018-04-11 15:53:12,153 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 15:53:12,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 15:53:12,204 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 82 treesize of output 60 [2018-04-11 15:53:12,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 29 [2018-04-11 15:53:12,206 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-11 15:53:12,215 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:12,216 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:12,217 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:12,225 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 3 case distinctions, treesize of input 25 treesize of output 49 [2018-04-11 15:53:12,226 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-11 15:53:12,240 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:53:12,242 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 107 treesize of output 79 [2018-04-11 15:53:12,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, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 45 [2018-04-11 15:53:12,244 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-11 15:53:12,255 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:12,255 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:12,256 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:12,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 37 [2018-04-11 15:53:12,258 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:12,266 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:12,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 7 xjuncts. [2018-04-11 15:53:12,289 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:173, output treesize:109 [2018-04-11 15:53:12,384 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:12,385 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:12,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 24 [2018-04-11 15:53:12,385 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:12,401 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:12,401 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:12,401 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 23 treesize of output 27 [2018-04-11 15:53:12,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:12,416 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:12,417 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:12,417 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 23 treesize of output 27 [2018-04-11 15:53:12,417 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:12,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-04-11 15:53:12,430 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:67, output treesize:61 [2018-04-11 15:53:12,522 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:53:12,522 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:53:12,522 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-04-11 15:53:12,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 15:53:12,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 15:53:12,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2018-04-11 15:53:12,523 INFO L87 Difference]: Start difference. First operand 205 states and 230 transitions. Second operand 22 states. [2018-04-11 15:53:14,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:53:14,406 INFO L93 Difference]: Finished difference Result 224 states and 249 transitions. [2018-04-11 15:53:14,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 15:53:14,406 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 50 [2018-04-11 15:53:14,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:53:14,406 INFO L225 Difference]: With dead ends: 224 [2018-04-11 15:53:14,406 INFO L226 Difference]: Without dead ends: 193 [2018-04-11 15:53:14,407 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=318, Invalid=1574, Unknown=0, NotChecked=0, Total=1892 [2018-04-11 15:53:14,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-04-11 15:53:14,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 189. [2018-04-11 15:53:14,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-04-11 15:53:14,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 213 transitions. [2018-04-11 15:53:14,409 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 213 transitions. Word has length 50 [2018-04-11 15:53:14,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:53:14,409 INFO L459 AbstractCegarLoop]: Abstraction has 189 states and 213 transitions. [2018-04-11 15:53:14,409 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 15:53:14,409 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 213 transitions. [2018-04-11 15:53:14,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-11 15:53:14,409 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:53:14,409 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:53:14,410 INFO L408 AbstractCegarLoop]: === Iteration 44 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 15:53:14,410 INFO L82 PathProgramCache]: Analyzing trace with hash -47844621, now seen corresponding path program 1 times [2018-04-11 15:53:14,410 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:53:14,410 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:53:14,410 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:53:14,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:53:14,410 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:53:14,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:53:14,416 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:53:14,417 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:53:14,417 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:53:14,417 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:53:14,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:53:14,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:53:14,434 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:53:14,550 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:14,551 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:14,551 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-11 15:53:14,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:14,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:14,562 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:44 [2018-04-11 15:53:14,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-04-11 15:53:14,582 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:14,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 15:53:14,601 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:14,602 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-11 15:53:14,602 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:14,611 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:14,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 15:53:14,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:14,628 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-11 15:53:14,629 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:14,632 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:14,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:14,643 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:75, output treesize:46 [2018-04-11 15:53:14,676 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:14,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 61 [2018-04-11 15:53:14,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 15:53:14,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:14,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:14,703 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 49 treesize of output 53 [2018-04-11 15:53:14,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 15:53:14,705 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:14,709 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:14,720 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-11 15:53:14,721 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:101, output treesize:81 [2018-04-11 15:53:14,773 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:53:14,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 72 [2018-04-11 15:53:14,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-11 15:53:14,782 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:14,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:14,808 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:53:14,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 73 [2018-04-11 15:53:14,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-11 15:53:14,818 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:14,829 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:14,842 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-11 15:53:14,842 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:131, output treesize:111 [2018-04-11 15:53:17,379 WARN L148 SmtUtils]: Spent 2013ms on a formula simplification that was a NOOP. DAG size: 43 [2018-04-11 15:53:19,415 WARN L148 SmtUtils]: Spent 2016ms on a formula simplification that was a NOOP. DAG size: 47 [2018-04-11 15:53:19,421 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 124 treesize of output 102 [2018-04-11 15:53:19,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 58 [2018-04-11 15:53:19,449 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-04-11 15:53:19,482 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 15:53:19,543 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:53:19,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 113 [2018-04-11 15:53:19,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 39 [2018-04-11 15:53:19,548 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:19,559 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:19,561 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:53:19,562 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 131 treesize of output 113 [2018-04-11 15:53:19,564 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:53:19,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 39 [2018-04-11 15:53:19,566 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:19,578 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:19,581 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:53:19,582 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 108 treesize of output 98 [2018-04-11 15:53:19,584 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-11 15:53:19,584 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:19,594 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:19,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 114 [2018-04-11 15:53:19,601 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:53:19,601 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 47 [2018-04-11 15:53:19,601 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:19,613 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:19,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2018-04-11 15:53:19,676 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:158, output treesize:439 [2018-04-11 15:53:37,747 WARN L148 SmtUtils]: Spent 18038ms on a formula simplification that was a NOOP. DAG size: 132 [2018-04-11 15:53:55,861 WARN L148 SmtUtils]: Spent 18041ms on a formula simplification that was a NOOP. DAG size: 132 [2018-04-11 15:53:55,891 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 125 treesize of output 111 [2018-04-11 15:53:55,894 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-11 15:53:55,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:55,915 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:55,916 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:55,916 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:53:55,918 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 25 treesize of output 25 [2018-04-11 15:53:55,918 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:55,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:56,001 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 101 treesize of output 85 [2018-04-11 15:53:56,003 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:56,004 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:53:56,005 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 27 treesize of output 21 [2018-04-11 15:53:56,006 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:56,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 7 treesize of output 1 [2018-04-11 15:53:56,018 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:56,026 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:56,091 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 155 treesize of output 123 [2018-04-11 15:53:56,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2018-04-11 15:53:56,095 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:56,112 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:56,113 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:53:56,114 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 25 treesize of output 19 [2018-04-11 15:53:56,114 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:56,126 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53: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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 101 [2018-04-11 15:53:56,181 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-11 15:53:56,181 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:56,194 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:53:56,195 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:53:56,196 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 25 treesize of output 19 [2018-04-11 15:53:56,196 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 15:53:56,206 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:53:56,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-2 vars, End of recursive call: 9 dim-0 vars, and 4 xjuncts. [2018-04-11 15:53:56,250 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 16 variables, input treesize:507, output treesize:271 [2018-04-11 15:54:12,156 WARN L151 SmtUtils]: Spent 15879ms on a formula simplification. DAG size of input: 79 DAG size of output 61 [2018-04-11 15:54:13,014 WARN L151 SmtUtils]: Spent 808ms on a formula simplification. DAG size of input: 81 DAG size of output 59 [2018-04-11 15:54:13,032 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:54:13,032 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:54:13,032 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 15:54:13,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 15:54:13,032 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 15:54:13,032 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=273, Unknown=2, NotChecked=0, Total=342 [2018-04-11 15:54:13,033 INFO L87 Difference]: Start difference. First operand 189 states and 213 transitions. Second operand 19 states. [2018-04-11 15:54:17,558 WARN L151 SmtUtils]: Spent 4061ms on a formula simplification. DAG size of input: 67 DAG size of output 63 [2018-04-11 15:54:21,658 WARN L151 SmtUtils]: Spent 4039ms on a formula simplification. DAG size of input: 62 DAG size of output 58 [2018-04-11 15:54:25,777 WARN L151 SmtUtils]: Spent 4070ms on a formula simplification. DAG size of input: 65 DAG size of output 61 [2018-04-11 15:54:29,944 WARN L151 SmtUtils]: Spent 4058ms on a formula simplification. DAG size of input: 65 DAG size of output 61 [2018-04-11 15:54:48,091 WARN L151 SmtUtils]: Spent 18099ms on a formula simplification. DAG size of input: 255 DAG size of output 147 [2018-04-11 15:55:06,177 WARN L148 SmtUtils]: Spent 18042ms on a formula simplification that was a NOOP. DAG size: 135 Received shutdown request... [2018-04-11 15:55:22,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 15:55:22,309 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 15:55:22,312 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 15:55:22,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 03:55:22 BoogieIcfgContainer [2018-04-11 15:55:22,312 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 15:55:22,313 INFO L168 Benchmark]: Toolchain (without parser) took 210101.12 ms. Allocated memory was 402.1 MB in the beginning and 895.0 MB in the end (delta: 492.8 MB). Free memory was 335.0 MB in the beginning and 682.2 MB in the end (delta: -347.1 MB). Peak memory consumption was 145.7 MB. Max. memory is 5.3 GB. [2018-04-11 15:55:22,313 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 402.1 MB. Free memory is still 362.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 15:55:22,314 INFO L168 Benchmark]: CACSL2BoogieTranslator took 252.38 ms. Allocated memory is still 402.1 MB. Free memory was 335.0 MB in the beginning and 309.3 MB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 5.3 GB. [2018-04-11 15:55:22,314 INFO L168 Benchmark]: Boogie Preprocessor took 39.99 ms. Allocated memory is still 402.1 MB. Free memory was 309.3 MB in the beginning and 305.3 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. [2018-04-11 15:55:22,314 INFO L168 Benchmark]: RCFGBuilder took 534.40 ms. Allocated memory was 402.1 MB in the beginning and 586.2 MB in the end (delta: 184.0 MB). Free memory was 305.3 MB in the beginning and 498.7 MB in the end (delta: -193.3 MB). Peak memory consumption was 23.7 MB. Max. memory is 5.3 GB. [2018-04-11 15:55:22,314 INFO L168 Benchmark]: TraceAbstraction took 209271.39 ms. Allocated memory was 586.2 MB in the beginning and 895.0 MB in the end (delta: 308.8 MB). Free memory was 498.7 MB in the beginning and 682.2 MB in the end (delta: -183.5 MB). Peak memory consumption was 125.3 MB. Max. memory is 5.3 GB. [2018-04-11 15:55:22,315 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.23 ms. Allocated memory is still 402.1 MB. Free memory is still 362.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 252.38 ms. Allocated memory is still 402.1 MB. Free memory was 335.0 MB in the beginning and 309.3 MB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.99 ms. Allocated memory is still 402.1 MB. Free memory was 309.3 MB in the beginning and 305.3 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 534.40 ms. Allocated memory was 402.1 MB in the beginning and 586.2 MB in the end (delta: 184.0 MB). Free memory was 305.3 MB in the beginning and 498.7 MB in the end (delta: -193.3 MB). Peak memory consumption was 23.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 209271.39 ms. Allocated memory was 586.2 MB in the beginning and 895.0 MB in the end (delta: 308.8 MB). Free memory was 498.7 MB in the beginning and 682.2 MB in the end (delta: -183.5 MB). Peak memory consumption was 125.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 673]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 673). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 646]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 672]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 644]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 645]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 651]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 631]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 657]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 646]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 632]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 666]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 667]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 658]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 673]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 673). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 650]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 670]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 670). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 673]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 673). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 664]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 664). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 667]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 645]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 676]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 676). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 633]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 633). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 650]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 633]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 633). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 650]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 667]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 666]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 646]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 649]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 644]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 651]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 664]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 664). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 670]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 670). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 658]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 651]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 645]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 632]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 662]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 673]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 673). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 644]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 645]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 620]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 620). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 649]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 646]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 631]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 667]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 672]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 662]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 644]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 650]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 657]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 676]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 676). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - TimeoutResultAtElement [Line: 651]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was constructing difference of abstraction (189states) and interpolant automaton (currently 19 states, 19 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 286. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 168 locations, 75 error locations. TIMEOUT Result, 209.2s OverallTime, 44 OverallIterations, 3 TraceHistogramMax, 122.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4778 SDtfs, 6873 SDslu, 12364 SDs, 0 SdLazy, 13754 SolverSat, 709 SolverUnsat, 21 SolverUnknown, 0 SolverNotchecked, 16.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1193 GetRequests, 681 SyntacticMatches, 5 SemanticMatches, 506 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1585 ImplicationChecksByTransitivity, 167.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=215occurred in iteration=37, 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, 43 MinimizatonAttempts, 1516 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 85.2s InterpolantComputationTime, 2236 NumberOfCodeBlocks, 2236 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 1432 ConstructedInterpolants, 114 QuantifiedInterpolants, 814427 SizeOfPredicates, 211 NumberOfNonLiveVariables, 3716 ConjunctsInSsa, 523 ConjunctsInUnsatCore, 46 InterpolantComputations, 41 PerfectInterpolantSequences, 54/68 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_parent_ptr_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_15-55-22-321.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_parent_ptr_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_15-55-22-321.csv Completed graceful shutdown