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_Camel.epf -i ../../../trunk/examples/svcomp/memsafety-ext/tree_stack_true-valid-memsafety_false-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 10:54:00,150 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 10:54:00,151 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 10:54:00,163 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 10:54:00,164 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 10:54:00,164 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 10:54:00,165 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 10:54:00,166 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 10:54:00,168 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 10:54:00,169 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 10:54:00,169 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 10:54:00,170 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 10:54:00,170 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 10:54:00,171 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 10:54:00,172 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 10:54:00,174 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 10:54:00,175 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 10:54:00,176 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 10:54:00,177 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 10:54:00,178 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 10:54:00,180 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 10:54:00,180 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 10:54:00,180 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 10:54:00,181 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 10:54:00,181 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 10:54:00,182 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 10:54:00,183 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 10:54:00,183 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 10:54:00,184 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 10:54:00,184 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 10:54:00,184 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 10:54:00,184 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-04-11 10:54:00,203 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 10:54:00,203 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 10:54:00,204 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 10:54:00,205 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 10:54:00,205 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 10:54:00,205 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 10:54:00,205 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 10:54:00,205 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 10:54:00,205 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 10:54:00,205 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 10:54:00,205 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 10:54:00,205 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 10:54:00,206 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 10:54:00,206 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 10:54:00,206 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 10:54:00,206 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 10:54:00,206 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 10:54:00,206 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 10:54:00,206 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 10:54:00,206 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 10:54:00,206 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 10:54:00,207 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 10:54:00,207 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 10:54:00,207 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-11 10:54:00,234 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 10:54:00,242 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 10:54:00,244 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 10:54:00,245 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 10:54:00,245 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 10:54:00,246 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,551 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG2381b33f5 [2018-04-11 10:54:00,685 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 10:54:00,685 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 10:54:00,685 INFO L168 CDTParser]: Scanning tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,692 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 10:54:00,692 INFO L215 ultiparseSymbolTable]: [2018-04-11 10:54:00,692 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 10:54:00,693 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,693 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 10:54:00,693 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__key_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,693 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__pthread_mutex_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,693 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____u_short in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,693 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____rlim_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,693 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__size_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,693 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____intptr_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,693 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____int32_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,694 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__time_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,694 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____ssize_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,694 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__mode_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,694 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____socklen_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,694 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____uint32_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,694 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__pid_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,694 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__int32_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,694 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__fd_set in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,694 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__pthread_rwlock_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,694 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__fsfilcnt_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,695 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__off_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,695 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__gid_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,695 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____blkcnt64_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,695 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__div_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,695 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__blksize_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,695 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__u_short in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,695 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__caddr_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,695 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____mode_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,695 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__ssize_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,695 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__u_int32_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,696 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____uint64_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,696 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____fsblkcnt64_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,696 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____uid_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,696 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__pthread_once_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,696 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__u_char in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,696 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__pthread_attr_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,696 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____fd_mask in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,696 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__blkcnt_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,697 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__timer_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,697 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____sig_atomic_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,697 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__lldiv_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,697 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__uid_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,697 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____nlink_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,697 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__int16_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,697 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____pthread_list_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,697 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__u_int8_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,697 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__wchar_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,697 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__pthread_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,698 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____id_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,698 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__fsblkcnt_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,698 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____u_char in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,698 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____off64_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,698 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____suseconds_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,698 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____gid_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,698 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____quad_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,698 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____timer_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,698 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____pid_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,699 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__u_int in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,699 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__pthread_mutexattr_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,699 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____loff_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,699 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__suseconds_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,699 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__int64_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,699 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____sigset_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,699 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__fd_mask in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,699 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____WAIT_STATUS in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,699 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__fsid_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,700 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__ushort in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,700 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__u_int16_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,700 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__pthread_cond_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,700 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____u_quad_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,700 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____blkcnt_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,700 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____clock_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,700 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____clockid_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,700 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__clockid_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,700 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__u_long in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,701 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__pthread_barrier_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,701 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____off_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,701 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__quad_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,701 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__id_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,701 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__clock_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,701 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__uint in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,701 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____u_int in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,701 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__nlink_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,701 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____fsid_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,701 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____int16_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,701 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__dev_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,701 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__pthread_rwlockattr_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,702 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____u_long in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,702 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____ino64_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,702 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__pthread_spinlock_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,702 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__sigset_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,702 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____ino_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,702 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____swblk_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,702 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__u_quad_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,702 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__ulong in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,702 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____caddr_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,702 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____int8_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,702 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__pthread_key_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,703 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____dev_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,703 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____fsblkcnt_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,703 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__register_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,703 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__pthread_barrierattr_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,703 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____fsfilcnt64_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,703 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__loff_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,703 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__pthread_condattr_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,703 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__ino_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,703 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__daddr_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,703 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____useconds_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,703 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__u_int64_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,703 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__ldiv_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,703 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____key_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,704 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____int64_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,704 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____daddr_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,704 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____uint8_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,704 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____blksize_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,704 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____time_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,704 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__int8_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,704 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____uint16_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,704 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____qaddr_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,704 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____rlim64_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,704 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____fsfilcnt_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:00,716 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG2381b33f5 [2018-04-11 10:54:00,720 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 10:54:00,721 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 10:54:00,722 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 10:54:00,722 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 10:54:00,726 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 10:54:00,727 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 10:54:00" (1/1) ... [2018-04-11 10:54:00,728 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b80f736 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:54:00, skipping insertion in model container [2018-04-11 10:54:00,728 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 10:54:00" (1/1) ... [2018-04-11 10:54:00,739 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 10:54:00,762 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 10:54:00,892 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 10:54:00,927 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 10:54:00,932 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 110 non ball SCCs. Number of states in SCCs 110. [2018-04-11 10:54:00,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:54:00 WrapperNode [2018-04-11 10:54:00,958 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 10:54:00,959 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 10:54:00,959 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 10:54:00,959 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 10:54:00,967 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:54:00" (1/1) ... [2018-04-11 10:54:00,967 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:54:00" (1/1) ... [2018-04-11 10:54:00,978 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:54:00" (1/1) ... [2018-04-11 10:54:00,978 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:54:00" (1/1) ... [2018-04-11 10:54:00,988 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:54:00" (1/1) ... [2018-04-11 10:54:00,992 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:54:00" (1/1) ... [2018-04-11 10:54:00,994 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:54:00" (1/1) ... [2018-04-11 10:54:00,998 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 10:54:00,998 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 10:54:00,998 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 10:54:00,998 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 10:54:00,999 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:54:00" (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 10:54:01,086 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 10:54:01,086 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 10:54:01,086 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 10:54:01,086 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 10:54:01,086 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-11 10:54:01,087 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 10:54:01,087 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 10:54:01,087 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 10:54:01,087 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 10:54:01,087 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 10:54:01,087 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 10:54:01,087 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 10:54:01,087 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 10:54:01,087 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 10:54:01,087 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 10:54:01,088 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 10:54:01,088 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 10:54:01,088 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 10:54:01,088 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 10:54:01,088 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 10:54:01,088 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 10:54:01,088 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 10:54:01,088 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 10:54:01,088 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 10:54:01,089 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 10:54:01,089 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 10:54:01,089 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 10:54:01,089 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 10:54:01,089 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 10:54:01,089 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 10:54:01,089 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 10:54:01,089 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 10:54:01,089 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 10:54:01,090 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 10:54:01,090 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 10:54:01,090 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 10:54:01,090 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 10:54:01,090 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 10:54:01,090 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 10:54:01,090 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 10:54:01,090 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 10:54:01,090 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 10:54:01,091 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 10:54:01,092 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 10:54:01,092 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 10:54:01,092 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 10:54:01,092 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 10:54:01,092 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 10:54:01,092 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 10:54:01,092 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 10:54:01,092 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 10:54:01,092 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 10:54:01,093 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 10:54:01,093 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 10:54:01,093 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 10:54:01,093 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 10:54:01,093 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 10:54:01,093 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 10:54:01,093 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 10:54:01,093 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 10:54:01,093 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 10:54:01,093 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 10:54:01,093 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 10:54:01,094 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 10:54:01,094 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 10:54:01,094 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 10:54:01,094 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 10:54:01,094 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 10:54:01,094 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 10:54:01,094 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-11 10:54:01,094 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 10:54:01,094 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 10:54:01,095 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 10:54:01,095 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 10:54:01,095 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 10:54:01,095 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 10:54:01,095 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 10:54:01,095 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 10:54:01,095 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 10:54:01,095 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 10:54:01,095 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 10:54:01,095 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 10:54:01,096 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 10:54:01,096 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 10:54:01,096 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 10:54:01,096 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 10:54:01,096 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 10:54:01,096 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 10:54:01,096 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 10:54:01,096 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 10:54:01,096 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 10:54:01,096 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 10:54:01,096 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 10:54:01,097 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 10:54:01,097 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 10:54:01,097 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 10:54:01,097 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 10:54:01,097 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 10:54:01,097 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 10:54:01,097 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 10:54:01,097 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 10:54:01,097 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 10:54:01,097 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 10:54:01,098 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 10:54:01,098 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 10:54:01,098 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 10:54:01,098 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 10:54:01,098 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 10:54:01,098 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-11 10:54:01,098 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-11 10:54:01,098 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 10:54:01,098 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 10:54:01,098 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 10:54:01,621 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 10:54:01,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 10:54:01 BoogieIcfgContainer [2018-04-11 10:54:01,622 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 10:54:01,622 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 10:54:01,622 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 10:54:01,625 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 10:54:01,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 10:54:00" (1/3) ... [2018-04-11 10:54:01,626 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b776ac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 10:54:01, skipping insertion in model container [2018-04-11 10:54:01,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:54:00" (2/3) ... [2018-04-11 10:54:01,626 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b776ac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 10:54:01, skipping insertion in model container [2018-04-11 10:54:01,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 10:54:01" (3/3) ... [2018-04-11 10:54:01,628 INFO L107 eAbstractionObserver]: Analyzing ICFG tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 10:54:01,636 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 10:54:01,642 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 65 error locations. [2018-04-11 10:54:01,670 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 10:54:01,671 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 10:54:01,671 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 10:54:01,671 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 10:54:01,671 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 10:54:01,671 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 10:54:01,671 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 10:54:01,672 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 10:54:01,672 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 10:54:01,672 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 10:54:01,687 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2018-04-11 10:54:01,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-11 10:54:01,697 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:54:01,698 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:54:01,699 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:54:01,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1341836454, now seen corresponding path program 1 times [2018-04-11 10:54:01,706 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:54:01,706 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:54:01,753 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:01,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:54:01,753 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:01,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:54:01,789 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:54:01,906 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 10:54:01,908 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:54:01,908 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 10:54:01,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 10:54:01,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 10:54:01,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 10:54:01,925 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 4 states. [2018-04-11 10:54:02,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:54:02,127 INFO L93 Difference]: Finished difference Result 168 states and 179 transitions. [2018-04-11 10:54:02,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 10:54:02,128 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-11 10:54:02,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:54:02,137 INFO L225 Difference]: With dead ends: 168 [2018-04-11 10:54:02,137 INFO L226 Difference]: Without dead ends: 164 [2018-04-11 10:54:02,139 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:54:02,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-04-11 10:54:02,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 146. [2018-04-11 10:54:02,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-04-11 10:54:02,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 156 transitions. [2018-04-11 10:54:02,172 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 156 transitions. Word has length 8 [2018-04-11 10:54:02,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:54:02,173 INFO L459 AbstractCegarLoop]: Abstraction has 146 states and 156 transitions. [2018-04-11 10:54:02,173 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 10:54:02,173 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 156 transitions. [2018-04-11 10:54:02,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-11 10:54:02,173 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:54:02,173 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:54:02,173 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:54:02,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1341836455, now seen corresponding path program 1 times [2018-04-11 10:54:02,174 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:54:02,174 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:54:02,175 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:02,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:54:02,175 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:02,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:54:02,186 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:54:02,218 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 10:54:02,218 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:54:02,218 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 10:54:02,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 10:54:02,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 10:54:02,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 10:54:02,220 INFO L87 Difference]: Start difference. First operand 146 states and 156 transitions. Second operand 4 states. [2018-04-11 10:54:02,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:54:02,319 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2018-04-11 10:54:02,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 10:54:02,319 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-11 10:54:02,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:54:02,320 INFO L225 Difference]: With dead ends: 144 [2018-04-11 10:54:02,320 INFO L226 Difference]: Without dead ends: 144 [2018-04-11 10:54:02,321 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 10:54:02,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-04-11 10:54:02,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-04-11 10:54:02,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-04-11 10:54:02,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 154 transitions. [2018-04-11 10:54:02,329 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 154 transitions. Word has length 8 [2018-04-11 10:54:02,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:54:02,329 INFO L459 AbstractCegarLoop]: Abstraction has 144 states and 154 transitions. [2018-04-11 10:54:02,329 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 10:54:02,329 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 154 transitions. [2018-04-11 10:54:02,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-11 10:54:02,330 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:54:02,330 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:54:02,330 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:54:02,330 INFO L82 PathProgramCache]: Analyzing trace with hash -2000274829, now seen corresponding path program 1 times [2018-04-11 10:54:02,331 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:54:02,331 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:54:02,331 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:02,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:54:02,332 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:02,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:54:02,343 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:54:02,363 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 10:54:02,363 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:54:02,363 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 10:54:02,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 10:54:02,363 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 10:54:02,363 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 10:54:02,364 INFO L87 Difference]: Start difference. First operand 144 states and 154 transitions. Second operand 4 states. [2018-04-11 10:54:02,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:54:02,484 INFO L93 Difference]: Finished difference Result 154 states and 165 transitions. [2018-04-11 10:54:02,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 10:54:02,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-04-11 10:54:02,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:54:02,486 INFO L225 Difference]: With dead ends: 154 [2018-04-11 10:54:02,486 INFO L226 Difference]: Without dead ends: 154 [2018-04-11 10:54:02,486 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 10:54:02,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-04-11 10:54:02,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 131. [2018-04-11 10:54:02,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-04-11 10:54:02,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 142 transitions. [2018-04-11 10:54:02,492 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 142 transitions. Word has length 14 [2018-04-11 10:54:02,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:54:02,493 INFO L459 AbstractCegarLoop]: Abstraction has 131 states and 142 transitions. [2018-04-11 10:54:02,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 10:54:02,493 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 142 transitions. [2018-04-11 10:54:02,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-11 10:54:02,493 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:54:02,493 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:54:02,493 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:54:02,494 INFO L82 PathProgramCache]: Analyzing trace with hash -2000274828, now seen corresponding path program 1 times [2018-04-11 10:54:02,494 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:54:02,494 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:54:02,495 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:02,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:54:02,495 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:02,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:54:02,506 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:54:02,557 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 10:54:02,557 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:54:02,557 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 10:54:02,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 10:54:02,557 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 10:54:02,557 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:54:02,557 INFO L87 Difference]: Start difference. First operand 131 states and 142 transitions. Second operand 5 states. [2018-04-11 10:54:02,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:54:02,717 INFO L93 Difference]: Finished difference Result 177 states and 195 transitions. [2018-04-11 10:54:02,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 10:54:02,717 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-04-11 10:54:02,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:54:02,720 INFO L225 Difference]: With dead ends: 177 [2018-04-11 10:54:02,720 INFO L226 Difference]: Without dead ends: 177 [2018-04-11 10:54:02,720 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 10:54:02,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-04-11 10:54:02,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 161. [2018-04-11 10:54:02,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-04-11 10:54:02,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 184 transitions. [2018-04-11 10:54:02,728 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 184 transitions. Word has length 14 [2018-04-11 10:54:02,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:54:02,728 INFO L459 AbstractCegarLoop]: Abstraction has 161 states and 184 transitions. [2018-04-11 10:54:02,728 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 10:54:02,728 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 184 transitions. [2018-04-11 10:54:02,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-11 10:54:02,729 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:54:02,729 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:54:02,729 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:54:02,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1882745265, now seen corresponding path program 1 times [2018-04-11 10:54:02,729 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:54:02,730 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:54:02,730 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:02,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:54:02,730 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:02,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:54:02,740 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:54:02,759 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 10:54:02,760 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:54:02,760 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 10:54:02,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 10:54:02,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 10:54:02,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 10:54:02,760 INFO L87 Difference]: Start difference. First operand 161 states and 184 transitions. Second operand 4 states. [2018-04-11 10:54:02,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:54:02,826 INFO L93 Difference]: Finished difference Result 176 states and 199 transitions. [2018-04-11 10:54:02,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 10:54:02,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-04-11 10:54:02,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:54:02,827 INFO L225 Difference]: With dead ends: 176 [2018-04-11 10:54:02,827 INFO L226 Difference]: Without dead ends: 176 [2018-04-11 10:54:02,827 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 10:54:02,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-04-11 10:54:02,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 162. [2018-04-11 10:54:02,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-04-11 10:54:02,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 187 transitions. [2018-04-11 10:54:02,833 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 187 transitions. Word has length 16 [2018-04-11 10:54:02,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:54:02,834 INFO L459 AbstractCegarLoop]: Abstraction has 162 states and 187 transitions. [2018-04-11 10:54:02,834 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 10:54:02,834 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 187 transitions. [2018-04-11 10:54:02,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-11 10:54:02,834 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:54:02,834 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:54:02,834 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:54:02,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1882745266, now seen corresponding path program 1 times [2018-04-11 10:54:02,835 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:54:02,835 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:54:02,836 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:02,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:54:02,836 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:02,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:54:02,846 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:54:02,877 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 10:54:02,877 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:54:02,877 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 10:54:02,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 10:54:02,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 10:54:02,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 10:54:02,878 INFO L87 Difference]: Start difference. First operand 162 states and 187 transitions. Second operand 4 states. [2018-04-11 10:54:02,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:54:02,955 INFO L93 Difference]: Finished difference Result 164 states and 187 transitions. [2018-04-11 10:54:02,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 10:54:02,955 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-04-11 10:54:02,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:54:02,955 INFO L225 Difference]: With dead ends: 164 [2018-04-11 10:54:02,956 INFO L226 Difference]: Without dead ends: 164 [2018-04-11 10:54:02,956 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 10:54:02,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-04-11 10:54:02,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 160. [2018-04-11 10:54:02,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-04-11 10:54:02,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 184 transitions. [2018-04-11 10:54:02,961 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 184 transitions. Word has length 16 [2018-04-11 10:54:02,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:54:02,961 INFO L459 AbstractCegarLoop]: Abstraction has 160 states and 184 transitions. [2018-04-11 10:54:02,961 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 10:54:02,961 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 184 transitions. [2018-04-11 10:54:02,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-11 10:54:02,962 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:54:02,962 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] [2018-04-11 10:54:02,963 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:54:02,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1407261537, now seen corresponding path program 1 times [2018-04-11 10:54:02,963 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:54:02,963 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:54:02,963 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:02,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:54:02,964 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:02,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:54:02,973 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:54:02,986 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 10:54:02,986 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:54:02,987 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 10:54:02,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 10:54:02,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 10:54:02,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 10:54:02,987 INFO L87 Difference]: Start difference. First operand 160 states and 184 transitions. Second operand 4 states. [2018-04-11 10:54:03,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:54:03,002 INFO L93 Difference]: Finished difference Result 161 states and 184 transitions. [2018-04-11 10:54:03,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 10:54:03,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-04-11 10:54:03,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:54:03,003 INFO L225 Difference]: With dead ends: 161 [2018-04-11 10:54:03,003 INFO L226 Difference]: Without dead ends: 161 [2018-04-11 10:54:03,003 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 10:54:03,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-04-11 10:54:03,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2018-04-11 10:54:03,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-04-11 10:54:03,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 183 transitions. [2018-04-11 10:54:03,006 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 183 transitions. Word has length 21 [2018-04-11 10:54:03,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:54:03,006 INFO L459 AbstractCegarLoop]: Abstraction has 160 states and 183 transitions. [2018-04-11 10:54:03,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 10:54:03,006 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 183 transitions. [2018-04-11 10:54:03,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-11 10:54:03,006 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:54:03,007 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 10:54:03,007 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:54:03,007 INFO L82 PathProgramCache]: Analyzing trace with hash 675431961, now seen corresponding path program 1 times [2018-04-11 10:54:03,007 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:54:03,007 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:54:03,008 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:03,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:54:03,008 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:54:03,017 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:54:03,040 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 10:54:03,041 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:54:03,041 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 10:54:03,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 10:54:03,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 10:54:03,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:54:03,041 INFO L87 Difference]: Start difference. First operand 160 states and 183 transitions. Second operand 5 states. [2018-04-11 10:54:03,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:54:03,126 INFO L93 Difference]: Finished difference Result 177 states and 201 transitions. [2018-04-11 10:54:03,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 10:54:03,126 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-04-11 10:54:03,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:54:03,127 INFO L225 Difference]: With dead ends: 177 [2018-04-11 10:54:03,127 INFO L226 Difference]: Without dead ends: 177 [2018-04-11 10:54:03,127 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 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 10:54:03,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-04-11 10:54:03,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 159. [2018-04-11 10:54:03,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-04-11 10:54:03,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 183 transitions. [2018-04-11 10:54:03,131 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 183 transitions. Word has length 22 [2018-04-11 10:54:03,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:54:03,131 INFO L459 AbstractCegarLoop]: Abstraction has 159 states and 183 transitions. [2018-04-11 10:54:03,131 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 10:54:03,131 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 183 transitions. [2018-04-11 10:54:03,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-11 10:54:03,131 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:54:03,132 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 10:54:03,132 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:54:03,132 INFO L82 PathProgramCache]: Analyzing trace with hash 675431962, now seen corresponding path program 1 times [2018-04-11 10:54:03,132 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:54:03,132 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:54:03,132 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:03,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:54:03,133 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:03,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:54:03,142 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:54:03,178 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 10:54:03,179 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:54:03,179 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 10:54:03,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 10:54:03,179 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 10:54:03,179 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:54:03,180 INFO L87 Difference]: Start difference. First operand 159 states and 183 transitions. Second operand 5 states. [2018-04-11 10:54:03,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:54:03,314 INFO L93 Difference]: Finished difference Result 183 states and 208 transitions. [2018-04-11 10:54:03,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 10:54:03,315 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-04-11 10:54:03,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:54:03,316 INFO L225 Difference]: With dead ends: 183 [2018-04-11 10:54:03,316 INFO L226 Difference]: Without dead ends: 183 [2018-04-11 10:54:03,316 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 10:54:03,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-04-11 10:54:03,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 161. [2018-04-11 10:54:03,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-04-11 10:54:03,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 184 transitions. [2018-04-11 10:54:03,319 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 184 transitions. Word has length 22 [2018-04-11 10:54:03,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:54:03,320 INFO L459 AbstractCegarLoop]: Abstraction has 161 states and 184 transitions. [2018-04-11 10:54:03,320 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 10:54:03,320 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 184 transitions. [2018-04-11 10:54:03,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-11 10:54:03,320 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:54:03,321 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:54:03,321 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:54:03,321 INFO L82 PathProgramCache]: Analyzing trace with hash -684849302, now seen corresponding path program 1 times [2018-04-11 10:54:03,321 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:54:03,321 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:54:03,322 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:03,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:54:03,322 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:03,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:54:03,330 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:54:03,339 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 10:54:03,339 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:54:03,339 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 10:54:03,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 10:54:03,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 10:54:03,340 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 10:54:03,340 INFO L87 Difference]: Start difference. First operand 161 states and 184 transitions. Second operand 3 states. [2018-04-11 10:54:03,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:54:03,351 INFO L93 Difference]: Finished difference Result 163 states and 186 transitions. [2018-04-11 10:54:03,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 10:54:03,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-04-11 10:54:03,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:54:03,352 INFO L225 Difference]: With dead ends: 163 [2018-04-11 10:54:03,352 INFO L226 Difference]: Without dead ends: 163 [2018-04-11 10:54:03,352 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 10:54:03,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-04-11 10:54:03,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-04-11 10:54:03,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-04-11 10:54:03,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 186 transitions. [2018-04-11 10:54:03,354 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 186 transitions. Word has length 22 [2018-04-11 10:54:03,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:54:03,355 INFO L459 AbstractCegarLoop]: Abstraction has 163 states and 186 transitions. [2018-04-11 10:54:03,355 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 10:54:03,355 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 186 transitions. [2018-04-11 10:54:03,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-11 10:54:03,355 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:54:03,355 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:54:03,355 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:54:03,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1056809095, now seen corresponding path program 1 times [2018-04-11 10:54:03,355 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:54:03,356 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:54:03,356 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:03,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:54:03,356 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:03,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:54:03,364 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:54:03,413 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 10:54:03,413 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:54:03,413 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 10:54:03,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 10:54:03,413 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 10:54:03,413 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 10:54:03,413 INFO L87 Difference]: Start difference. First operand 163 states and 186 transitions. Second operand 6 states. [2018-04-11 10:54:03,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:54:03,576 INFO L93 Difference]: Finished difference Result 206 states and 236 transitions. [2018-04-11 10:54:03,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 10:54:03,576 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-04-11 10:54:03,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:54:03,577 INFO L225 Difference]: With dead ends: 206 [2018-04-11 10:54:03,577 INFO L226 Difference]: Without dead ends: 206 [2018-04-11 10:54:03,577 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-04-11 10:54:03,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-04-11 10:54:03,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 179. [2018-04-11 10:54:03,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-04-11 10:54:03,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 207 transitions. [2018-04-11 10:54:03,581 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 207 transitions. Word has length 24 [2018-04-11 10:54:03,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:54:03,581 INFO L459 AbstractCegarLoop]: Abstraction has 179 states and 207 transitions. [2018-04-11 10:54:03,581 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 10:54:03,581 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 207 transitions. [2018-04-11 10:54:03,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-11 10:54:03,582 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:54:03,582 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:54:03,582 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:54:03,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1890326275, now seen corresponding path program 1 times [2018-04-11 10:54:03,582 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:54:03,583 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:54:03,583 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:03,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:54:03,583 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:03,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:54:03,590 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:54:03,613 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 10:54:03,613 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:54:03,613 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 10:54:03,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 10:54:03,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 10:54:03,613 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:54:03,613 INFO L87 Difference]: Start difference. First operand 179 states and 207 transitions. Second operand 5 states. [2018-04-11 10:54:03,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:54:03,807 INFO L93 Difference]: Finished difference Result 265 states and 309 transitions. [2018-04-11 10:54:03,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 10:54:03,807 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-04-11 10:54:03,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:54:03,808 INFO L225 Difference]: With dead ends: 265 [2018-04-11 10:54:03,808 INFO L226 Difference]: Without dead ends: 265 [2018-04-11 10:54:03,809 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 10:54:03,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-04-11 10:54:03,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 178. [2018-04-11 10:54:03,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-04-11 10:54:03,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 205 transitions. [2018-04-11 10:54:03,812 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 205 transitions. Word has length 25 [2018-04-11 10:54:03,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:54:03,813 INFO L459 AbstractCegarLoop]: Abstraction has 178 states and 205 transitions. [2018-04-11 10:54:03,813 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 10:54:03,813 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 205 transitions. [2018-04-11 10:54:03,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-11 10:54:03,813 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:54:03,813 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:54:03,814 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:54:03,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1890326274, now seen corresponding path program 1 times [2018-04-11 10:54:03,814 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:54:03,814 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:54:03,815 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:03,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:54:03,815 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:03,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:54:03,822 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:54:03,865 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 10:54:03,865 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:54:03,866 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 10:54:03,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 10:54:03,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 10:54:03,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:54:03,866 INFO L87 Difference]: Start difference. First operand 178 states and 205 transitions. Second operand 5 states. [2018-04-11 10:54:04,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:54:04,111 INFO L93 Difference]: Finished difference Result 310 states and 355 transitions. [2018-04-11 10:54:04,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 10:54:04,112 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-04-11 10:54:04,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:54:04,113 INFO L225 Difference]: With dead ends: 310 [2018-04-11 10:54:04,113 INFO L226 Difference]: Without dead ends: 310 [2018-04-11 10:54:04,113 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 10:54:04,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-04-11 10:54:04,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 177. [2018-04-11 10:54:04,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-04-11 10:54:04,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 203 transitions. [2018-04-11 10:54:04,117 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 203 transitions. Word has length 25 [2018-04-11 10:54:04,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:54:04,117 INFO L459 AbstractCegarLoop]: Abstraction has 177 states and 203 transitions. [2018-04-11 10:54:04,117 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 10:54:04,117 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 203 transitions. [2018-04-11 10:54:04,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-11 10:54:04,118 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:54:04,118 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:54:04,118 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:54:04,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1446644267, now seen corresponding path program 1 times [2018-04-11 10:54:04,118 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:54:04,118 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:54:04,119 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:04,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:54:04,119 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:04,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:54:04,128 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:54:04,320 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 10:54:04,320 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:54:04,320 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-11 10:54:04,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 10:54:04,321 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 10:54:04,321 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-04-11 10:54:04,321 INFO L87 Difference]: Start difference. First operand 177 states and 203 transitions. Second operand 11 states. [2018-04-11 10:54:04,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:54:04,793 INFO L93 Difference]: Finished difference Result 197 states and 226 transitions. [2018-04-11 10:54:04,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 10:54:04,793 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-04-11 10:54:04,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:54:04,794 INFO L225 Difference]: With dead ends: 197 [2018-04-11 10:54:04,794 INFO L226 Difference]: Without dead ends: 197 [2018-04-11 10:54:04,794 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2018-04-11 10:54:04,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-04-11 10:54:04,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 180. [2018-04-11 10:54:04,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-04-11 10:54:04,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 207 transitions. [2018-04-11 10:54:04,796 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 207 transitions. Word has length 27 [2018-04-11 10:54:04,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:54:04,796 INFO L459 AbstractCegarLoop]: Abstraction has 180 states and 207 transitions. [2018-04-11 10:54:04,796 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 10:54:04,796 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 207 transitions. [2018-04-11 10:54:04,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-11 10:54:04,797 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:54:04,797 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:54:04,797 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:54:04,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1446644268, now seen corresponding path program 1 times [2018-04-11 10:54:04,797 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:54:04,797 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:54:04,798 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:04,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:54:04,798 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:04,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:54:04,804 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:54:05,009 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 10:54:05,009 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:54:05,009 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-04-11 10:54:05,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 10:54:05,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 10:54:05,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-04-11 10:54:05,010 INFO L87 Difference]: Start difference. First operand 180 states and 207 transitions. Second operand 13 states. [2018-04-11 10:54:05,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:54:05,546 INFO L93 Difference]: Finished difference Result 246 states and 273 transitions. [2018-04-11 10:54:05,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 10:54:05,546 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-04-11 10:54:05,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:54:05,546 INFO L225 Difference]: With dead ends: 246 [2018-04-11 10:54:05,547 INFO L226 Difference]: Without dead ends: 246 [2018-04-11 10:54:05,547 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=200, Invalid=612, Unknown=0, NotChecked=0, Total=812 [2018-04-11 10:54:05,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-04-11 10:54:05,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 196. [2018-04-11 10:54:05,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-04-11 10:54:05,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 230 transitions. [2018-04-11 10:54:05,549 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 230 transitions. Word has length 27 [2018-04-11 10:54:05,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:54:05,549 INFO L459 AbstractCegarLoop]: Abstraction has 196 states and 230 transitions. [2018-04-11 10:54:05,549 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 10:54:05,549 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 230 transitions. [2018-04-11 10:54:05,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 10:54:05,550 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:54:05,550 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 10:54:05,550 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:54:05,550 INFO L82 PathProgramCache]: Analyzing trace with hash 901181277, now seen corresponding path program 1 times [2018-04-11 10:54:05,550 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:54:05,550 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:54:05,550 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:05,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:54:05,551 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:05,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:54:05,558 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:54:05,625 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 10:54:05,625 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:54:05,625 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 10:54:05,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 10:54:05,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 10:54:05,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-11 10:54:05,626 INFO L87 Difference]: Start difference. First operand 196 states and 230 transitions. Second operand 9 states. [2018-04-11 10:54:05,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:54:05,886 INFO L93 Difference]: Finished difference Result 233 states and 274 transitions. [2018-04-11 10:54:05,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 10:54:05,887 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-04-11 10:54:05,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:54:05,887 INFO L225 Difference]: With dead ends: 233 [2018-04-11 10:54:05,887 INFO L226 Difference]: Without dead ends: 233 [2018-04-11 10:54:05,888 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-04-11 10:54:05,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-04-11 10:54:05,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 195. [2018-04-11 10:54:05,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-04-11 10:54:05,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 228 transitions. [2018-04-11 10:54:05,892 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 228 transitions. Word has length 28 [2018-04-11 10:54:05,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:54:05,892 INFO L459 AbstractCegarLoop]: Abstraction has 195 states and 228 transitions. [2018-04-11 10:54:05,892 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 10:54:05,892 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 228 transitions. [2018-04-11 10:54:05,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 10:54:05,893 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:54:05,893 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 10:54:05,893 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:54:05,893 INFO L82 PathProgramCache]: Analyzing trace with hash 901181278, now seen corresponding path program 1 times [2018-04-11 10:54:05,893 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:54:05,893 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:54:05,894 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:05,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:54:05,894 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:05,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:54:05,902 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:54:05,980 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 10:54:05,980 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:54:05,980 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 10:54:05,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 10:54:05,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 10:54:05,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-11 10:54:05,981 INFO L87 Difference]: Start difference. First operand 195 states and 228 transitions. Second operand 9 states. [2018-04-11 10:54:06,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:54:06,246 INFO L93 Difference]: Finished difference Result 232 states and 272 transitions. [2018-04-11 10:54:06,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 10:54:06,246 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-04-11 10:54:06,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:54:06,247 INFO L225 Difference]: With dead ends: 232 [2018-04-11 10:54:06,247 INFO L226 Difference]: Without dead ends: 232 [2018-04-11 10:54:06,247 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-04-11 10:54:06,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-04-11 10:54:06,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 194. [2018-04-11 10:54:06,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-04-11 10:54:06,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 226 transitions. [2018-04-11 10:54:06,250 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 226 transitions. Word has length 28 [2018-04-11 10:54:06,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:54:06,250 INFO L459 AbstractCegarLoop]: Abstraction has 194 states and 226 transitions. [2018-04-11 10:54:06,250 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 10:54:06,250 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 226 transitions. [2018-04-11 10:54:06,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 10:54:06,250 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:54:06,250 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 10:54:06,250 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:54:06,250 INFO L82 PathProgramCache]: Analyzing trace with hash -2057254630, now seen corresponding path program 1 times [2018-04-11 10:54:06,251 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:54:06,251 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:54:06,251 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:06,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:54:06,251 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:06,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:54:06,257 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:54:06,282 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 10:54:06,282 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:54:06,282 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 10:54:06,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 10:54:06,282 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 10:54:06,282 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:54:06,283 INFO L87 Difference]: Start difference. First operand 194 states and 226 transitions. Second operand 5 states. [2018-04-11 10:54:06,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:54:06,482 INFO L93 Difference]: Finished difference Result 278 states and 324 transitions. [2018-04-11 10:54:06,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 10:54:06,483 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-11 10:54:06,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:54:06,483 INFO L225 Difference]: With dead ends: 278 [2018-04-11 10:54:06,483 INFO L226 Difference]: Without dead ends: 278 [2018-04-11 10:54:06,484 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 10:54:06,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-04-11 10:54:06,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 193. [2018-04-11 10:54:06,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-04-11 10:54:06,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 224 transitions. [2018-04-11 10:54:06,487 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 224 transitions. Word has length 29 [2018-04-11 10:54:06,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:54:06,487 INFO L459 AbstractCegarLoop]: Abstraction has 193 states and 224 transitions. [2018-04-11 10:54:06,487 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 10:54:06,488 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 224 transitions. [2018-04-11 10:54:06,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 10:54:06,488 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:54:06,488 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 10:54:06,488 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:54:06,488 INFO L82 PathProgramCache]: Analyzing trace with hash -2057254629, now seen corresponding path program 1 times [2018-04-11 10:54:06,488 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:54:06,489 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:54:06,489 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:06,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:54:06,489 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:06,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:54:06,496 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:54:06,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:54:06,535 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:54:06,536 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 10:54:06,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 10:54:06,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 10:54:06,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:54:06,536 INFO L87 Difference]: Start difference. First operand 193 states and 224 transitions. Second operand 5 states. [2018-04-11 10:54:06,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:54:06,812 INFO L93 Difference]: Finished difference Result 342 states and 397 transitions. [2018-04-11 10:54:06,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 10:54:06,813 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-11 10:54:06,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:54:06,814 INFO L225 Difference]: With dead ends: 342 [2018-04-11 10:54:06,814 INFO L226 Difference]: Without dead ends: 342 [2018-04-11 10:54:06,814 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 10:54:06,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-04-11 10:54:06,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 192. [2018-04-11 10:54:06,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-04-11 10:54:06,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 222 transitions. [2018-04-11 10:54:06,817 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 222 transitions. Word has length 29 [2018-04-11 10:54:06,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:54:06,818 INFO L459 AbstractCegarLoop]: Abstraction has 192 states and 222 transitions. [2018-04-11 10:54:06,818 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 10:54:06,818 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 222 transitions. [2018-04-11 10:54:06,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 10:54:06,818 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:54:06,818 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:54:06,818 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:54:06,818 INFO L82 PathProgramCache]: Analyzing trace with hash 952419245, now seen corresponding path program 1 times [2018-04-11 10:54:06,819 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:54:06,819 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:54:06,819 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:06,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:54:06,819 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:06,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:54:06,828 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:54:06,851 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 10:54:06,852 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:54:06,852 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 10:54:06,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 10:54:06,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 10:54:06,852 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 10:54:06,853 INFO L87 Difference]: Start difference. First operand 192 states and 222 transitions. Second operand 4 states. [2018-04-11 10:54:06,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:54:06,929 INFO L93 Difference]: Finished difference Result 222 states and 256 transitions. [2018-04-11 10:54:06,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 10:54:06,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-04-11 10:54:06,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:54:06,930 INFO L225 Difference]: With dead ends: 222 [2018-04-11 10:54:06,930 INFO L226 Difference]: Without dead ends: 222 [2018-04-11 10:54:06,930 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 10:54:06,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-04-11 10:54:06,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 191. [2018-04-11 10:54:06,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-04-11 10:54:06,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 220 transitions. [2018-04-11 10:54:06,933 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 220 transitions. Word has length 31 [2018-04-11 10:54:06,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:54:06,934 INFO L459 AbstractCegarLoop]: Abstraction has 191 states and 220 transitions. [2018-04-11 10:54:06,934 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 10:54:06,934 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 220 transitions. [2018-04-11 10:54:06,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 10:54:06,934 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:54:06,934 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:54:06,934 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:54:06,935 INFO L82 PathProgramCache]: Analyzing trace with hash 952419246, now seen corresponding path program 1 times [2018-04-11 10:54:06,935 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:54:06,935 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:54:06,935 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:06,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:54:06,935 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:06,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:54:06,942 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:54:06,963 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 10:54:06,964 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:54:06,964 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 10:54:06,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 10:54:06,964 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 10:54:06,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 10:54:06,964 INFO L87 Difference]: Start difference. First operand 191 states and 220 transitions. Second operand 4 states. [2018-04-11 10:54:07,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:54:07,079 INFO L93 Difference]: Finished difference Result 252 states and 286 transitions. [2018-04-11 10:54:07,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 10:54:07,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-04-11 10:54:07,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:54:07,080 INFO L225 Difference]: With dead ends: 252 [2018-04-11 10:54:07,080 INFO L226 Difference]: Without dead ends: 252 [2018-04-11 10:54:07,081 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 10:54:07,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-04-11 10:54:07,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 189. [2018-04-11 10:54:07,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-04-11 10:54:07,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 216 transitions. [2018-04-11 10:54:07,084 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 216 transitions. Word has length 31 [2018-04-11 10:54:07,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:54:07,084 INFO L459 AbstractCegarLoop]: Abstraction has 189 states and 216 transitions. [2018-04-11 10:54:07,084 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 10:54:07,084 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 216 transitions. [2018-04-11 10:54:07,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 10:54:07,085 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:54:07,085 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 10:54:07,085 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:54:07,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1510720002, now seen corresponding path program 1 times [2018-04-11 10:54:07,085 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:54:07,085 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:54:07,086 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:07,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:54:07,086 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:07,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:54:07,094 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:54:07,163 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 10:54:07,164 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:54:07,164 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 10:54:07,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 10:54:07,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 10:54:07,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-11 10:54:07,164 INFO L87 Difference]: Start difference. First operand 189 states and 216 transitions. Second operand 9 states. [2018-04-11 10:54:07,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:54:07,405 INFO L93 Difference]: Finished difference Result 196 states and 225 transitions. [2018-04-11 10:54:07,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 10:54:07,405 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-04-11 10:54:07,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:54:07,406 INFO L225 Difference]: With dead ends: 196 [2018-04-11 10:54:07,406 INFO L226 Difference]: Without dead ends: 196 [2018-04-11 10:54:07,406 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-04-11 10:54:07,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-04-11 10:54:07,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 188. [2018-04-11 10:54:07,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-04-11 10:54:07,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 215 transitions. [2018-04-11 10:54:07,408 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 215 transitions. Word has length 32 [2018-04-11 10:54:07,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:54:07,408 INFO L459 AbstractCegarLoop]: Abstraction has 188 states and 215 transitions. [2018-04-11 10:54:07,408 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 10:54:07,408 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 215 transitions. [2018-04-11 10:54:07,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 10:54:07,409 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:54:07,409 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:54:07,409 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:54:07,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1510720003, now seen corresponding path program 1 times [2018-04-11 10:54:07,409 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:54:07,409 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:54:07,409 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:07,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:54:07,409 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:07,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:54:07,415 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:54:07,527 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 10:54:07,527 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:54:07,527 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 10:54:07,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 10:54:07,528 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 10:54:07,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-11 10:54:07,528 INFO L87 Difference]: Start difference. First operand 188 states and 215 transitions. Second operand 9 states. [2018-04-11 10:54:07,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:54:07,717 INFO L93 Difference]: Finished difference Result 195 states and 224 transitions. [2018-04-11 10:54:07,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 10:54:07,718 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-04-11 10:54:07,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:54:07,718 INFO L225 Difference]: With dead ends: 195 [2018-04-11 10:54:07,718 INFO L226 Difference]: Without dead ends: 195 [2018-04-11 10:54:07,718 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-04-11 10:54:07,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-04-11 10:54:07,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 187. [2018-04-11 10:54:07,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-04-11 10:54:07,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 214 transitions. [2018-04-11 10:54:07,720 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 214 transitions. Word has length 32 [2018-04-11 10:54:07,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:54:07,720 INFO L459 AbstractCegarLoop]: Abstraction has 187 states and 214 transitions. [2018-04-11 10:54:07,720 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 10:54:07,720 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 214 transitions. [2018-04-11 10:54:07,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 10:54:07,721 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:54:07,721 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 10:54:07,721 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:54:07,721 INFO L82 PathProgramCache]: Analyzing trace with hash 862110831, now seen corresponding path program 1 times [2018-04-11 10:54:07,721 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:54:07,721 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:54:07,722 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:07,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:54:07,722 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:54:07,727 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:54:07,746 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 10:54:07,746 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:54:07,746 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 10:54:07,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 10:54:07,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 10:54:07,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 10:54:07,747 INFO L87 Difference]: Start difference. First operand 187 states and 214 transitions. Second operand 4 states. [2018-04-11 10:54:07,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:54:07,805 INFO L93 Difference]: Finished difference Result 205 states and 233 transitions. [2018-04-11 10:54:07,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 10:54:07,805 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-04-11 10:54:07,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:54:07,806 INFO L225 Difference]: With dead ends: 205 [2018-04-11 10:54:07,806 INFO L226 Difference]: Without dead ends: 205 [2018-04-11 10:54:07,806 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 10:54:07,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-04-11 10:54:07,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 186. [2018-04-11 10:54:07,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-04-11 10:54:07,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 212 transitions. [2018-04-11 10:54:07,808 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 212 transitions. Word has length 33 [2018-04-11 10:54:07,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:54:07,808 INFO L459 AbstractCegarLoop]: Abstraction has 186 states and 212 transitions. [2018-04-11 10:54:07,808 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 10:54:07,808 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 212 transitions. [2018-04-11 10:54:07,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 10:54:07,809 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:54:07,809 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 10:54:07,809 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:54:07,809 INFO L82 PathProgramCache]: Analyzing trace with hash 862110832, now seen corresponding path program 1 times [2018-04-11 10:54:07,809 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:54:07,809 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:54:07,809 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:07,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:54:07,810 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:07,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:54:07,815 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:54:07,831 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 10:54:07,831 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:54:07,832 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 10:54:07,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 10:54:07,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 10:54:07,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 10:54:07,832 INFO L87 Difference]: Start difference. First operand 186 states and 212 transitions. Second operand 4 states. [2018-04-11 10:54:07,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:54:07,940 INFO L93 Difference]: Finished difference Result 230 states and 256 transitions. [2018-04-11 10:54:07,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 10:54:07,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-04-11 10:54:07,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:54:07,941 INFO L225 Difference]: With dead ends: 230 [2018-04-11 10:54:07,941 INFO L226 Difference]: Without dead ends: 230 [2018-04-11 10:54:07,942 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 10:54:07,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-04-11 10:54:07,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 184. [2018-04-11 10:54:07,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-04-11 10:54:07,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 208 transitions. [2018-04-11 10:54:07,945 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 208 transitions. Word has length 33 [2018-04-11 10:54:07,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:54:07,945 INFO L459 AbstractCegarLoop]: Abstraction has 184 states and 208 transitions. [2018-04-11 10:54:07,945 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 10:54:07,945 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 208 transitions. [2018-04-11 10:54:07,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 10:54:07,945 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:54:07,945 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] [2018-04-11 10:54:07,946 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:54:07,946 INFO L82 PathProgramCache]: Analyzing trace with hash -746127005, now seen corresponding path program 1 times [2018-04-11 10:54:07,946 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:54:07,946 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:54:07,947 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:07,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:54:07,947 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:07,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:54:07,954 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:54:07,995 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 10:54:07,995 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:54:07,995 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:54:08,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:54:08,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:54:08,033 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:54:08,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 10:54:08,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 10:54:08,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:54:08,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:54:08,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 10:54:08,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 10:54:08,091 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:54:08,092 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:54:08,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:54:08,096 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-04-11 10:54:08,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 10:54:08,108 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:54:08,112 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 10:54:08,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:54:08,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:54:08,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 10:54:08,132 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:54:08,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 10:54:08,133 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:54:08,136 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:54:08,140 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 10:54:08,140 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2018-04-11 10:54:08,152 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 10:54:08,154 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 10:54:08,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:54:08,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:54:08,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 10:54:08,160 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 10:54:08,161 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:54:08,162 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:54:08,163 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 10:54:08,164 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-04-11 10:54:08,169 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 10:54:08,189 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:54:08,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-04-11 10:54:08,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 10:54:08,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 10:54:08,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:54:08,190 INFO L87 Difference]: Start difference. First operand 184 states and 208 transitions. Second operand 5 states. [2018-04-11 10:54:08,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:54:08,253 INFO L93 Difference]: Finished difference Result 197 states and 222 transitions. [2018-04-11 10:54:08,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 10:54:08,254 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-04-11 10:54:08,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:54:08,255 INFO L225 Difference]: With dead ends: 197 [2018-04-11 10:54:08,255 INFO L226 Difference]: Without dead ends: 197 [2018-04-11 10:54:08,255 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 3 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 10:54:08,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-04-11 10:54:08,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 191. [2018-04-11 10:54:08,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-04-11 10:54:08,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 216 transitions. [2018-04-11 10:54:08,269 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 216 transitions. Word has length 36 [2018-04-11 10:54:08,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:54:08,269 INFO L459 AbstractCegarLoop]: Abstraction has 191 states and 216 transitions. [2018-04-11 10:54:08,269 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 10:54:08,269 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 216 transitions. [2018-04-11 10:54:08,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-11 10:54:08,269 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:54:08,270 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] [2018-04-11 10:54:08,270 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:54:08,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1655100458, now seen corresponding path program 1 times [2018-04-11 10:54:08,270 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:54:08,270 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:54:08,271 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:08,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:54:08,271 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:08,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:54:08,286 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:54:08,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:54:08,529 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:54:08,529 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:54:08,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:54:08,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:54:08,562 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:54:08,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (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 10:54:08,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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 10:54:08,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:54:08,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:54:08,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:54:08,711 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:47 [2018-04-11 10:54:08,788 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 50 treesize of output 42 [2018-04-11 10:54:08,841 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 42 treesize of output 35 [2018-04-11 10:54:08,843 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 10:54:08,858 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 10:54:08,879 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 2 xjuncts. [2018-04-11 10:54:08,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:56 [2018-04-11 10:54:09,093 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 10:54:09,107 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 10:54:09,135 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:54:09,136 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 24 [2018-04-11 10:54:09,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 10:54:09,136 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 10:54:09,136 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=499, Unknown=5, NotChecked=44, Total=600 [2018-04-11 10:54:09,136 INFO L87 Difference]: Start difference. First operand 191 states and 216 transitions. Second operand 25 states. [2018-04-11 10:54:10,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:54:10,315 INFO L93 Difference]: Finished difference Result 224 states and 251 transitions. [2018-04-11 10:54:10,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 10:54:10,316 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 37 [2018-04-11 10:54:10,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:54:10,316 INFO L225 Difference]: With dead ends: 224 [2018-04-11 10:54:10,316 INFO L226 Difference]: Without dead ends: 217 [2018-04-11 10:54:10,317 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=154, Invalid=1101, Unknown=9, NotChecked=68, Total=1332 [2018-04-11 10:54:10,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-04-11 10:54:10,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 209. [2018-04-11 10:54:10,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-04-11 10:54:10,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 235 transitions. [2018-04-11 10:54:10,319 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 235 transitions. Word has length 37 [2018-04-11 10:54:10,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:54:10,320 INFO L459 AbstractCegarLoop]: Abstraction has 209 states and 235 transitions. [2018-04-11 10:54:10,320 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 10:54:10,320 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 235 transitions. [2018-04-11 10:54:10,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-11 10:54:10,320 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:54:10,320 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] [2018-04-11 10:54:10,320 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:54:10,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1326396508, now seen corresponding path program 1 times [2018-04-11 10:54:10,320 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:54:10,320 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:54:10,321 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:10,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:54:10,321 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:10,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:54:10,328 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:54:10,362 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 10:54:10,362 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:54:10,363 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 10:54:10,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 10:54:10,363 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 10:54:10,363 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-11 10:54:10,363 INFO L87 Difference]: Start difference. First operand 209 states and 235 transitions. Second operand 8 states. [2018-04-11 10:54:10,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:54:10,654 INFO L93 Difference]: Finished difference Result 229 states and 256 transitions. [2018-04-11 10:54:10,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 10:54:10,654 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-04-11 10:54:10,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:54:10,655 INFO L225 Difference]: With dead ends: 229 [2018-04-11 10:54:10,655 INFO L226 Difference]: Without dead ends: 229 [2018-04-11 10:54:10,655 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-04-11 10:54:10,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-04-11 10:54:10,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 218. [2018-04-11 10:54:10,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-04-11 10:54:10,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 248 transitions. [2018-04-11 10:54:10,657 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 248 transitions. Word has length 42 [2018-04-11 10:54:10,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:54:10,657 INFO L459 AbstractCegarLoop]: Abstraction has 218 states and 248 transitions. [2018-04-11 10:54:10,657 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 10:54:10,657 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 248 transitions. [2018-04-11 10:54:10,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-11 10:54:10,658 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:54:10,658 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] [2018-04-11 10:54:10,658 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:54:10,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1326396509, now seen corresponding path program 1 times [2018-04-11 10:54:10,658 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:54:10,658 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:54:10,659 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:10,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:54:10,659 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:10,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:54:10,667 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:54:10,726 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 10:54:10,726 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:54:10,726 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 10:54:10,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 10:54:10,726 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 10:54:10,726 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:54:10,726 INFO L87 Difference]: Start difference. First operand 218 states and 248 transitions. Second operand 5 states. [2018-04-11 10:54:10,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:54:10,855 INFO L93 Difference]: Finished difference Result 282 states and 312 transitions. [2018-04-11 10:54:10,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 10:54:10,855 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-04-11 10:54:10,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:54:10,856 INFO L225 Difference]: With dead ends: 282 [2018-04-11 10:54:10,856 INFO L226 Difference]: Without dead ends: 282 [2018-04-11 10:54:10,856 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 10:54:10,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-04-11 10:54:10,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 220. [2018-04-11 10:54:10,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-04-11 10:54:10,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 248 transitions. [2018-04-11 10:54:10,859 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 248 transitions. Word has length 42 [2018-04-11 10:54:10,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:54:10,859 INFO L459 AbstractCegarLoop]: Abstraction has 220 states and 248 transitions. [2018-04-11 10:54:10,859 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 10:54:10,859 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 248 transitions. [2018-04-11 10:54:10,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-11 10:54:10,860 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:54:10,860 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] [2018-04-11 10:54:10,860 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:54:10,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1155279748, now seen corresponding path program 1 times [2018-04-11 10:54:10,860 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:54:10,860 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:54:10,860 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:10,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:54:10,861 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:10,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:54:10,867 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:54:10,901 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 10:54:10,902 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:54:10,902 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 10:54:10,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 10:54:10,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 10:54:10,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-11 10:54:10,902 INFO L87 Difference]: Start difference. First operand 220 states and 248 transitions. Second operand 7 states. [2018-04-11 10:54:11,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:54:11,241 INFO L93 Difference]: Finished difference Result 269 states and 299 transitions. [2018-04-11 10:54:11,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 10:54:11,241 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2018-04-11 10:54:11,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:54:11,242 INFO L225 Difference]: With dead ends: 269 [2018-04-11 10:54:11,242 INFO L226 Difference]: Without dead ends: 269 [2018-04-11 10:54:11,243 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-04-11 10:54:11,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-04-11 10:54:11,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 230. [2018-04-11 10:54:11,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-04-11 10:54:11,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 264 transitions. [2018-04-11 10:54:11,246 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 264 transitions. Word has length 42 [2018-04-11 10:54:11,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:54:11,246 INFO L459 AbstractCegarLoop]: Abstraction has 230 states and 264 transitions. [2018-04-11 10:54:11,247 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 10:54:11,247 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 264 transitions. [2018-04-11 10:54:11,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-11 10:54:11,248 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:54:11,248 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] [2018-04-11 10:54:11,248 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:54:11,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1155279747, now seen corresponding path program 1 times [2018-04-11 10:54:11,248 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:54:11,248 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:54:11,249 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:11,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:54:11,249 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:11,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:54:11,256 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:54:11,303 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 10:54:11,303 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:54:11,303 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 10:54:11,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 10:54:11,304 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 10:54:11,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:54:11,304 INFO L87 Difference]: Start difference. First operand 230 states and 264 transitions. Second operand 5 states. [2018-04-11 10:54:11,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:54:11,504 INFO L93 Difference]: Finished difference Result 319 states and 354 transitions. [2018-04-11 10:54:11,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 10:54:11,505 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-04-11 10:54:11,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:54:11,506 INFO L225 Difference]: With dead ends: 319 [2018-04-11 10:54:11,506 INFO L226 Difference]: Without dead ends: 319 [2018-04-11 10:54:11,506 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 10:54:11,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-04-11 10:54:11,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 221. [2018-04-11 10:54:11,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-04-11 10:54:11,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 251 transitions. [2018-04-11 10:54:11,510 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 251 transitions. Word has length 42 [2018-04-11 10:54:11,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:54:11,510 INFO L459 AbstractCegarLoop]: Abstraction has 221 states and 251 transitions. [2018-04-11 10:54:11,510 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 10:54:11,510 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 251 transitions. [2018-04-11 10:54:11,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 10:54:11,511 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:54:11,511 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] [2018-04-11 10:54:11,511 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:54:11,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1831380995, now seen corresponding path program 1 times [2018-04-11 10:54:11,511 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:54:11,511 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:54:11,512 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:11,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:54:11,512 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:11,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:54:11,519 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:54:11,538 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 10:54:11,538 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:54:11,538 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 10:54:11,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 10:54:11,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 10:54:11,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:54:11,539 INFO L87 Difference]: Start difference. First operand 221 states and 251 transitions. Second operand 5 states. [2018-04-11 10:54:11,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:54:11,587 INFO L93 Difference]: Finished difference Result 303 states and 341 transitions. [2018-04-11 10:54:11,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 10:54:11,588 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-04-11 10:54:11,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:54:11,589 INFO L225 Difference]: With dead ends: 303 [2018-04-11 10:54:11,589 INFO L226 Difference]: Without dead ends: 303 [2018-04-11 10:54:11,589 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 10:54:11,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-04-11 10:54:11,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 227. [2018-04-11 10:54:11,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-04-11 10:54:11,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 258 transitions. [2018-04-11 10:54:11,592 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 258 transitions. Word has length 43 [2018-04-11 10:54:11,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:54:11,593 INFO L459 AbstractCegarLoop]: Abstraction has 227 states and 258 transitions. [2018-04-11 10:54:11,593 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 10:54:11,593 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 258 transitions. [2018-04-11 10:54:11,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 10:54:11,593 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:54:11,593 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] [2018-04-11 10:54:11,593 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:54:11,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1453933603, now seen corresponding path program 1 times [2018-04-11 10:54:11,594 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:54:11,594 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:54:11,594 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:11,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:54:11,595 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:11,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:54:11,601 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:54:11,622 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 10:54:11,623 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:54:11,623 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 10:54:11,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 10:54:11,623 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 10:54:11,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:54:11,623 INFO L87 Difference]: Start difference. First operand 227 states and 258 transitions. Second operand 5 states. [2018-04-11 10:54:11,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:54:11,684 INFO L93 Difference]: Finished difference Result 316 states and 349 transitions. [2018-04-11 10:54:11,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 10:54:11,684 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-04-11 10:54:11,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:54:11,685 INFO L225 Difference]: With dead ends: 316 [2018-04-11 10:54:11,685 INFO L226 Difference]: Without dead ends: 316 [2018-04-11 10:54:11,686 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 10:54:11,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-04-11 10:54:11,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 221. [2018-04-11 10:54:11,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-04-11 10:54:11,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 250 transitions. [2018-04-11 10:54:11,689 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 250 transitions. Word has length 43 [2018-04-11 10:54:11,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:54:11,690 INFO L459 AbstractCegarLoop]: Abstraction has 221 states and 250 transitions. [2018-04-11 10:54:11,690 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 10:54:11,690 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 250 transitions. [2018-04-11 10:54:11,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-11 10:54:11,690 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:54:11,690 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:54:11,690 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:54:11,691 INFO L82 PathProgramCache]: Analyzing trace with hash 2140724876, now seen corresponding path program 1 times [2018-04-11 10:54:11,691 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:54:11,691 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:54:11,691 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:11,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:54:11,692 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:11,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:54:11,704 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:54:11,864 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:54:11,864 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:54:11,864 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:54:11,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:54:11,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:54:11,902 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:54:11,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (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 10:54:11,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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 10:54:11,922 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:54:11,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:54:11,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 10:54:11,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 10:54:11,933 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:54:11,935 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:54:11,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:54:11,940 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2018-04-11 10:54:11,998 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:54:11,999 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:54:12,000 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 10:54:12,000 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:54:12,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:54:12,011 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:36 [2018-04-11 10:54:12,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-04-11 10:54:12,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 10:54:12,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 10:54:12,067 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:54:12,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-04-11 10:54:12,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 10:54:12,102 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 10:54:12,113 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:54:12,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-11 10:54:12,131 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:58, output treesize:156 [2018-04-11 10:54:12,219 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:54:12,222 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 82 treesize of output 83 [2018-04-11 10:54:12,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 10:54:12,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:54:12,235 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:54:12,267 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:54:12,275 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 74 treesize of output 70 [2018-04-11 10:54:12,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 12 treesize of output 11 [2018-04-11 10:54:12,278 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:54:12,289 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:54:12,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 62 [2018-04-11 10:54:12,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 10:54:12,327 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:54:12,333 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:54:12,353 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:54:12,356 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 61 treesize of output 57 [2018-04-11 10:54:12,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 10:54:12,358 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 10:54:12,364 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:54:12,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 10:54:12,381 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:152, output treesize:120 [2018-04-11 10:54:12,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 89 [2018-04-11 10:54:12,493 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 10:54:12,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:54:12,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:54:12,537 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 105 treesize of output 95 [2018-04-11 10:54:12,540 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 10:54:12,540 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:54:12,559 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:54:12,583 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 97 treesize of output 84 [2018-04-11 10:54:12,586 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 10:54:12,586 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:54:12,594 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:54:12,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 76 [2018-04-11 10:54:12,618 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 10:54:12,618 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 10:54:12,625 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:54:12,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-11 10:54:12,652 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 9 variables, input treesize:209, output treesize:173 [2018-04-11 10:54:18,726 WARN L151 SmtUtils]: Spent 2026ms on a formula simplification. DAG size of input: 62 DAG size of output 55 [2018-04-11 10:54:18,780 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 91 [2018-04-11 10:54:18,783 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 10:54:18,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:54:18,796 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 10:54:18,796 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:54:18,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:54:18,826 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 75 treesize of output 65 [2018-04-11 10:54:18,829 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 10:54:18,829 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 10:54:18,836 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 10:54:18,836 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:54:18,841 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:54:18,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-11 10:54:18,856 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:183, output treesize:120 [2018-04-11 10:54:19,038 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 10:54:19,042 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 10:54:19,042 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:54:19,048 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 10:54:19,049 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:54:19,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:54:19,066 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 10:54:19,067 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:51, output treesize:15 [2018-04-11 10:54:19,143 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:54:19,165 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:54:19,165 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16] total 26 [2018-04-11 10:54:19,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 10:54:19,166 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 10:54:19,166 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=574, Unknown=2, NotChecked=0, Total=650 [2018-04-11 10:54:19,166 INFO L87 Difference]: Start difference. First operand 221 states and 250 transitions. Second operand 26 states. [2018-04-11 10:54:54,088 WARN L151 SmtUtils]: Spent 10083ms on a formula simplification. DAG size of input: 139 DAG size of output 57 [2018-04-11 10:55:10,240 WARN L151 SmtUtils]: Spent 10080ms on a formula simplification. DAG size of input: 125 DAG size of output 53 [2018-04-11 10:55:20,370 WARN L151 SmtUtils]: Spent 10072ms on a formula simplification. DAG size of input: 129 DAG size of output 57 [2018-04-11 10:55:36,730 WARN L151 SmtUtils]: Spent 10090ms on a formula simplification. DAG size of input: 133 DAG size of output 55 [2018-04-11 10:55:46,981 WARN L151 SmtUtils]: Spent 10175ms on a formula simplification. DAG size of input: 137 DAG size of output 60 [2018-04-11 10:55:59,148 WARN L151 SmtUtils]: Spent 12104ms on a formula simplification. DAG size of input: 142 DAG size of output 62 [2018-04-11 10:56:00,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:56:00,120 INFO L93 Difference]: Finished difference Result 344 states and 402 transitions. [2018-04-11 10:56:00,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-11 10:56:00,120 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2018-04-11 10:56:00,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:56:00,121 INFO L225 Difference]: With dead ends: 344 [2018-04-11 10:56:00,121 INFO L226 Difference]: Without dead ends: 344 [2018-04-11 10:56:00,122 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 96.1s TimeCoverageRelationStatistics Valid=786, Invalid=2859, Unknown=15, NotChecked=0, Total=3660 [2018-04-11 10:56:00,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-04-11 10:56:00,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 247. [2018-04-11 10:56:00,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-04-11 10:56:00,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 282 transitions. [2018-04-11 10:56:00,126 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 282 transitions. Word has length 48 [2018-04-11 10:56:00,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:56:00,127 INFO L459 AbstractCegarLoop]: Abstraction has 247 states and 282 transitions. [2018-04-11 10:56:00,127 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 10:56:00,127 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 282 transitions. [2018-04-11 10:56:00,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-11 10:56:00,127 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:56:00,127 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:56:00,128 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:56:00,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1839300468, now seen corresponding path program 1 times [2018-04-11 10:56:00,128 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:56:00,128 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:56:00,128 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:56:00,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:56:00,129 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:56:00,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:56:00,139 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:56:00,331 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:56:00,331 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:56:00,331 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:56:00,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:56:00,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:56:00,356 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:56:00,497 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:56:00,498 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:56:00,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 10:56:00,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:56:00,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:56:00,505 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:34 [2018-04-11 10:56:00,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 10:56:00,529 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:56:00,529 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 10:56:00,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:56:00,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:56:00,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 10:56:00,553 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:56:00,554 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 10:56:00,554 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:56:00,557 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:56:00,567 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 10:56:00,567 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:57, output treesize:46 [2018-04-11 10:56:00,616 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:56:00,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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 41 [2018-04-11 10:56:00,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 10:56:00,621 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:56:00,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:56:00,638 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:56:00,642 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 54 treesize of output 51 [2018-04-11 10:56:00,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 10:56:00,643 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:56:00,648 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:56:00,659 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 10:56:00,659 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:92, output treesize:72 [2018-04-11 10:56:00,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 80 [2018-04-11 10:56:00,761 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 10:56:00,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:56:00,769 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:56:00,785 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 55 treesize of output 48 [2018-04-11 10:56:00,787 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 10:56:00,787 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:56:00,793 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:56:00,804 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 10:56:00,804 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:116, output treesize:96 [2018-04-11 10:56:06,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 46 [2018-04-11 10:56:06,956 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 10:56:06,956 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:56:06,962 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:56:06,963 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 32 treesize of output 23 [2018-04-11 10:56:06,964 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 10:56:06,967 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 10:56:06,977 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 33 treesize of output 29 [2018-04-11 10:56:06,979 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 10:56:06,979 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 10:56:06,984 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:56:06,984 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 18 treesize of output 10 [2018-04-11 10:56:06,984 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:56:06,986 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:56:06,990 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 10:56:06,990 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:84, output treesize:7 [2018-04-11 10:56:07,003 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:56:07,023 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:56:07,023 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 29 [2018-04-11 10:56:07,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-11 10:56:07,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-11 10:56:07,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=686, Unknown=3, NotChecked=0, Total=812 [2018-04-11 10:56:07,024 INFO L87 Difference]: Start difference. First operand 247 states and 282 transitions. Second operand 29 states. [2018-04-11 10:56:46,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:56:46,425 INFO L93 Difference]: Finished difference Result 351 states and 408 transitions. [2018-04-11 10:56:46,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 10:56:46,425 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 48 [2018-04-11 10:56:46,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:56:46,426 INFO L225 Difference]: With dead ends: 351 [2018-04-11 10:56:46,426 INFO L226 Difference]: Without dead ends: 351 [2018-04-11 10:56:46,427 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 33.4s TimeCoverageRelationStatistics Valid=586, Invalid=1948, Unknown=16, NotChecked=0, Total=2550 [2018-04-11 10:56:46,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-04-11 10:56:46,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 286. [2018-04-11 10:56:46,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-04-11 10:56:46,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 331 transitions. [2018-04-11 10:56:46,429 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 331 transitions. Word has length 48 [2018-04-11 10:56:46,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:56:46,430 INFO L459 AbstractCegarLoop]: Abstraction has 286 states and 331 transitions. [2018-04-11 10:56:46,430 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-11 10:56:46,430 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 331 transitions. [2018-04-11 10:56:46,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 10:56:46,430 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:56:46,430 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] [2018-04-11 10:56:46,430 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:56:46,430 INFO L82 PathProgramCache]: Analyzing trace with hash 920609223, now seen corresponding path program 1 times [2018-04-11 10:56:46,430 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:56:46,431 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:56:46,431 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:56:46,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:56:46,431 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:56:46,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:56:46,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:56:47,003 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:56:47,003 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:56:47,003 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:56:47,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:56:47,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:56:47,028 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:56:47,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 10:56:47,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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 10:56:47,065 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:56:47,066 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:56:47,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (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 10:56:47,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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 10:56:47,073 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:56:47,074 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:56:47,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:56:47,078 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-04-11 10:56:47,091 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:56:47,092 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:56:47,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 10:56:47,093 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:56:47,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:56:47,099 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:29 [2018-04-11 10:56:47,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-04-11 10:56:47,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 10:56:47,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:56:47,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:56:47,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 21 treesize of output 22 [2018-04-11 10:56:47,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 10:56:47,184 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:56:47,193 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:56:47,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:56:47,201 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:54, output treesize:46 [2018-04-11 10:56:47,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-04-11 10:56:47,234 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:56:47,236 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 10:56:47,236 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:56:47,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:56:47,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 33 [2018-04-11 10:56:47,257 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:56:47,258 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 10:56:47,258 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:56:47,264 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:56:47,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:56:47,276 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:65, output treesize:66 [2018-04-11 10:56:47,732 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:56:47,732 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:56:47,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 70 [2018-04-11 10:56:47,736 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:56:47,736 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:56:47,736 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:56:47,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 36 [2018-04-11 10:56:47,738 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 10:56:47,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 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 10:56:47,749 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 10:56:47,754 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 10:56:47,768 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 43 treesize of output 35 [2018-04-11 10:56:47,772 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:56:47,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-11 10:56:47,773 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 10:56:47,778 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:56:47,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-11 10:56:47,779 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:56:47,781 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:56:47,782 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 40 treesize of output 32 [2018-04-11 10:56:47,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 10:56:47,787 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-11 10:56:47,794 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:56:47,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-11 10:56:47,794 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 10:56:47,798 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:56:47,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-11 10:56:47,809 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:95, output treesize:34 [2018-04-11 10:56:47,863 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 10:56:47,881 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-11 10:56:47,881 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [25] total 37 [2018-04-11 10:56:47,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-11 10:56:47,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-11 10:56:47,882 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1208, Unknown=8, NotChecked=0, Total=1332 [2018-04-11 10:56:47,882 INFO L87 Difference]: Start difference. First operand 286 states and 331 transitions. Second operand 37 states. [2018-04-11 10:56:51,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:56:51,248 INFO L93 Difference]: Finished difference Result 320 states and 368 transitions. [2018-04-11 10:56:51,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 10:56:51,263 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 49 [2018-04-11 10:56:51,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:56:51,264 INFO L225 Difference]: With dead ends: 320 [2018-04-11 10:56:51,264 INFO L226 Difference]: Without dead ends: 311 [2018-04-11 10:56:51,265 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=503, Invalid=3020, Unknown=17, NotChecked=0, Total=3540 [2018-04-11 10:56:51,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-04-11 10:56:51,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 284. [2018-04-11 10:56:51,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-04-11 10:56:51,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 328 transitions. [2018-04-11 10:56:51,268 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 328 transitions. Word has length 49 [2018-04-11 10:56:51,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:56:51,268 INFO L459 AbstractCegarLoop]: Abstraction has 284 states and 328 transitions. [2018-04-11 10:56:51,268 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-11 10:56:51,268 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 328 transitions. [2018-04-11 10:56:51,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 10:56:51,269 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:56:51,269 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] [2018-04-11 10:56:51,269 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:56:51,269 INFO L82 PathProgramCache]: Analyzing trace with hash -2072224345, now seen corresponding path program 1 times [2018-04-11 10:56:51,269 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:56:51,269 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:56:51,270 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:56:51,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:56:51,270 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:56:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:56:51,286 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:56:51,796 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:56:51,796 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:56:51,796 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:56:51,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:56:51,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:56:51,819 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:56:51,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 10:56:51,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 10:56:51,830 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:56:51,832 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:56:51,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 10:56:51,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 10:56:51,840 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:56:51,841 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:56:51,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:56:51,846 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2018-04-11 10:56:51,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 10:56:51,851 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:56:51,852 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 10:56:51,852 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:56:51,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:56:51,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 10:56:51,875 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:56:51,876 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 10:56:51,876 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:56:51,887 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:56:51,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:56:51,899 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2018-04-11 10:56:51,931 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:56:51,932 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:56:51,932 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 10:56:51,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:56:51,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:56:51,940 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:43 [2018-04-11 10:56:51,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-04-11 10:56:51,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 10:56:51,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:56:51,997 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:56:52,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-04-11 10:56:52,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 10:56:52,011 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:56:52,015 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:56:52,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:56:52,025 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:68, output treesize:60 [2018-04-11 10:56:52,058 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 35 treesize of output 34 [2018-04-11 10:56:52,060 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:56:52,061 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 10:56:52,061 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:56:52,067 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:56:52,082 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 35 treesize of output 34 [2018-04-11 10:56:52,084 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:56:52,085 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 10:56:52,085 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:56:52,090 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:56:52,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:56:52,100 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:79, output treesize:92 [2018-04-11 10:56:52,539 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:56:52,539 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:56:52,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 82 [2018-04-11 10:56:52,543 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:56:52,543 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:56:52,544 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:56:52,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 41 [2018-04-11 10:56:52,546 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 10:56:52,562 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 2 case distinctions, treesize of input 16 treesize of output 17 [2018-04-11 10:56:52,562 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 10:56:52,570 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 10:56:52,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 45 treesize of output 35 [2018-04-11 10:56:52,595 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 2 case distinctions, treesize of input 16 treesize of output 17 [2018-04-11 10:56:52,595 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-11 10:56:52,602 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:56:52,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-11 10:56:52,603 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:56:52,608 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:56:52,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2018-04-11 10:56:52,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-04-11 10:56:52,612 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 10:56:52,617 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:56:52,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-11 10:56:52,618 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 10:56:52,621 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:56:52,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-11 10:56:52,634 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:117, output treesize:38 [2018-04-11 10:56:52,696 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 10:56:52,714 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-11 10:56:52,714 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [22] total 33 [2018-04-11 10:56:52,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-11 10:56:52,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-11 10:56:52,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=972, Unknown=1, NotChecked=0, Total=1056 [2018-04-11 10:56:52,715 INFO L87 Difference]: Start difference. First operand 284 states and 328 transitions. Second operand 33 states. [2018-04-11 10:56:56,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:56:56,296 INFO L93 Difference]: Finished difference Result 307 states and 352 transitions. [2018-04-11 10:56:56,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 10:56:56,397 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 49 [2018-04-11 10:56:56,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:56:56,397 INFO L225 Difference]: With dead ends: 307 [2018-04-11 10:56:56,397 INFO L226 Difference]: Without dead ends: 275 [2018-04-11 10:56:56,398 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=354, Invalid=2399, Unknown=3, NotChecked=0, Total=2756 [2018-04-11 10:56:56,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-04-11 10:56:56,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 268. [2018-04-11 10:56:56,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-04-11 10:56:56,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 311 transitions. [2018-04-11 10:56:56,400 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 311 transitions. Word has length 49 [2018-04-11 10:56:56,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:56:56,400 INFO L459 AbstractCegarLoop]: Abstraction has 268 states and 311 transitions. [2018-04-11 10:56:56,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-11 10:56:56,400 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 311 transitions. [2018-04-11 10:56:56,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-11 10:56:56,400 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:56:56,400 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:56:56,400 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:56:56,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1631945112, now seen corresponding path program 1 times [2018-04-11 10:56:56,401 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:56:56,401 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:56:56,401 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:56:56,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:56:56,401 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:56:56,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:56:56,410 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:56:56,655 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:56:56,655 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:56:56,656 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:56:56,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:56:56,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:56:56,686 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:56:56,725 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:56:56,726 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:56:56,726 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 10:56:56,727 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:56:56,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:56:56,733 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-11 10:56:56,752 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 10:56:56,762 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 10:56:56,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:56:56,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:56:56,771 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 10:56:56,771 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:36 [2018-04-11 10:56:56,813 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:56:56,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 52 [2018-04-11 10:56:56,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 10:56:56,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:56:56,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:56:56,833 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 10:56:56,833 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:49 [2018-04-11 10:56:56,881 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 10:56:56,884 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 10:56:56,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:56:56,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:56:56,897 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 10:56:56,897 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:58 [2018-04-11 10:57:02,951 WARN L151 SmtUtils]: Spent 2012ms on a formula simplification. DAG size of input: 28 DAG size of output 24 [2018-04-11 10:57:05,024 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 46 treesize of output 39 [2018-04-11 10:57:05,026 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 10:57:05,026 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:57:05,032 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:57:05,033 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 25 treesize of output 17 [2018-04-11 10:57:05,033 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:57:05,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:57:05,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:57:05,044 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:60, output treesize:15 [2018-04-11 10:57:05,107 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:57:05,124 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:57:05,124 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 27 [2018-04-11 10:57:05,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 10:57:05,124 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 10:57:05,125 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=631, Unknown=3, NotChecked=0, Total=756 [2018-04-11 10:57:05,125 INFO L87 Difference]: Start difference. First operand 268 states and 311 transitions. Second operand 28 states. Received shutdown request... [2018-04-11 10:57:33,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 10:57:33,506 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 10:57:33,509 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 10:57:33,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 10:57:33 BoogieIcfgContainer [2018-04-11 10:57:33,509 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 10:57:33,510 INFO L168 Benchmark]: Toolchain (without parser) took 212789.91 ms. Allocated memory was 403.7 MB in the beginning and 829.4 MB in the end (delta: 425.7 MB). Free memory was 338.7 MB in the beginning and 517.5 MB in the end (delta: -178.8 MB). Peak memory consumption was 246.9 MB. Max. memory is 5.3 GB. [2018-04-11 10:57:33,511 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 403.7 MB. Free memory is still 364.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 10:57:33,511 INFO L168 Benchmark]: CACSL2BoogieTranslator took 236.78 ms. Allocated memory is still 403.7 MB. Free memory was 338.7 MB in the beginning and 313.4 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 5.3 GB. [2018-04-11 10:57:33,511 INFO L168 Benchmark]: Boogie Preprocessor took 39.03 ms. Allocated memory is still 403.7 MB. Free memory was 313.4 MB in the beginning and 310.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-11 10:57:33,512 INFO L168 Benchmark]: RCFGBuilder took 623.96 ms. Allocated memory was 403.7 MB in the beginning and 618.7 MB in the end (delta: 215.0 MB). Free memory was 310.7 MB in the beginning and 533.4 MB in the end (delta: -222.7 MB). Peak memory consumption was 23.6 MB. Max. memory is 5.3 GB. [2018-04-11 10:57:33,512 INFO L168 Benchmark]: TraceAbstraction took 211887.11 ms. Allocated memory was 618.7 MB in the beginning and 829.4 MB in the end (delta: 210.8 MB). Free memory was 533.4 MB in the beginning and 517.5 MB in the end (delta: 15.9 MB). Peak memory consumption was 226.7 MB. Max. memory is 5.3 GB. [2018-04-11 10:57:33,512 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.09 ms. Allocated memory is still 403.7 MB. Free memory is still 364.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 236.78 ms. Allocated memory is still 403.7 MB. Free memory was 338.7 MB in the beginning and 313.4 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.03 ms. Allocated memory is still 403.7 MB. Free memory was 313.4 MB in the beginning and 310.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 623.96 ms. Allocated memory was 403.7 MB in the beginning and 618.7 MB in the end (delta: 215.0 MB). Free memory was 310.7 MB in the beginning and 533.4 MB in the end (delta: -222.7 MB). Peak memory consumption was 23.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 211887.11 ms. Allocated memory was 618.7 MB in the beginning and 829.4 MB in the end (delta: 210.8 MB). Free memory was 533.4 MB in the beginning and 517.5 MB in the end (delta: 15.9 MB). Peak memory consumption was 226.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 646]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 666]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 654]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 660]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 631]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 669]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 641]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 662]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 672]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 672). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 634]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 666]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 658]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 668]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 668). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 645]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 658]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 634]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 659]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 659). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 653]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 634]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 653]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 669]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 669]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 657]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 668]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 668). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 672]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 672). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 620]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 620). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 662]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 654]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 645]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 631]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 646]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 669]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 659]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 659). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 634]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 660]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 641]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 657]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was constructing difference of abstraction (268states) and interpolant automaton (currently 12 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 151 locations, 65 error locations. TIMEOUT Result, 211.8s OverallTime, 38 OverallIterations, 3 TraceHistogramMax, 182.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4115 SDtfs, 7736 SDslu, 13708 SDs, 0 SdLazy, 14126 SolverSat, 890 SolverUnsat, 68 SolverUnknown, 0 SolverNotchecked, 44.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 841 GetRequests, 311 SyntacticMatches, 17 SemanticMatches, 512 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3040 ImplicationChecksByTransitivity, 157.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=286occurred in iteration=35, 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, 37 MinimizatonAttempts, 1507 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 28.1s InterpolantComputationTime, 1497 NumberOfCodeBlocks, 1497 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 1452 ConstructedInterpolants, 91 QuantifiedInterpolants, 719152 SizeOfPredicates, 96 NumberOfNonLiveVariables, 1346 ConjunctsInSsa, 215 ConjunctsInUnsatCore, 45 InterpolantComputations, 33 PerfectInterpolantSequences, 79/142 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_stack_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_10-57-33-520.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_stack_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_10-57-33-520.csv Completed graceful shutdown