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 21:48:20,475 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 21:48:20,476 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 21:48:20,487 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 21:48:20,487 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 21:48:20,488 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 21:48:20,488 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 21:48:20,490 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 21:48:20,492 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 21:48:20,492 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 21:48:20,493 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 21:48:20,493 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 21:48:20,494 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 21:48:20,495 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 21:48:20,496 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 21:48:20,497 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 21:48:20,499 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 21:48:20,500 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 21:48:20,501 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 21:48:20,502 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 21:48:20,504 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 21:48:20,504 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 21:48:20,504 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 21:48:20,505 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 21:48:20,506 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 21:48:20,507 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 21:48:20,507 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 21:48:20,507 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 21:48:20,508 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 21:48:20,508 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 21:48:20,509 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 21:48:20,509 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 21:48:20,532 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 21:48:20,533 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 21:48:20,534 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 21:48:20,534 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 21:48:20,534 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 21:48:20,534 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 21:48:20,534 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 21:48:20,535 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 21:48:20,535 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 21:48:20,535 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 21:48:20,535 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 21:48:20,535 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 21:48:20,535 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 21:48:20,535 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 21:48:20,536 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 21:48:20,536 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 21:48:20,536 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 21:48:20,536 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 21:48:20,536 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 21:48:20,536 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 21:48:20,537 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 21:48:20,537 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 21:48:20,537 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 21:48:20,537 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 21:48:20,569 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 21:48:20,578 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 21:48:20,581 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 21:48:20,582 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 21:48:20,582 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 21:48:20,583 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 21:48:20,861 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG33775c10e [2018-04-11 21:48:21,035 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 21:48:21,035 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 21:48:21,036 INFO L168 CDTParser]: Scanning tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 21:48:21,043 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 21:48:21,043 INFO L215 ultiparseSymbolTable]: [2018-04-11 21:48:21,043 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 21:48:21,043 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 21:48:21,043 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 21:48:21,043 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 21:48:21,043 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 21:48:21,043 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 21:48:21,044 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 21:48:21,044 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 21:48:21,044 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 21:48:21,044 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 21:48:21,044 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 21:48:21,044 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 21:48:21,044 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 21:48:21,044 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 21:48:21,044 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 21:48:21,044 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 21:48:21,044 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 21:48:21,044 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 21:48:21,044 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 21:48:21,044 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 21:48:21,045 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 21:48:21,045 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 21:48:21,045 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 21:48:21,045 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 21:48:21,045 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 21:48:21,045 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 21:48:21,045 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 21:48:21,045 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 21:48:21,045 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 21:48:21,045 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 21:48:21,045 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 21:48:21,045 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 21:48:21,045 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 21:48:21,045 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 21:48:21,046 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 21:48:21,046 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 21:48:21,046 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 21:48:21,046 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 21:48:21,046 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 21:48:21,046 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 21:48:21,046 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 21:48:21,046 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 21:48:21,046 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 21:48:21,046 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 21:48:21,046 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 21:48:21,047 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 21:48:21,047 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 21:48:21,047 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 21:48:21,047 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 21:48:21,047 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 21:48:21,047 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 21:48:21,047 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 21:48:21,047 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 21:48:21,047 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 21:48:21,047 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 21:48:21,047 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 21:48:21,047 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 21:48:21,047 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 21:48:21,047 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 21:48:21,048 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 21:48:21,048 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 21:48:21,048 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 21:48:21,048 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 21:48:21,048 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 21:48:21,048 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 21:48:21,048 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 21:48:21,048 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 21:48:21,048 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 21:48:21,048 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 21:48:21,048 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 21:48:21,049 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 21:48:21,049 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 21:48:21,049 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 21:48:21,049 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 21:48:21,049 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 21:48:21,049 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 21:48:21,049 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 21:48:21,049 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 21:48:21,049 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 21:48:21,049 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 21:48:21,049 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 21:48:21,050 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 21:48:21,050 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 21:48:21,050 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 21:48:21,050 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 21:48:21,050 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 21:48:21,050 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 21:48:21,050 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 21:48:21,050 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 21:48:21,050 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 21:48:21,050 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 21:48:21,050 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 21:48:21,050 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 21:48:21,051 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 21:48:21,051 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 21:48:21,051 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 21:48:21,051 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 21:48:21,051 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 21:48:21,051 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 21:48:21,051 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 21:48:21,051 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 21:48:21,051 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 21:48:21,051 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 21:48:21,051 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 21:48:21,051 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 21:48:21,051 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 21:48:21,051 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 21:48:21,051 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 21:48:21,051 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 21:48:21,051 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 21:48:21,052 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 21:48:21,052 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 21:48:21,052 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 21:48:21,052 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 21:48:21,052 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 21:48:21,052 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 21:48:21,052 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 21:48:21,052 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 21:48:21,052 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 21:48:21,052 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 21:48:21,052 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 21:48:21,065 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG33775c10e [2018-04-11 21:48:21,068 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 21:48:21,069 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 21:48:21,070 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 21:48:21,070 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 21:48:21,074 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 21:48:21,074 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 09:48:21" (1/1) ... [2018-04-11 21:48:21,076 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@430cde96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:48:21, skipping insertion in model container [2018-04-11 21:48:21,076 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 09:48:21" (1/1) ... [2018-04-11 21:48:21,085 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 21:48:21,107 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 21:48:21,230 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 21:48:21,267 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 21:48:21,273 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 110 non ball SCCs. Number of states in SCCs 110. [2018-04-11 21:48:21,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:48:21 WrapperNode [2018-04-11 21:48:21,301 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 21:48:21,302 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 21:48:21,302 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 21:48:21,302 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 21:48:21,310 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:48:21" (1/1) ... [2018-04-11 21:48:21,310 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:48:21" (1/1) ... [2018-04-11 21:48:21,322 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:48:21" (1/1) ... [2018-04-11 21:48:21,322 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:48:21" (1/1) ... [2018-04-11 21:48:21,331 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:48:21" (1/1) ... [2018-04-11 21:48:21,336 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:48:21" (1/1) ... [2018-04-11 21:48:21,338 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:48:21" (1/1) ... [2018-04-11 21:48:21,342 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 21:48:21,343 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 21:48:21,343 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 21:48:21,343 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 21:48:21,344 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:48:21" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 21:48:21,435 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 21:48:21,435 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 21:48:21,435 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 21:48:21,435 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 21:48:21,436 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-11 21:48:21,436 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 21:48:21,436 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 21:48:21,436 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 21:48:21,436 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 21:48:21,436 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 21:48:21,436 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 21:48:21,436 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 21:48:21,436 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 21:48:21,436 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 21:48:21,437 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 21:48:21,437 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 21:48:21,437 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 21:48:21,437 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 21:48:21,437 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 21:48:21,437 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 21:48:21,437 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 21:48:21,437 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 21:48:21,437 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 21:48:21,437 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 21:48:21,438 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 21:48:21,438 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 21:48:21,438 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 21:48:21,438 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 21:48:21,438 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 21:48:21,438 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 21:48:21,438 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 21:48:21,438 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 21:48:21,438 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 21:48:21,438 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 21:48:21,438 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 21:48:21,439 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 21:48:21,439 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 21:48:21,439 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 21:48:21,439 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 21:48:21,439 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 21:48:21,439 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 21:48:21,439 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 21:48:21,439 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 21:48:21,439 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 21:48:21,439 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 21:48:21,440 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 21:48:21,440 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 21:48:21,440 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 21:48:21,440 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 21:48:21,440 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 21:48:21,440 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 21:48:21,440 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 21:48:21,440 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 21:48:21,440 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 21:48:21,441 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 21:48:21,441 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 21:48:21,441 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 21:48:21,441 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 21:48:21,441 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 21:48:21,441 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 21:48:21,441 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 21:48:21,441 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 21:48:21,441 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 21:48:21,441 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 21:48:21,442 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 21:48:21,442 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 21:48:21,442 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 21:48:21,442 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 21:48:21,442 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 21:48:21,442 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-11 21:48:21,442 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 21:48:21,442 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 21:48:21,442 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 21:48:21,442 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 21:48:21,442 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 21:48:21,442 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 21:48:21,442 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 21:48:21,443 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 21:48:21,443 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 21:48:21,443 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 21:48:21,443 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 21:48:21,443 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 21:48:21,443 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 21:48:21,443 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 21:48:21,443 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 21:48:21,443 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 21:48:21,443 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 21:48:21,443 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 21:48:21,443 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 21:48:21,443 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 21:48:21,443 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 21:48:21,443 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 21:48:21,443 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 21:48:21,443 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 21:48:21,443 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 21:48:21,443 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 21:48:21,443 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 21:48:21,444 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 21:48:21,444 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 21:48:21,444 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 21:48:21,444 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 21:48:21,444 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 21:48:21,444 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 21:48:21,444 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 21:48:21,444 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 21:48:21,444 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 21:48:21,444 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 21:48:21,444 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 21:48:21,445 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-11 21:48:21,445 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-11 21:48:21,445 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 21:48:21,445 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 21:48:21,445 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 21:48:21,847 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 21:48:21,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 09:48:21 BoogieIcfgContainer [2018-04-11 21:48:21,848 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 21:48:21,849 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 21:48:21,849 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 21:48:21,852 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 21:48:21,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 09:48:21" (1/3) ... [2018-04-11 21:48:21,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@505fd1fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 09:48:21, skipping insertion in model container [2018-04-11 21:48:21,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:48:21" (2/3) ... [2018-04-11 21:48:21,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@505fd1fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 09:48:21, skipping insertion in model container [2018-04-11 21:48:21,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 09:48:21" (3/3) ... [2018-04-11 21:48:21,855 INFO L107 eAbstractionObserver]: Analyzing ICFG tree_stack_true-valid-memsafety_false-termination.i [2018-04-11 21:48:21,864 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 21:48:21,871 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 65 error locations. [2018-04-11 21:48:21,906 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 21:48:21,907 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 21:48:21,907 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 21:48:21,907 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 21:48:21,907 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 21:48:21,908 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 21:48:21,908 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 21:48:21,908 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 21:48:21,908 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 21:48:21,908 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 21:48:21,921 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2018-04-11 21:48:21,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-11 21:48:21,929 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:48:21,929 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:48:21,929 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 21:48:21,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1341836454, now seen corresponding path program 1 times [2018-04-11 21:48:21,933 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:48:21,934 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:48:21,961 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:21,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:21,961 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:21,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:21,993 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:48:22,042 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 21:48:22,043 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:48:22,043 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 21:48:22,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 21:48:22,052 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 21:48:22,053 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 21:48:22,054 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 4 states. [2018-04-11 21:48:22,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:48:22,211 INFO L93 Difference]: Finished difference Result 168 states and 179 transitions. [2018-04-11 21:48:22,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 21:48:22,213 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-11 21:48:22,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:48:22,221 INFO L225 Difference]: With dead ends: 168 [2018-04-11 21:48:22,222 INFO L226 Difference]: Without dead ends: 164 [2018-04-11 21:48:22,223 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 21:48:22,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-04-11 21:48:22,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 146. [2018-04-11 21:48:22,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-04-11 21:48:22,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 156 transitions. [2018-04-11 21:48:22,260 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 156 transitions. Word has length 8 [2018-04-11 21:48:22,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:48:22,261 INFO L459 AbstractCegarLoop]: Abstraction has 146 states and 156 transitions. [2018-04-11 21:48:22,261 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 21:48:22,261 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 156 transitions. [2018-04-11 21:48:22,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-11 21:48:22,261 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:48:22,262 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:48:22,262 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 21:48:22,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1341836455, now seen corresponding path program 1 times [2018-04-11 21:48:22,262 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:48:22,262 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:48:22,263 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:22,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:22,263 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:22,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:22,275 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:48:22,310 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 21:48:22,310 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:48:22,310 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 21:48:22,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 21:48:22,311 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 21:48:22,312 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 21:48:22,312 INFO L87 Difference]: Start difference. First operand 146 states and 156 transitions. Second operand 4 states. [2018-04-11 21:48:22,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:48:22,437 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2018-04-11 21:48:22,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 21:48:22,437 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-11 21:48:22,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:48:22,438 INFO L225 Difference]: With dead ends: 144 [2018-04-11 21:48:22,438 INFO L226 Difference]: Without dead ends: 144 [2018-04-11 21:48:22,439 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 21:48:22,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-04-11 21:48:22,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-04-11 21:48:22,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-04-11 21:48:22,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 154 transitions. [2018-04-11 21:48:22,447 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 154 transitions. Word has length 8 [2018-04-11 21:48:22,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:48:22,447 INFO L459 AbstractCegarLoop]: Abstraction has 144 states and 154 transitions. [2018-04-11 21:48:22,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 21:48:22,447 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 154 transitions. [2018-04-11 21:48:22,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-11 21:48:22,448 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:48:22,448 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:48:22,448 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 21:48:22,448 INFO L82 PathProgramCache]: Analyzing trace with hash -2000274829, now seen corresponding path program 1 times [2018-04-11 21:48:22,448 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:48:22,448 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:48:22,449 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:22,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:22,449 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:22,461 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:48:22,481 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 21:48:22,481 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:48:22,481 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 21:48:22,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 21:48:22,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 21:48:22,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 21:48:22,482 INFO L87 Difference]: Start difference. First operand 144 states and 154 transitions. Second operand 4 states. [2018-04-11 21:48:22,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:48:22,593 INFO L93 Difference]: Finished difference Result 154 states and 165 transitions. [2018-04-11 21:48:22,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 21:48:22,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-04-11 21:48:22,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:48:22,595 INFO L225 Difference]: With dead ends: 154 [2018-04-11 21:48:22,595 INFO L226 Difference]: Without dead ends: 154 [2018-04-11 21:48:22,595 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 21:48:22,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-04-11 21:48:22,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 131. [2018-04-11 21:48:22,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-04-11 21:48:22,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 142 transitions. [2018-04-11 21:48:22,601 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 142 transitions. Word has length 14 [2018-04-11 21:48:22,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:48:22,602 INFO L459 AbstractCegarLoop]: Abstraction has 131 states and 142 transitions. [2018-04-11 21:48:22,602 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 21:48:22,602 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 142 transitions. [2018-04-11 21:48:22,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-11 21:48:22,602 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:48:22,602 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:48:22,603 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 21:48:22,603 INFO L82 PathProgramCache]: Analyzing trace with hash -2000274828, now seen corresponding path program 1 times [2018-04-11 21:48:22,603 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:48:22,603 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:48:22,603 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:22,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:22,604 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:22,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:22,612 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:48:22,653 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 21:48:22,653 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:48:22,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 21:48:22,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 21:48:22,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 21:48:22,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 21:48:22,653 INFO L87 Difference]: Start difference. First operand 131 states and 142 transitions. Second operand 5 states. [2018-04-11 21:48:22,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:48:22,784 INFO L93 Difference]: Finished difference Result 177 states and 195 transitions. [2018-04-11 21:48:22,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 21:48:22,784 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-04-11 21:48:22,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:48:22,786 INFO L225 Difference]: With dead ends: 177 [2018-04-11 21:48:22,786 INFO L226 Difference]: Without dead ends: 177 [2018-04-11 21:48:22,787 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 21:48:22,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-04-11 21:48:22,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 161. [2018-04-11 21:48:22,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-04-11 21:48:22,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 184 transitions. [2018-04-11 21:48:22,795 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 184 transitions. Word has length 14 [2018-04-11 21:48:22,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:48:22,795 INFO L459 AbstractCegarLoop]: Abstraction has 161 states and 184 transitions. [2018-04-11 21:48:22,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 21:48:22,796 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 184 transitions. [2018-04-11 21:48:22,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-11 21:48:22,796 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:48:22,796 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:48:22,796 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 21:48:22,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1882745265, now seen corresponding path program 1 times [2018-04-11 21:48:22,797 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:48:22,797 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:48:22,797 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:22,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:22,798 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:22,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:22,807 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:48:22,838 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 21:48:22,838 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:48:22,838 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 21:48:22,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 21:48:22,839 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 21:48:22,839 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 21:48:22,839 INFO L87 Difference]: Start difference. First operand 161 states and 184 transitions. Second operand 4 states. [2018-04-11 21:48:22,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:48:22,908 INFO L93 Difference]: Finished difference Result 176 states and 199 transitions. [2018-04-11 21:48:22,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 21:48:22,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-04-11 21:48:22,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:48:22,909 INFO L225 Difference]: With dead ends: 176 [2018-04-11 21:48:22,909 INFO L226 Difference]: Without dead ends: 176 [2018-04-11 21:48:22,909 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 21:48:22,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-04-11 21:48:22,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 162. [2018-04-11 21:48:22,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-04-11 21:48:22,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 187 transitions. [2018-04-11 21:48:22,913 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 187 transitions. Word has length 16 [2018-04-11 21:48:22,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:48:22,913 INFO L459 AbstractCegarLoop]: Abstraction has 162 states and 187 transitions. [2018-04-11 21:48:22,913 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 21:48:22,913 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 187 transitions. [2018-04-11 21:48:22,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-11 21:48:22,913 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:48:22,914 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:48:22,914 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 21:48:22,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1882745266, now seen corresponding path program 1 times [2018-04-11 21:48:22,914 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:48:22,914 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:48:22,914 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:22,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:22,914 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:22,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:22,921 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:48:22,945 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 21:48:22,945 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:48:22,946 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 21:48:22,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 21:48:22,946 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 21:48:22,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 21:48:22,946 INFO L87 Difference]: Start difference. First operand 162 states and 187 transitions. Second operand 4 states. [2018-04-11 21:48:23,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:48:23,023 INFO L93 Difference]: Finished difference Result 164 states and 187 transitions. [2018-04-11 21:48:23,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 21:48:23,023 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-04-11 21:48:23,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:48:23,024 INFO L225 Difference]: With dead ends: 164 [2018-04-11 21:48:23,024 INFO L226 Difference]: Without dead ends: 164 [2018-04-11 21:48:23,024 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 21:48:23,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-04-11 21:48:23,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 160. [2018-04-11 21:48:23,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-04-11 21:48:23,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 184 transitions. [2018-04-11 21:48:23,027 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 184 transitions. Word has length 16 [2018-04-11 21:48:23,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:48:23,027 INFO L459 AbstractCegarLoop]: Abstraction has 160 states and 184 transitions. [2018-04-11 21:48:23,027 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 21:48:23,027 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 184 transitions. [2018-04-11 21:48:23,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-11 21:48:23,028 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:48:23,028 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:48:23,028 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 21:48:23,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1407261537, now seen corresponding path program 1 times [2018-04-11 21:48:23,028 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:48:23,028 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:48:23,028 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:23,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:23,029 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:23,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:23,035 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:48:23,049 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 21:48:23,049 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:48:23,049 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 21:48:23,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 21:48:23,050 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 21:48:23,050 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 21:48:23,050 INFO L87 Difference]: Start difference. First operand 160 states and 184 transitions. Second operand 4 states. [2018-04-11 21:48:23,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:48:23,069 INFO L93 Difference]: Finished difference Result 161 states and 184 transitions. [2018-04-11 21:48:23,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 21:48:23,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-04-11 21:48:23,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:48:23,070 INFO L225 Difference]: With dead ends: 161 [2018-04-11 21:48:23,070 INFO L226 Difference]: Without dead ends: 161 [2018-04-11 21:48:23,070 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 21:48:23,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-04-11 21:48:23,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2018-04-11 21:48:23,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-04-11 21:48:23,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 183 transitions. [2018-04-11 21:48:23,074 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 183 transitions. Word has length 21 [2018-04-11 21:48:23,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:48:23,074 INFO L459 AbstractCegarLoop]: Abstraction has 160 states and 183 transitions. [2018-04-11 21:48:23,074 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 21:48:23,074 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 183 transitions. [2018-04-11 21:48:23,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-11 21:48:23,075 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:48:23,075 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 21:48:23,075 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 21:48:23,075 INFO L82 PathProgramCache]: Analyzing trace with hash 675431961, now seen corresponding path program 1 times [2018-04-11 21:48:23,075 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:48:23,075 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:48:23,076 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:23,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:23,076 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:23,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:23,084 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:48:23,108 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 21:48:23,108 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:48:23,109 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 21:48:23,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 21:48:23,109 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 21:48:23,109 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 21:48:23,109 INFO L87 Difference]: Start difference. First operand 160 states and 183 transitions. Second operand 5 states. [2018-04-11 21:48:23,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:48:23,191 INFO L93 Difference]: Finished difference Result 177 states and 201 transitions. [2018-04-11 21:48:23,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 21:48:23,191 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-04-11 21:48:23,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:48:23,192 INFO L225 Difference]: With dead ends: 177 [2018-04-11 21:48:23,192 INFO L226 Difference]: Without dead ends: 177 [2018-04-11 21:48:23,192 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 21:48:23,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-04-11 21:48:23,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 159. [2018-04-11 21:48:23,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-04-11 21:48:23,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 183 transitions. [2018-04-11 21:48:23,194 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 183 transitions. Word has length 22 [2018-04-11 21:48:23,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:48:23,195 INFO L459 AbstractCegarLoop]: Abstraction has 159 states and 183 transitions. [2018-04-11 21:48:23,195 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 21:48:23,195 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 183 transitions. [2018-04-11 21:48:23,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-11 21:48:23,195 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:48:23,195 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 21:48:23,195 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 21:48:23,196 INFO L82 PathProgramCache]: Analyzing trace with hash 675431962, now seen corresponding path program 1 times [2018-04-11 21:48:23,196 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:48:23,196 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:48:23,196 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:23,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:23,196 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:23,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:23,205 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:48:23,237 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 21:48:23,237 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:48:23,237 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 21:48:23,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 21:48:23,237 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 21:48:23,238 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 21:48:23,238 INFO L87 Difference]: Start difference. First operand 159 states and 183 transitions. Second operand 5 states. [2018-04-11 21:48:23,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:48:23,361 INFO L93 Difference]: Finished difference Result 183 states and 208 transitions. [2018-04-11 21:48:23,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 21:48:23,362 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-04-11 21:48:23,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:48:23,363 INFO L225 Difference]: With dead ends: 183 [2018-04-11 21:48:23,363 INFO L226 Difference]: Without dead ends: 183 [2018-04-11 21:48:23,363 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 21:48:23,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-04-11 21:48:23,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 161. [2018-04-11 21:48:23,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-04-11 21:48:23,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 184 transitions. [2018-04-11 21:48:23,365 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 184 transitions. Word has length 22 [2018-04-11 21:48:23,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:48:23,365 INFO L459 AbstractCegarLoop]: Abstraction has 161 states and 184 transitions. [2018-04-11 21:48:23,366 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 21:48:23,366 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 184 transitions. [2018-04-11 21:48:23,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-11 21:48:23,366 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:48:23,366 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 21:48:23,366 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 21:48:23,367 INFO L82 PathProgramCache]: Analyzing trace with hash -684849302, now seen corresponding path program 1 times [2018-04-11 21:48:23,367 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:48:23,367 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:48:23,368 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:23,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:23,368 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:23,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:23,375 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:48:23,396 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 21:48:23,396 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:48:23,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 21:48:23,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 21:48:23,396 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 21:48:23,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 21:48:23,397 INFO L87 Difference]: Start difference. First operand 161 states and 184 transitions. Second operand 3 states. [2018-04-11 21:48:23,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:48:23,401 INFO L93 Difference]: Finished difference Result 163 states and 186 transitions. [2018-04-11 21:48:23,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 21:48:23,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-04-11 21:48:23,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:48:23,401 INFO L225 Difference]: With dead ends: 163 [2018-04-11 21:48:23,401 INFO L226 Difference]: Without dead ends: 163 [2018-04-11 21:48:23,402 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 21:48:23,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-04-11 21:48:23,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-04-11 21:48:23,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-04-11 21:48:23,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 186 transitions. [2018-04-11 21:48:23,404 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 186 transitions. Word has length 22 [2018-04-11 21:48:23,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:48:23,404 INFO L459 AbstractCegarLoop]: Abstraction has 163 states and 186 transitions. [2018-04-11 21:48:23,404 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 21:48:23,405 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 186 transitions. [2018-04-11 21:48:23,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-11 21:48:23,405 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:48:23,405 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 21:48:23,405 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 21:48:23,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1056809095, now seen corresponding path program 1 times [2018-04-11 21:48:23,406 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:48:23,406 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:48:23,406 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:23,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:23,406 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:23,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:23,416 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:48:23,468 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 21:48:23,468 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:48:23,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 21:48:23,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 21:48:23,469 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 21:48:23,469 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 21:48:23,469 INFO L87 Difference]: Start difference. First operand 163 states and 186 transitions. Second operand 6 states. [2018-04-11 21:48:23,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:48:23,649 INFO L93 Difference]: Finished difference Result 206 states and 236 transitions. [2018-04-11 21:48:23,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 21:48:23,649 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-04-11 21:48:23,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:48:23,650 INFO L225 Difference]: With dead ends: 206 [2018-04-11 21:48:23,650 INFO L226 Difference]: Without dead ends: 206 [2018-04-11 21:48:23,650 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 21:48:23,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-04-11 21:48:23,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 179. [2018-04-11 21:48:23,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-04-11 21:48:23,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 207 transitions. [2018-04-11 21:48:23,652 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 207 transitions. Word has length 24 [2018-04-11 21:48:23,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:48:23,653 INFO L459 AbstractCegarLoop]: Abstraction has 179 states and 207 transitions. [2018-04-11 21:48:23,653 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 21:48:23,653 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 207 transitions. [2018-04-11 21:48:23,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-11 21:48:23,653 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:48:23,653 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 21:48:23,653 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 21:48:23,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1890326275, now seen corresponding path program 1 times [2018-04-11 21:48:23,653 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:48:23,653 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:48:23,654 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:23,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:23,654 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:23,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:23,659 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:48:23,677 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 21:48:23,677 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:48:23,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 21:48:23,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 21:48:23,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 21:48:23,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 21:48:23,678 INFO L87 Difference]: Start difference. First operand 179 states and 207 transitions. Second operand 5 states. [2018-04-11 21:48:23,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:48:23,873 INFO L93 Difference]: Finished difference Result 265 states and 309 transitions. [2018-04-11 21:48:23,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 21:48:23,873 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-04-11 21:48:23,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:48:23,874 INFO L225 Difference]: With dead ends: 265 [2018-04-11 21:48:23,875 INFO L226 Difference]: Without dead ends: 265 [2018-04-11 21:48:23,875 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 21:48:23,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-04-11 21:48:23,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 178. [2018-04-11 21:48:23,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-04-11 21:48:23,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 205 transitions. [2018-04-11 21:48:23,880 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 205 transitions. Word has length 25 [2018-04-11 21:48:23,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:48:23,881 INFO L459 AbstractCegarLoop]: Abstraction has 178 states and 205 transitions. [2018-04-11 21:48:23,881 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 21:48:23,881 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 205 transitions. [2018-04-11 21:48:23,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-11 21:48:23,881 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:48:23,882 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 21:48:23,882 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 21:48:23,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1890326274, now seen corresponding path program 1 times [2018-04-11 21:48:23,882 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:48:23,882 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:48:23,883 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:23,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:23,883 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:23,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:23,893 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:48:23,946 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 21:48:23,946 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:48:23,946 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 21:48:23,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 21:48:23,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 21:48:23,947 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 21:48:23,947 INFO L87 Difference]: Start difference. First operand 178 states and 205 transitions. Second operand 5 states. [2018-04-11 21:48:24,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:48:24,219 INFO L93 Difference]: Finished difference Result 310 states and 355 transitions. [2018-04-11 21:48:24,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 21:48:24,220 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-04-11 21:48:24,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:48:24,221 INFO L225 Difference]: With dead ends: 310 [2018-04-11 21:48:24,221 INFO L226 Difference]: Without dead ends: 310 [2018-04-11 21:48:24,221 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 21:48:24,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-04-11 21:48:24,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 177. [2018-04-11 21:48:24,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-04-11 21:48:24,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 203 transitions. [2018-04-11 21:48:24,225 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 203 transitions. Word has length 25 [2018-04-11 21:48:24,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:48:24,226 INFO L459 AbstractCegarLoop]: Abstraction has 177 states and 203 transitions. [2018-04-11 21:48:24,226 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 21:48:24,226 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 203 transitions. [2018-04-11 21:48:24,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-11 21:48:24,226 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:48:24,227 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 21:48:24,227 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 21:48:24,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1446644267, now seen corresponding path program 1 times [2018-04-11 21:48:24,227 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:48:24,227 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:48:24,228 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:24,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:24,228 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:24,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:24,236 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:48:24,391 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 21:48:24,391 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:48:24,392 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-11 21:48:24,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 21:48:24,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 21:48:24,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-04-11 21:48:24,392 INFO L87 Difference]: Start difference. First operand 177 states and 203 transitions. Second operand 11 states. [2018-04-11 21:48:24,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:48:24,817 INFO L93 Difference]: Finished difference Result 197 states and 226 transitions. [2018-04-11 21:48:24,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 21:48:24,817 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-04-11 21:48:24,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:48:24,818 INFO L225 Difference]: With dead ends: 197 [2018-04-11 21:48:24,818 INFO L226 Difference]: Without dead ends: 197 [2018-04-11 21:48:24,818 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 21:48:24,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-04-11 21:48:24,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 180. [2018-04-11 21:48:24,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-04-11 21:48:24,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 207 transitions. [2018-04-11 21:48:24,821 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 207 transitions. Word has length 27 [2018-04-11 21:48:24,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:48:24,821 INFO L459 AbstractCegarLoop]: Abstraction has 180 states and 207 transitions. [2018-04-11 21:48:24,821 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 21:48:24,821 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 207 transitions. [2018-04-11 21:48:24,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-11 21:48:24,821 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:48:24,821 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 21:48:24,821 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 21:48:24,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1446644268, now seen corresponding path program 1 times [2018-04-11 21:48:24,821 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:48:24,822 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:48:24,822 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:24,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:24,822 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:24,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:24,832 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:48:25,083 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 21:48:25,083 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:48:25,083 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-04-11 21:48:25,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 21:48:25,084 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 21:48:25,084 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-04-11 21:48:25,084 INFO L87 Difference]: Start difference. First operand 180 states and 207 transitions. Second operand 13 states. [2018-04-11 21:48:25,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:48:25,649 INFO L93 Difference]: Finished difference Result 246 states and 273 transitions. [2018-04-11 21:48:25,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 21:48:25,649 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-04-11 21:48:25,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:48:25,650 INFO L225 Difference]: With dead ends: 246 [2018-04-11 21:48:25,650 INFO L226 Difference]: Without dead ends: 246 [2018-04-11 21:48:25,651 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=200, Invalid=612, Unknown=0, NotChecked=0, Total=812 [2018-04-11 21:48:25,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-04-11 21:48:25,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 196. [2018-04-11 21:48:25,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-04-11 21:48:25,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 230 transitions. [2018-04-11 21:48:25,655 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 230 transitions. Word has length 27 [2018-04-11 21:48:25,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:48:25,655 INFO L459 AbstractCegarLoop]: Abstraction has 196 states and 230 transitions. [2018-04-11 21:48:25,655 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 21:48:25,655 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 230 transitions. [2018-04-11 21:48:25,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 21:48:25,656 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:48:25,656 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 21:48:25,656 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 21:48:25,656 INFO L82 PathProgramCache]: Analyzing trace with hash 901181277, now seen corresponding path program 1 times [2018-04-11 21:48:25,656 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:48:25,656 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:48:25,657 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:25,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:25,657 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:25,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:25,665 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:48:25,728 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 21:48:25,728 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:48:25,728 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 21:48:25,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 21:48:25,729 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 21:48:25,729 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-11 21:48:25,729 INFO L87 Difference]: Start difference. First operand 196 states and 230 transitions. Second operand 9 states. [2018-04-11 21:48:26,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:48:26,024 INFO L93 Difference]: Finished difference Result 233 states and 274 transitions. [2018-04-11 21:48:26,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 21:48:26,024 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-04-11 21:48:26,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:48:26,025 INFO L225 Difference]: With dead ends: 233 [2018-04-11 21:48:26,025 INFO L226 Difference]: Without dead ends: 233 [2018-04-11 21:48:26,026 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 21:48:26,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-04-11 21:48:26,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 195. [2018-04-11 21:48:26,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-04-11 21:48:26,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 228 transitions. [2018-04-11 21:48:26,030 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 228 transitions. Word has length 28 [2018-04-11 21:48:26,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:48:26,030 INFO L459 AbstractCegarLoop]: Abstraction has 195 states and 228 transitions. [2018-04-11 21:48:26,030 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 21:48:26,030 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 228 transitions. [2018-04-11 21:48:26,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 21:48:26,031 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:48:26,031 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 21:48:26,031 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 21:48:26,031 INFO L82 PathProgramCache]: Analyzing trace with hash 901181278, now seen corresponding path program 1 times [2018-04-11 21:48:26,031 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:48:26,031 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:48:26,032 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:26,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:26,032 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:26,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:26,040 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:48:26,133 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 21:48:26,133 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:48:26,133 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 21:48:26,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 21:48:26,134 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 21:48:26,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-11 21:48:26,134 INFO L87 Difference]: Start difference. First operand 195 states and 228 transitions. Second operand 9 states. [2018-04-11 21:48:26,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:48:26,411 INFO L93 Difference]: Finished difference Result 232 states and 272 transitions. [2018-04-11 21:48:26,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 21:48:26,411 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-04-11 21:48:26,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:48:26,411 INFO L225 Difference]: With dead ends: 232 [2018-04-11 21:48:26,412 INFO L226 Difference]: Without dead ends: 232 [2018-04-11 21:48:26,412 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 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 21:48:26,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-04-11 21:48:26,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 194. [2018-04-11 21:48:26,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-04-11 21:48:26,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 226 transitions. [2018-04-11 21:48:26,414 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 226 transitions. Word has length 28 [2018-04-11 21:48:26,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:48:26,414 INFO L459 AbstractCegarLoop]: Abstraction has 194 states and 226 transitions. [2018-04-11 21:48:26,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 21:48:26,414 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 226 transitions. [2018-04-11 21:48:26,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 21:48:26,415 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:48:26,415 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 21:48:26,415 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 21:48:26,415 INFO L82 PathProgramCache]: Analyzing trace with hash -2057254630, now seen corresponding path program 1 times [2018-04-11 21:48:26,415 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:48:26,415 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:48:26,415 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:26,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:26,416 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:26,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:26,421 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:48:26,480 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 21:48:26,480 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:48:26,480 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 21:48:26,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 21:48:26,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 21:48:26,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 21:48:26,481 INFO L87 Difference]: Start difference. First operand 194 states and 226 transitions. Second operand 5 states. [2018-04-11 21:48:26,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:48:26,665 INFO L93 Difference]: Finished difference Result 278 states and 324 transitions. [2018-04-11 21:48:26,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 21:48:26,666 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-11 21:48:26,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:48:26,667 INFO L225 Difference]: With dead ends: 278 [2018-04-11 21:48:26,667 INFO L226 Difference]: Without dead ends: 278 [2018-04-11 21:48:26,667 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 21:48:26,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-04-11 21:48:26,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 193. [2018-04-11 21:48:26,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-04-11 21:48:26,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 224 transitions. [2018-04-11 21:48:26,671 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 224 transitions. Word has length 29 [2018-04-11 21:48:26,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:48:26,671 INFO L459 AbstractCegarLoop]: Abstraction has 193 states and 224 transitions. [2018-04-11 21:48:26,671 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 21:48:26,671 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 224 transitions. [2018-04-11 21:48:26,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 21:48:26,671 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:48:26,671 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 21:48:26,671 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 21:48:26,672 INFO L82 PathProgramCache]: Analyzing trace with hash -2057254629, now seen corresponding path program 1 times [2018-04-11 21:48:26,672 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:48:26,672 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:48:26,672 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:26,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:26,673 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:26,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:26,679 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:48:26,709 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 21:48:26,710 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:48:26,710 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 21:48:26,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 21:48:26,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 21:48:26,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 21:48:26,710 INFO L87 Difference]: Start difference. First operand 193 states and 224 transitions. Second operand 5 states. [2018-04-11 21:48:26,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:48:26,932 INFO L93 Difference]: Finished difference Result 342 states and 397 transitions. [2018-04-11 21:48:26,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 21:48:26,932 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-11 21:48:26,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:48:26,932 INFO L225 Difference]: With dead ends: 342 [2018-04-11 21:48:26,933 INFO L226 Difference]: Without dead ends: 342 [2018-04-11 21:48:26,933 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 21:48:26,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-04-11 21:48:26,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 192. [2018-04-11 21:48:26,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-04-11 21:48:26,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 222 transitions. [2018-04-11 21:48:26,935 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 222 transitions. Word has length 29 [2018-04-11 21:48:26,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:48:26,935 INFO L459 AbstractCegarLoop]: Abstraction has 192 states and 222 transitions. [2018-04-11 21:48:26,935 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 21:48:26,935 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 222 transitions. [2018-04-11 21:48:26,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 21:48:26,935 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:48:26,936 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 21:48:26,936 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 21:48:26,936 INFO L82 PathProgramCache]: Analyzing trace with hash 952419245, now seen corresponding path program 1 times [2018-04-11 21:48:26,936 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:48:26,936 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:48:26,936 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:26,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:26,936 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:26,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:26,941 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:48:26,951 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 21:48:26,951 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:48:26,951 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 21:48:26,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 21:48:26,952 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 21:48:26,952 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 21:48:26,952 INFO L87 Difference]: Start difference. First operand 192 states and 222 transitions. Second operand 4 states. [2018-04-11 21:48:27,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:48:27,049 INFO L93 Difference]: Finished difference Result 222 states and 256 transitions. [2018-04-11 21:48:27,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 21:48:27,049 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-04-11 21:48:27,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:48:27,050 INFO L225 Difference]: With dead ends: 222 [2018-04-11 21:48:27,050 INFO L226 Difference]: Without dead ends: 222 [2018-04-11 21:48:27,050 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 21:48:27,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-04-11 21:48:27,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 191. [2018-04-11 21:48:27,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-04-11 21:48:27,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 220 transitions. [2018-04-11 21:48:27,052 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 220 transitions. Word has length 31 [2018-04-11 21:48:27,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:48:27,052 INFO L459 AbstractCegarLoop]: Abstraction has 191 states and 220 transitions. [2018-04-11 21:48:27,053 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 21:48:27,053 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 220 transitions. [2018-04-11 21:48:27,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 21:48:27,053 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:48:27,053 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 21:48:27,053 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 21:48:27,053 INFO L82 PathProgramCache]: Analyzing trace with hash 952419246, now seen corresponding path program 1 times [2018-04-11 21:48:27,054 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:48:27,054 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:48:27,054 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:27,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:27,054 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:27,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:27,062 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:48:27,085 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 21:48:27,085 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:48:27,085 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 21:48:27,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 21:48:27,086 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 21:48:27,086 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 21:48:27,086 INFO L87 Difference]: Start difference. First operand 191 states and 220 transitions. Second operand 4 states. [2018-04-11 21:48:27,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:48:27,230 INFO L93 Difference]: Finished difference Result 252 states and 286 transitions. [2018-04-11 21:48:27,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 21:48:27,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-04-11 21:48:27,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:48:27,231 INFO L225 Difference]: With dead ends: 252 [2018-04-11 21:48:27,231 INFO L226 Difference]: Without dead ends: 252 [2018-04-11 21:48:27,232 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 21:48:27,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-04-11 21:48:27,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 189. [2018-04-11 21:48:27,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-04-11 21:48:27,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 216 transitions. [2018-04-11 21:48:27,235 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 216 transitions. Word has length 31 [2018-04-11 21:48:27,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:48:27,235 INFO L459 AbstractCegarLoop]: Abstraction has 189 states and 216 transitions. [2018-04-11 21:48:27,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 21:48:27,235 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 216 transitions. [2018-04-11 21:48:27,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 21:48:27,236 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:48:27,236 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:48:27,236 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 21:48:27,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1510720002, now seen corresponding path program 1 times [2018-04-11 21:48:27,236 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:48:27,236 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:48:27,237 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:27,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:27,237 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:27,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:27,244 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:48:27,299 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 21:48:27,299 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:48:27,299 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 21:48:27,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 21:48:27,300 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 21:48:27,300 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-11 21:48:27,300 INFO L87 Difference]: Start difference. First operand 189 states and 216 transitions. Second operand 9 states. [2018-04-11 21:48:27,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:48:27,601 INFO L93 Difference]: Finished difference Result 196 states and 225 transitions. [2018-04-11 21:48:27,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 21:48:27,602 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-04-11 21:48:27,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:48:27,603 INFO L225 Difference]: With dead ends: 196 [2018-04-11 21:48:27,603 INFO L226 Difference]: Without dead ends: 196 [2018-04-11 21:48:27,603 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 21:48:27,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-04-11 21:48:27,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 188. [2018-04-11 21:48:27,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-04-11 21:48:27,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 215 transitions. [2018-04-11 21:48:27,605 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 215 transitions. Word has length 32 [2018-04-11 21:48:27,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:48:27,605 INFO L459 AbstractCegarLoop]: Abstraction has 188 states and 215 transitions. [2018-04-11 21:48:27,605 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 21:48:27,605 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 215 transitions. [2018-04-11 21:48:27,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 21:48:27,605 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:48:27,605 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 21:48:27,606 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 21:48:27,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1510720003, now seen corresponding path program 1 times [2018-04-11 21:48:27,606 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:48:27,606 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:48:27,606 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:27,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:27,606 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:27,613 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:48:27,704 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 21:48:27,704 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:48:27,704 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 21:48:27,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 21:48:27,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 21:48:27,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-11 21:48:27,704 INFO L87 Difference]: Start difference. First operand 188 states and 215 transitions. Second operand 9 states. [2018-04-11 21:48:27,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:48:27,974 INFO L93 Difference]: Finished difference Result 195 states and 224 transitions. [2018-04-11 21:48:28,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 21:48:28,063 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-04-11 21:48:28,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:48:28,063 INFO L225 Difference]: With dead ends: 195 [2018-04-11 21:48:28,063 INFO L226 Difference]: Without dead ends: 195 [2018-04-11 21:48:28,064 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 21:48:28,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-04-11 21:48:28,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 187. [2018-04-11 21:48:28,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-04-11 21:48:28,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 214 transitions. [2018-04-11 21:48:28,066 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 214 transitions. Word has length 32 [2018-04-11 21:48:28,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:48:28,066 INFO L459 AbstractCegarLoop]: Abstraction has 187 states and 214 transitions. [2018-04-11 21:48:28,066 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 21:48:28,066 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 214 transitions. [2018-04-11 21:48:28,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 21:48:28,066 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:48:28,066 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 21:48:28,066 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 21:48:28,067 INFO L82 PathProgramCache]: Analyzing trace with hash 862110831, now seen corresponding path program 1 times [2018-04-11 21:48:28,067 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:48:28,067 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:48:28,067 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:28,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:28,068 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:28,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:28,073 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:48:28,084 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 21:48:28,084 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:48:28,084 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 21:48:28,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 21:48:28,084 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 21:48:28,084 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 21:48:28,084 INFO L87 Difference]: Start difference. First operand 187 states and 214 transitions. Second operand 4 states. [2018-04-11 21:48:28,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:48:28,173 INFO L93 Difference]: Finished difference Result 205 states and 233 transitions. [2018-04-11 21:48:28,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 21:48:28,173 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-04-11 21:48:28,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:48:28,174 INFO L225 Difference]: With dead ends: 205 [2018-04-11 21:48:28,174 INFO L226 Difference]: Without dead ends: 205 [2018-04-11 21:48:28,175 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 21:48:28,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-04-11 21:48:28,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 186. [2018-04-11 21:48:28,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-04-11 21:48:28,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 212 transitions. [2018-04-11 21:48:28,178 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 212 transitions. Word has length 33 [2018-04-11 21:48:28,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:48:28,178 INFO L459 AbstractCegarLoop]: Abstraction has 186 states and 212 transitions. [2018-04-11 21:48:28,178 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 21:48:28,178 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 212 transitions. [2018-04-11 21:48:28,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 21:48:28,179 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:48:28,179 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 21:48:28,179 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 21:48:28,179 INFO L82 PathProgramCache]: Analyzing trace with hash 862110832, now seen corresponding path program 1 times [2018-04-11 21:48:28,180 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:48:28,180 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:48:28,180 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:28,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:28,180 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:28,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:28,189 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:48:28,214 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 21:48:28,214 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:48:28,214 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 21:48:28,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 21:48:28,214 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 21:48:28,214 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 21:48:28,215 INFO L87 Difference]: Start difference. First operand 186 states and 212 transitions. Second operand 4 states. [2018-04-11 21:48:28,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:48:28,337 INFO L93 Difference]: Finished difference Result 230 states and 256 transitions. [2018-04-11 21:48:28,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 21:48:28,338 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-04-11 21:48:28,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:48:28,339 INFO L225 Difference]: With dead ends: 230 [2018-04-11 21:48:28,339 INFO L226 Difference]: Without dead ends: 230 [2018-04-11 21:48:28,339 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 21:48:28,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-04-11 21:48:28,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 184. [2018-04-11 21:48:28,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-04-11 21:48:28,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 208 transitions. [2018-04-11 21:48:28,342 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 208 transitions. Word has length 33 [2018-04-11 21:48:28,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:48:28,342 INFO L459 AbstractCegarLoop]: Abstraction has 184 states and 208 transitions. [2018-04-11 21:48:28,342 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 21:48:28,342 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 208 transitions. [2018-04-11 21:48:28,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 21:48:28,343 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:48:28,343 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 21:48:28,343 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 21:48:28,343 INFO L82 PathProgramCache]: Analyzing trace with hash -746127005, now seen corresponding path program 1 times [2018-04-11 21:48:28,343 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:48:28,343 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:48:28,344 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:28,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:28,344 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:28,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:28,352 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:48:28,399 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 21:48:28,399 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 21:48:28,399 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 21:48:28,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:28,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:28,450 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:48:28,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 21:48:28,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 21:48:28,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:28,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:28,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 21:48:28,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:48:28,505 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:28,506 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:28,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:28,508 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-04-11 21:48:28,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 21:48:28,524 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:28,526 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 21:48:28,526 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:28,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:28,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 21:48:28,552 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:28,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, 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 21:48:28,554 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:28,559 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:28,567 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 21:48:28,567 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2018-04-11 21:48:28,573 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 21:48:28,576 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 21:48:28,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:28,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:28,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 21:48:28,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 21:48:28,585 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:28,587 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:28,590 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 21:48:28,590 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-04-11 21:48:28,597 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 21:48:28,630 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:48:28,630 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-04-11 21:48:28,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 21:48:28,631 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 21:48:28,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 21:48:28,631 INFO L87 Difference]: Start difference. First operand 184 states and 208 transitions. Second operand 5 states. [2018-04-11 21:48:28,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:48:28,697 INFO L93 Difference]: Finished difference Result 197 states and 222 transitions. [2018-04-11 21:48:28,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 21:48:28,697 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-04-11 21:48:28,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:48:28,698 INFO L225 Difference]: With dead ends: 197 [2018-04-11 21:48:28,698 INFO L226 Difference]: Without dead ends: 197 [2018-04-11 21:48:28,698 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 21:48:28,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-04-11 21:48:28,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 191. [2018-04-11 21:48:28,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-04-11 21:48:28,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 216 transitions. [2018-04-11 21:48:28,704 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 216 transitions. Word has length 36 [2018-04-11 21:48:28,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:48:28,704 INFO L459 AbstractCegarLoop]: Abstraction has 191 states and 216 transitions. [2018-04-11 21:48:28,704 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 21:48:28,705 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 216 transitions. [2018-04-11 21:48:28,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-11 21:48:28,705 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:48:28,705 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 21:48:28,705 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 21:48:28,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1655100458, now seen corresponding path program 1 times [2018-04-11 21:48:28,706 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:48:28,706 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:48:28,706 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:28,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:28,713 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:28,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:28,723 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:48:28,930 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 21:48:28,930 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 21:48:28,930 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 21:48:28,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:28,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:28,957 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:48:29,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (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 21:48:29,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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 21:48:29,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:29,081 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:29,086 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 21:48:29,086 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:47 [2018-04-11 21:48:29,166 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 21:48:29,176 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 21:48:29,178 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 21:48:29,194 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 21:48:29,216 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 21:48:29,216 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:56 [2018-04-11 21:48:29,440 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 21:48:29,453 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 21:48:29,482 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:48:29,483 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 24 [2018-04-11 21:48:29,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 21:48:29,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 21:48:29,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=499, Unknown=5, NotChecked=44, Total=600 [2018-04-11 21:48:29,484 INFO L87 Difference]: Start difference. First operand 191 states and 216 transitions. Second operand 25 states. [2018-04-11 21:48:30,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:48:30,838 INFO L93 Difference]: Finished difference Result 224 states and 251 transitions. [2018-04-11 21:48:30,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 21:48:30,838 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 37 [2018-04-11 21:48:30,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:48:30,839 INFO L225 Difference]: With dead ends: 224 [2018-04-11 21:48:30,839 INFO L226 Difference]: Without dead ends: 217 [2018-04-11 21:48:30,839 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=154, Invalid=1101, Unknown=9, NotChecked=68, Total=1332 [2018-04-11 21:48:30,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-04-11 21:48:30,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 209. [2018-04-11 21:48:30,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-04-11 21:48:30,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 235 transitions. [2018-04-11 21:48:30,841 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 235 transitions. Word has length 37 [2018-04-11 21:48:30,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:48:30,841 INFO L459 AbstractCegarLoop]: Abstraction has 209 states and 235 transitions. [2018-04-11 21:48:30,841 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 21:48:30,841 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 235 transitions. [2018-04-11 21:48:30,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-11 21:48:30,842 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:48:30,842 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 21:48:30,842 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 21:48:30,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1326396508, now seen corresponding path program 1 times [2018-04-11 21:48:30,842 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:48:30,842 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:48:30,843 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:30,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:30,843 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:30,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:30,849 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:48:30,882 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 21:48:30,882 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:48:30,882 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 21:48:30,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 21:48:30,883 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 21:48:30,883 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-11 21:48:30,883 INFO L87 Difference]: Start difference. First operand 209 states and 235 transitions. Second operand 8 states. [2018-04-11 21:48:31,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:48:31,101 INFO L93 Difference]: Finished difference Result 229 states and 256 transitions. [2018-04-11 21:48:31,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 21:48:31,101 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-04-11 21:48:31,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:48:31,102 INFO L225 Difference]: With dead ends: 229 [2018-04-11 21:48:31,102 INFO L226 Difference]: Without dead ends: 229 [2018-04-11 21:48:31,102 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 21:48:31,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-04-11 21:48:31,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 218. [2018-04-11 21:48:31,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-04-11 21:48:31,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 248 transitions. [2018-04-11 21:48:31,106 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 248 transitions. Word has length 42 [2018-04-11 21:48:31,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:48:31,107 INFO L459 AbstractCegarLoop]: Abstraction has 218 states and 248 transitions. [2018-04-11 21:48:31,107 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 21:48:31,107 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 248 transitions. [2018-04-11 21:48:31,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-11 21:48:31,107 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:48:31,108 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 21:48:31,108 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 21:48:31,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1326396509, now seen corresponding path program 1 times [2018-04-11 21:48:31,108 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:48:31,108 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:48:31,109 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:31,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:31,109 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:31,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:31,118 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:48:31,164 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 21:48:31,164 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:48:31,164 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 21:48:31,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 21:48:31,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 21:48:31,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 21:48:31,164 INFO L87 Difference]: Start difference. First operand 218 states and 248 transitions. Second operand 5 states. [2018-04-11 21:48:31,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:48:31,288 INFO L93 Difference]: Finished difference Result 282 states and 312 transitions. [2018-04-11 21:48:31,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 21:48:31,289 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-04-11 21:48:31,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:48:31,289 INFO L225 Difference]: With dead ends: 282 [2018-04-11 21:48:31,290 INFO L226 Difference]: Without dead ends: 282 [2018-04-11 21:48:31,290 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 21:48:31,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-04-11 21:48:31,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 220. [2018-04-11 21:48:31,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-04-11 21:48:31,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 248 transitions. [2018-04-11 21:48:31,292 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 248 transitions. Word has length 42 [2018-04-11 21:48:31,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:48:31,292 INFO L459 AbstractCegarLoop]: Abstraction has 220 states and 248 transitions. [2018-04-11 21:48:31,292 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 21:48:31,292 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 248 transitions. [2018-04-11 21:48:31,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-11 21:48:31,293 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:48:31,293 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 21:48:31,293 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 21:48:31,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1155279748, now seen corresponding path program 1 times [2018-04-11 21:48:31,293 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:48:31,293 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:48:31,293 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:31,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:31,294 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:31,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:31,299 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:48:31,344 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 21:48:31,344 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:48:31,345 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 21:48:31,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 21:48:31,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 21:48:31,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-11 21:48:31,345 INFO L87 Difference]: Start difference. First operand 220 states and 248 transitions. Second operand 7 states. [2018-04-11 21:48:31,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:48:31,676 INFO L93 Difference]: Finished difference Result 269 states and 299 transitions. [2018-04-11 21:48:31,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 21:48:31,676 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2018-04-11 21:48:31,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:48:31,677 INFO L225 Difference]: With dead ends: 269 [2018-04-11 21:48:31,678 INFO L226 Difference]: Without dead ends: 269 [2018-04-11 21:48:31,678 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 21:48:31,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-04-11 21:48:31,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 230. [2018-04-11 21:48:31,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-04-11 21:48:31,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 264 transitions. [2018-04-11 21:48:31,682 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 264 transitions. Word has length 42 [2018-04-11 21:48:31,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:48:31,682 INFO L459 AbstractCegarLoop]: Abstraction has 230 states and 264 transitions. [2018-04-11 21:48:31,682 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 21:48:31,682 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 264 transitions. [2018-04-11 21:48:31,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-11 21:48:31,683 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:48:31,683 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 21:48:31,683 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 21:48:31,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1155279747, now seen corresponding path program 1 times [2018-04-11 21:48:31,683 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:48:31,683 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:48:31,684 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:31,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:31,684 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:31,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:31,692 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:48:31,736 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 21:48:31,736 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:48:31,737 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 21:48:31,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 21:48:31,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 21:48:31,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 21:48:31,757 INFO L87 Difference]: Start difference. First operand 230 states and 264 transitions. Second operand 5 states. [2018-04-11 21:48:31,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:48:31,952 INFO L93 Difference]: Finished difference Result 319 states and 354 transitions. [2018-04-11 21:48:31,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 21:48:31,952 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-04-11 21:48:31,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:48:31,953 INFO L225 Difference]: With dead ends: 319 [2018-04-11 21:48:31,954 INFO L226 Difference]: Without dead ends: 319 [2018-04-11 21:48:31,954 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 21:48:31,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-04-11 21:48:31,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 221. [2018-04-11 21:48:31,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-04-11 21:48:31,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 251 transitions. [2018-04-11 21:48:31,958 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 251 transitions. Word has length 42 [2018-04-11 21:48:31,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:48:31,958 INFO L459 AbstractCegarLoop]: Abstraction has 221 states and 251 transitions. [2018-04-11 21:48:31,958 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 21:48:31,959 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 251 transitions. [2018-04-11 21:48:31,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 21:48:31,959 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:48:31,959 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 21:48:31,959 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 21:48:31,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1831380995, now seen corresponding path program 1 times [2018-04-11 21:48:31,960 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:48:31,960 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:48:31,960 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:31,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:31,960 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:31,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:31,968 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:48:31,987 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 21:48:31,987 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:48:31,987 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 21:48:31,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 21:48:31,988 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 21:48:31,988 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 21:48:31,988 INFO L87 Difference]: Start difference. First operand 221 states and 251 transitions. Second operand 5 states. [2018-04-11 21:48:32,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:48:32,039 INFO L93 Difference]: Finished difference Result 303 states and 341 transitions. [2018-04-11 21:48:32,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 21:48:32,039 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-04-11 21:48:32,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:48:32,041 INFO L225 Difference]: With dead ends: 303 [2018-04-11 21:48:32,041 INFO L226 Difference]: Without dead ends: 303 [2018-04-11 21:48:32,041 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 21:48:32,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-04-11 21:48:32,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 227. [2018-04-11 21:48:32,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-04-11 21:48:32,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 258 transitions. [2018-04-11 21:48:32,045 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 258 transitions. Word has length 43 [2018-04-11 21:48:32,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:48:32,045 INFO L459 AbstractCegarLoop]: Abstraction has 227 states and 258 transitions. [2018-04-11 21:48:32,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 21:48:32,045 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 258 transitions. [2018-04-11 21:48:32,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 21:48:32,046 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:48:32,046 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 21:48:32,046 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 21:48:32,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1453933603, now seen corresponding path program 1 times [2018-04-11 21:48:32,046 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:48:32,047 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:48:32,047 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:32,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:32,047 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:32,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:32,055 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:48:32,075 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 21:48:32,075 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:48:32,076 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 21:48:32,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 21:48:32,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 21:48:32,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 21:48:32,076 INFO L87 Difference]: Start difference. First operand 227 states and 258 transitions. Second operand 5 states. [2018-04-11 21:48:32,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:48:32,141 INFO L93 Difference]: Finished difference Result 316 states and 349 transitions. [2018-04-11 21:48:32,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 21:48:32,142 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-04-11 21:48:32,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:48:32,143 INFO L225 Difference]: With dead ends: 316 [2018-04-11 21:48:32,143 INFO L226 Difference]: Without dead ends: 316 [2018-04-11 21:48:32,144 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 21:48:32,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-04-11 21:48:32,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 221. [2018-04-11 21:48:32,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-04-11 21:48:32,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 250 transitions. [2018-04-11 21:48:32,148 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 250 transitions. Word has length 43 [2018-04-11 21:48:32,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:48:32,149 INFO L459 AbstractCegarLoop]: Abstraction has 221 states and 250 transitions. [2018-04-11 21:48:32,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 21:48:32,149 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 250 transitions. [2018-04-11 21:48:32,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-11 21:48:32,149 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:48:32,149 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 21:48:32,150 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 21:48:32,150 INFO L82 PathProgramCache]: Analyzing trace with hash 2140724876, now seen corresponding path program 1 times [2018-04-11 21:48:32,150 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:48:32,150 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:48:32,152 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:32,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:32,152 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:32,166 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:48:32,363 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 21:48:32,364 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 21:48:32,364 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 21:48:32,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:32,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:32,406 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:48:32,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 21:48:32,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 21:48:32,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:32,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:32,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 21:48:32,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 21:48:32,440 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:32,441 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:32,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:32,444 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2018-04-11 21:48:32,469 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:32,470 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:32,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 21:48:32,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:32,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:32,477 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:36 [2018-04-11 21:48:32,515 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 21:48:32,528 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 21:48:32,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 21:48:32,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 21:48:32,565 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 21:48:32,576 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 21:48:32,576 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 21:48:32,585 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 21:48:32,603 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 21:48:32,603 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:58, output treesize:156 [2018-04-11 21:48:32,696 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:32,699 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 21:48:32,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 21:48:32,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:32,710 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:32,749 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:32,756 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 21:48:32,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 21:48:32,761 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:32,772 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:32,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 62 [2018-04-11 21:48:32,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:48:32,806 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:32,815 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:32,836 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:32,840 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 21:48:32,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:48:32,842 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:32,848 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:32,866 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 21:48:32,866 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:152, output treesize:120 [2018-04-11 21:48:32,992 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 21:48:32,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 21:48:32,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:33,008 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:33,054 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 21:48:33,057 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 21:48:33,057 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:33,071 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:33,100 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 21:48:33,104 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 21:48:33,105 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:33,115 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:33,136 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 21:48:33,139 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 21:48:33,139 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:33,145 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:33,166 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 21:48:33,167 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 9 variables, input treesize:209, output treesize:173 [2018-04-11 21:48:39,222 WARN L151 SmtUtils]: Spent 2027ms on a formula simplification. DAG size of input: 62 DAG size of output 55 [2018-04-11 21:48:39,309 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 21:48:39,313 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 21:48:39,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:39,327 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 21:48:39,327 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:39,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:39,381 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 21:48:39,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 21:48:39,384 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:39,394 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 21:48:39,394 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:39,403 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:39,428 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 21:48:39,429 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:183, output treesize:120 [2018-04-11 21:48:39,602 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 21:48:39,604 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 21:48:39,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:39,608 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 21:48:39,609 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:39,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:39,613 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 21:48:39,613 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:51, output treesize:15 [2018-04-11 21:48:39,665 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 21:48:39,683 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:48:39,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16] total 26 [2018-04-11 21:48:39,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 21:48:39,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 21:48:39,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=574, Unknown=2, NotChecked=0, Total=650 [2018-04-11 21:48:39,684 INFO L87 Difference]: Start difference. First operand 221 states and 250 transitions. Second operand 26 states. [2018-04-11 21:49:12,213 WARN L151 SmtUtils]: Spent 10109ms on a formula simplification. DAG size of input: 139 DAG size of output 57 [2018-04-11 21:49:28,358 WARN L151 SmtUtils]: Spent 10072ms on a formula simplification. DAG size of input: 125 DAG size of output 53 [2018-04-11 21:49:38,491 WARN L151 SmtUtils]: Spent 10078ms on a formula simplification. DAG size of input: 129 DAG size of output 57 [2018-04-11 21:49:54,830 WARN L151 SmtUtils]: Spent 10070ms on a formula simplification. DAG size of input: 133 DAG size of output 55 [2018-04-11 21:50:04,990 WARN L151 SmtUtils]: Spent 10087ms on a formula simplification. DAG size of input: 137 DAG size of output 60 [2018-04-11 21:50:17,153 WARN L151 SmtUtils]: Spent 12106ms on a formula simplification. DAG size of input: 142 DAG size of output 62 [2018-04-11 21:50:18,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:50:18,009 INFO L93 Difference]: Finished difference Result 344 states and 402 transitions. [2018-04-11 21:50:18,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-11 21:50:18,009 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2018-04-11 21:50:18,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:50:18,010 INFO L225 Difference]: With dead ends: 344 [2018-04-11 21:50:18,010 INFO L226 Difference]: Without dead ends: 344 [2018-04-11 21:50:18,011 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 94.9s TimeCoverageRelationStatistics Valid=786, Invalid=2859, Unknown=15, NotChecked=0, Total=3660 [2018-04-11 21:50:18,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-04-11 21:50:18,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 247. [2018-04-11 21:50:18,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-04-11 21:50:18,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 282 transitions. [2018-04-11 21:50:18,015 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 282 transitions. Word has length 48 [2018-04-11 21:50:18,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:50:18,016 INFO L459 AbstractCegarLoop]: Abstraction has 247 states and 282 transitions. [2018-04-11 21:50:18,016 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 21:50:18,016 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 282 transitions. [2018-04-11 21:50:18,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-11 21:50:18,016 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:50:18,017 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 21:50:18,017 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 21:50:18,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1839300468, now seen corresponding path program 1 times [2018-04-11 21:50:18,017 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:50:18,017 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:50:18,018 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:50:18,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:50:18,018 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:50:18,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:50:18,033 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:50:18,264 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 21:50:18,264 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 21:50:18,264 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 21:50:18,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:50:18,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:50:18,296 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:50:18,491 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:50:18,492 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:50:18,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 21:50:18,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:50:18,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:50:18,504 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:34 [2018-04-11 21:50:18,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 21:50:18,543 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:50:18,543 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 21:50:18,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:50:18,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:50:18,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 21:50:18,564 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:50:18,566 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 21:50:18,566 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:50:18,569 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:50:18,586 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 21:50:18,587 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:57, output treesize:46 [2018-04-11 21:50:18,632 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:50:18,635 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 21:50:18,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:50:18,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:50:18,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:50:18,659 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:50:18,662 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 21:50:18,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:50:18,664 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:50:18,669 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:50:18,678 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 21:50:18,678 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:92, output treesize:72 [2018-04-11 21:50:18,753 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 21:50:18,755 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 21:50:18,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:50:18,762 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:50:18,776 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 21:50:18,788 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 21:50:18,788 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:50:18,793 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:50:18,805 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 21:50:18,805 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:116, output treesize:96 [2018-04-11 21:50:24,931 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 21:50:24,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 21:50:24,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:50:24,939 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:50:24,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2018-04-11 21:50:24,940 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 21:50:24,944 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 21:50:24,952 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 21:50:24,954 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 21:50:24,954 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 21:50:24,958 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:50:24,959 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 21:50:24,959 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 21:50:24,961 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:50:24,965 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 21:50:24,966 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:84, output treesize:7 [2018-04-11 21:50:24,978 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 21:50:24,994 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:50:24,995 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 29 [2018-04-11 21:50:24,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-11 21:50:24,995 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-11 21:50:24,995 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=686, Unknown=3, NotChecked=0, Total=812 [2018-04-11 21:50:24,995 INFO L87 Difference]: Start difference. First operand 247 states and 282 transitions. Second operand 29 states. [2018-04-11 21:51:01,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:51:01,972 INFO L93 Difference]: Finished difference Result 351 states and 408 transitions. [2018-04-11 21:51:01,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 21:51:01,973 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 48 [2018-04-11 21:51:01,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:51:01,974 INFO L225 Difference]: With dead ends: 351 [2018-04-11 21:51:01,974 INFO L226 Difference]: Without dead ends: 351 [2018-04-11 21:51:01,974 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 32.2s TimeCoverageRelationStatistics Valid=586, Invalid=1948, Unknown=16, NotChecked=0, Total=2550 [2018-04-11 21:51:01,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-04-11 21:51:01,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 286. [2018-04-11 21:51:01,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-04-11 21:51:01,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 331 transitions. [2018-04-11 21:51:01,977 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 331 transitions. Word has length 48 [2018-04-11 21:51:01,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:51:01,977 INFO L459 AbstractCegarLoop]: Abstraction has 286 states and 331 transitions. [2018-04-11 21:51:01,977 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-11 21:51:01,977 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 331 transitions. [2018-04-11 21:51:01,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 21:51:01,977 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:51:01,977 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 21:51:01,977 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 21:51:01,978 INFO L82 PathProgramCache]: Analyzing trace with hash 920609223, now seen corresponding path program 1 times [2018-04-11 21:51:01,978 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:51:01,978 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:51:01,978 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:51:01,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:51:01,978 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:51:01,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:51:01,991 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:51:02,527 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 21:51:02,527 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 21:51:02,528 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 21:51:02,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:51:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:51:02,552 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:51:02,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 21:51:02,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 21:51:02,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:02,580 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:51:02,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (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 21:51:02,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 21:51:02,586 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:02,587 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:51:02,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:51:02,590 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-04-11 21:51:02,595 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:02,596 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:02,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 21:51:02,596 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:02,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:51:02,603 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:29 [2018-04-11 21:51:02,649 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 21:51:02,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:51:02,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:02,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:51:02,665 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 21:51:02,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:51:02,667 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:02,673 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:51:02,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:51:02,680 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:54, output treesize:46 [2018-04-11 21:51:02,708 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 21:51:02,710 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:02,711 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 21:51:02,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:02,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:51:02,728 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 21:51:02,730 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:02,730 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 21:51:02,730 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:02,734 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:51:02,743 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 21:51:02,743 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:65, output treesize:66 [2018-04-11 21:51:03,129 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:03,129 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:51:03,131 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 21:51:03,134 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:03,134 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:03,135 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:51:03,136 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 21:51:03,136 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 21:51:03,150 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 21:51:03,151 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 21:51:03,156 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 21:51:03,170 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 21:51:03,171 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:03,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 21:51:03,172 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:03,177 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:03,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 21:51:03,178 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:03,181 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:51:03,182 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 21:51:03,185 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 21:51:03,186 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-11 21:51:03,191 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:03,192 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 21:51:03,192 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:03,196 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 21:51:03,207 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 21:51:03,207 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:95, output treesize:34 [2018-04-11 21:51:03,269 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 21:51:03,286 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-11 21:51:03,286 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [25] total 37 [2018-04-11 21:51:03,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-11 21:51:03,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-11 21:51:03,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1202, Unknown=14, NotChecked=0, Total=1332 [2018-04-11 21:51:03,287 INFO L87 Difference]: Start difference. First operand 286 states and 331 transitions. Second operand 37 states. [2018-04-11 21:51:06,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:51:06,429 INFO L93 Difference]: Finished difference Result 320 states and 368 transitions. [2018-04-11 21:51:06,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 21:51:06,429 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 49 [2018-04-11 21:51:06,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:51:06,430 INFO L225 Difference]: With dead ends: 320 [2018-04-11 21:51:06,430 INFO L226 Difference]: Without dead ends: 311 [2018-04-11 21:51:06,430 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=503, Invalid=3011, Unknown=26, NotChecked=0, Total=3540 [2018-04-11 21:51:06,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-04-11 21:51:06,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 284. [2018-04-11 21:51:06,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-04-11 21:51:06,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 328 transitions. [2018-04-11 21:51:06,433 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 328 transitions. Word has length 49 [2018-04-11 21:51:06,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:51:06,433 INFO L459 AbstractCegarLoop]: Abstraction has 284 states and 328 transitions. [2018-04-11 21:51:06,433 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-11 21:51:06,433 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 328 transitions. [2018-04-11 21:51:06,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 21:51:06,433 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:51:06,433 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 21:51:06,433 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 21:51:06,433 INFO L82 PathProgramCache]: Analyzing trace with hash -2072224345, now seen corresponding path program 1 times [2018-04-11 21:51:06,434 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:51:06,434 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:51:06,434 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:51:06,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:51:06,434 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:51:06,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:51:06,446 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:51:06,921 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 21:51:06,921 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 21:51:06,921 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 21:51:06,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:51:06,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:51:06,953 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:51:06,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 21:51:06,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:51:06,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:06,960 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:51:06,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 21:51:06,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:51:06,971 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:06,972 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:51:06,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:51:06,977 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2018-04-11 21:51:06,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 21:51:06,982 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:06,983 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 21:51:06,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:06,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:51:06,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 21:51:06,999 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:07,000 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 21:51:07,000 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:07,003 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:51:07,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:51:07,010 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2018-04-11 21:51:07,037 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:07,038 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:07,039 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 21:51:07,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:07,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:51:07,046 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:43 [2018-04-11 21:51:07,102 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 21:51:07,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:51:07,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:07,108 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:51:07,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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 21:51:07,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:51:07,125 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:07,129 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:51:07,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:51:07,140 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:68, output treesize:60 [2018-04-11 21:51:07,203 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 21:51:07,205 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:07,206 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 21:51:07,206 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:07,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:51:07,229 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 21:51:07,230 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:07,231 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 21:51:07,232 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:07,237 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:51:07,251 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 21:51:07,251 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:79, output treesize:92 [2018-04-11 21:51:07,684 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:07,685 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:51:07,687 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 21:51:07,691 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:07,691 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:07,692 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:51:07,693 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 21:51:07,694 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 21:51:07,720 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 21:51:07,720 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 21:51:07,729 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 21:51:07,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 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 21:51:07,757 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 21:51:07,758 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-11 21:51:07,766 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:07,767 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 21:51:07,767 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:07,774 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 21:51:07,776 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 21:51:07,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 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 21:51:07,781 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:07,786 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:07,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, 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 21:51:07,787 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:07,790 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:51:07,802 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 21:51:07,803 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:117, output treesize:38 [2018-04-11 21:51:07,870 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 21:51:07,888 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-11 21:51:07,888 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [22] total 33 [2018-04-11 21:51:07,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-11 21:51:07,888 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-11 21:51:07,888 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=973, Unknown=0, NotChecked=0, Total=1056 [2018-04-11 21:51:07,888 INFO L87 Difference]: Start difference. First operand 284 states and 328 transitions. Second operand 33 states. [2018-04-11 21:51:11,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:51:11,083 INFO L93 Difference]: Finished difference Result 307 states and 352 transitions. [2018-04-11 21:51:11,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 21:51:11,083 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 49 [2018-04-11 21:51:11,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:51:11,084 INFO L225 Difference]: With dead ends: 307 [2018-04-11 21:51:11,084 INFO L226 Difference]: Without dead ends: 275 [2018-04-11 21:51:11,084 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=354, Invalid=2401, Unknown=1, NotChecked=0, Total=2756 [2018-04-11 21:51:11,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-04-11 21:51:11,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 268. [2018-04-11 21:51:11,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-04-11 21:51:11,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 311 transitions. [2018-04-11 21:51:11,087 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 311 transitions. Word has length 49 [2018-04-11 21:51:11,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:51:11,087 INFO L459 AbstractCegarLoop]: Abstraction has 268 states and 311 transitions. [2018-04-11 21:51:11,087 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-11 21:51:11,087 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 311 transitions. [2018-04-11 21:51:11,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-11 21:51:11,087 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:51:11,088 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 21:51:11,088 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 21:51:11,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1631945112, now seen corresponding path program 1 times [2018-04-11 21:51:11,088 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:51:11,088 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:51:11,088 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:51:11,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:51:11,088 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:51:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:51:11,101 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:51:11,308 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 21:51:11,308 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 21:51:11,308 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 21:51:11,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:51:11,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:51:11,333 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:51:11,361 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:11,361 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:11,362 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 21:51:11,362 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:11,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:51:11,372 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-11 21:51:11,385 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 21:51:11,387 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 21:51:11,387 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:11,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:51:11,393 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 21:51:11,393 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:36 [2018-04-11 21:51:11,421 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:11,424 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 21:51:11,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 21:51:11,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:11,429 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:51:11,435 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 21:51:11,435 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:49 [2018-04-11 21:51:11,479 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 21:51:11,482 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 21:51:11,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:11,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:51:11,493 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 21:51:11,493 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:58 [2018-04-11 21:51:17,542 WARN L151 SmtUtils]: Spent 2019ms on a formula simplification. DAG size of input: 28 DAG size of output 24 [2018-04-11 21:51:19,620 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 21:51:19,621 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 21:51:19,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:19,627 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:51:19,627 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 21:51:19,628 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:19,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:51:19,637 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 21:51:19,637 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:60, output treesize:15 [2018-04-11 21:51:19,695 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 21:51:19,720 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:51:19,720 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 27 [2018-04-11 21:51:19,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 21:51:19,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 21:51:19,721 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=631, Unknown=3, NotChecked=0, Total=756 [2018-04-11 21:51:19,721 INFO L87 Difference]: Start difference. First operand 268 states and 311 transitions. Second operand 28 states. [2018-04-11 21:52:17,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:52:17,213 INFO L93 Difference]: Finished difference Result 681 states and 830 transitions. [2018-04-11 21:52:17,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 21:52:17,214 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 56 [2018-04-11 21:52:17,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:52:17,215 INFO L225 Difference]: With dead ends: 681 [2018-04-11 21:52:17,215 INFO L226 Difference]: Without dead ends: 681 [2018-04-11 21:52:17,215 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 53.0s TimeCoverageRelationStatistics Valid=539, Invalid=1598, Unknown=25, NotChecked=0, Total=2162 [2018-04-11 21:52:17,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2018-04-11 21:52:17,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 315. [2018-04-11 21:52:17,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-04-11 21:52:17,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 381 transitions. [2018-04-11 21:52:17,220 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 381 transitions. Word has length 56 [2018-04-11 21:52:17,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:52:17,221 INFO L459 AbstractCegarLoop]: Abstraction has 315 states and 381 transitions. [2018-04-11 21:52:17,221 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 21:52:17,221 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 381 transitions. [2018-04-11 21:52:17,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-11 21:52:17,221 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:52:17,221 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 21:52:17,222 INFO L408 AbstractCegarLoop]: === Iteration 39 === [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 21:52:17,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1631945113, now seen corresponding path program 1 times [2018-04-11 21:52:17,222 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:52:17,222 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:52:17,223 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:52:17,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:52:17,223 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:52:17,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:52:17,239 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:52:17,504 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 21:52:17,504 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 21:52:17,505 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 21:52:17,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:52:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:52:17,541 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:52:17,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 21:52:17,582 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:17,594 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:52:17,594 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:52:17,594 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 21:52:17,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:17,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:17,600 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-04-11 21:52:17,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 21:52:17,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 21:52:17,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:17,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:17,620 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 21:52:17,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 10 treesize of output 9 [2018-04-11 21:52:17,621 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:17,623 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:17,630 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 21:52:17,631 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:40 [2018-04-11 21:52:17,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 62 [2018-04-11 21:52:17,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 21:52:17,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:17,657 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:17,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-04-11 21:52:17,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 21:52:17,673 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:17,677 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:17,686 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 21:52:17,686 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:86, output treesize:66 [2018-04-11 21:52:17,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 84 [2018-04-11 21:52:17,740 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 21:52:17,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:17,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:17,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2018-04-11 21:52:17,782 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 21:52:17,782 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:17,786 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:17,795 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 21:52:17,795 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:110, output treesize:90 [2018-04-11 21:52:23,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2018-04-11 21:52:23,866 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 21:52:23,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:23,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2018-04-11 21:52:23,872 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:23,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:23,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-04-11 21:52:23,884 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 21:52:23,884 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:23,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 21:52:23,888 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:23,889 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:23,892 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 21:52:23,892 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:65, output treesize:9 [2018-04-11 21:52:23,918 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 21:52:23,935 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:52:23,935 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 20 [2018-04-11 21:52:23,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 21:52:23,936 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 21:52:23,936 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=331, Unknown=3, NotChecked=0, Total=420 [2018-04-11 21:52:23,936 INFO L87 Difference]: Start difference. First operand 315 states and 381 transitions. Second operand 21 states. [2018-04-11 21:52:24,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:52:24,930 INFO L93 Difference]: Finished difference Result 639 states and 774 transitions. [2018-04-11 21:52:24,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 21:52:24,931 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 56 [2018-04-11 21:52:24,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:52:24,932 INFO L225 Difference]: With dead ends: 639 [2018-04-11 21:52:24,932 INFO L226 Difference]: Without dead ends: 639 [2018-04-11 21:52:24,932 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 44 SyntacticMatches, 8 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=365, Invalid=1038, Unknown=3, NotChecked=0, Total=1406 [2018-04-11 21:52:24,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2018-04-11 21:52:24,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 349. [2018-04-11 21:52:24,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-04-11 21:52:24,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 423 transitions. [2018-04-11 21:52:24,936 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 423 transitions. Word has length 56 [2018-04-11 21:52:24,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:52:24,936 INFO L459 AbstractCegarLoop]: Abstraction has 349 states and 423 transitions. [2018-04-11 21:52:24,936 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 21:52:24,936 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 423 transitions. [2018-04-11 21:52:24,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-11 21:52:24,937 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:52:24,937 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 21:52:24,937 INFO L408 AbstractCegarLoop]: === Iteration 40 === [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 21:52:24,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1626219474, now seen corresponding path program 1 times [2018-04-11 21:52:24,937 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:52:24,937 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:52:24,937 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:52:24,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:52:24,938 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:52:24,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:52:24,945 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:52:25,185 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 21:52:25,186 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 21:52:25,186 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 21:52:25,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:52:25,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:52:25,214 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:52:25,234 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:52:25,234 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:52:25,235 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 21:52:25,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:25,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:25,240 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-11 21:52:25,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 21:52:25,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:52:25,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:25,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:25,266 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 21:52:25,266 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2018-04-11 21:52:25,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-04-11 21:52:25,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 21:52:25,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:25,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:25,327 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 21:52:25,327 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2018-04-11 21:52:25,406 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:52:25,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 51 [2018-04-11 21:52:25,415 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 21:52:25,415 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:25,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:25,436 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 21:52:25,436 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:53 [2018-04-11 21:52:31,464 WARN L151 SmtUtils]: Spent 2011ms on a formula simplification. DAG size of input: 30 DAG size of output 26 [2018-04-11 21:52:31,468 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:52:31,469 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:52:31,469 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:52:31,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 50 [2018-04-11 21:52:31,470 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:31,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:52:31,479 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:59 [2018-04-11 21:52:31,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 47 [2018-04-11 21:52:31,509 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:52:31,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 54 [2018-04-11 21:52:31,510 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:31,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:31,531 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 21:52:31,531 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:72, output treesize:77 [2018-04-11 21:52:31,589 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:52:31,589 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:52:31,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 99 [2018-04-11 21:52:31,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 21:52:31,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:31,604 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:31,613 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 21:52:31,614 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:100, output treesize:90 [2018-04-11 21:52:31,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 93 [2018-04-11 21:52:31,746 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 21:52:31,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:31,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:31,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 21:52:31,764 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:109, output treesize:99 [2018-04-11 21:52:37,819 WARN L151 SmtUtils]: Spent 2031ms on a formula simplification. DAG size of input: 40 DAG size of output 36 [2018-04-11 21:52:39,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 67 [2018-04-11 21:52:39,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 29 [2018-04-11 21:52:39,867 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 21:52:39,874 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 21:52:39,874 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:39,880 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 21:52:39,880 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:39,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:52:39,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 21:52:39,889 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:93, output treesize:28 [2018-04-11 21:52:40,078 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 21:52:40,096 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:52:40,096 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 31 [2018-04-11 21:52:40,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-11 21:52:40,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-11 21:52:40,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=790, Unknown=5, NotChecked=0, Total=992 [2018-04-11 21:52:40,097 INFO L87 Difference]: Start difference. First operand 349 states and 423 transitions. Second operand 32 states. [2018-04-11 21:52:56,570 WARN L151 SmtUtils]: Spent 2032ms on a formula simplification. DAG size of input: 43 DAG size of output 35 [2018-04-11 21:54:01,942 WARN L151 SmtUtils]: Spent 2068ms on a formula simplification. DAG size of input: 58 DAG size of output 49 [2018-04-11 21:54:02,136 WARN L151 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 111 DAG size of output 61 [2018-04-11 21:54:38,817 WARN L151 SmtUtils]: Spent 2105ms on a formula simplification. DAG size of input: 63 DAG size of output 52 [2018-04-11 21:54:51,412 WARN L151 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 64 DAG size of output 50 [2018-04-11 21:55:38,328 WARN L151 SmtUtils]: Spent 2040ms on a formula simplification. DAG size of input: 64 DAG size of output 53 [2018-04-11 21:56:26,939 WARN L151 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 97 DAG size of output 55 [2018-04-11 21:56:52,288 WARN L151 SmtUtils]: Spent 2025ms on a formula simplification. DAG size of input: 52 DAG size of output 42 [2018-04-11 21:56:58,718 WARN L151 SmtUtils]: Spent 209ms on a formula simplification. DAG size of input: 48 DAG size of output 38 [2018-04-11 21:56:58,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:56:58,901 INFO L93 Difference]: Finished difference Result 1863 states and 2348 transitions. [2018-04-11 21:56:58,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-04-11 21:56:58,902 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 56 [2018-04-11 21:56:58,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:56:58,905 INFO L225 Difference]: With dead ends: 1863 [2018-04-11 21:56:58,905 INFO L226 Difference]: Without dead ends: 1863 [2018-04-11 21:56:58,907 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4998 ImplicationChecksByTransitivity, 225.7s TimeCoverageRelationStatistics Valid=2955, Invalid=11462, Unknown=103, NotChecked=0, Total=14520 [2018-04-11 21:56:58,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1863 states. [2018-04-11 21:56:58,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1863 to 485. [2018-04-11 21:56:58,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2018-04-11 21:56:58,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 618 transitions. [2018-04-11 21:56:58,921 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 618 transitions. Word has length 56 [2018-04-11 21:56:58,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:56:58,921 INFO L459 AbstractCegarLoop]: Abstraction has 485 states and 618 transitions. [2018-04-11 21:56:58,921 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-11 21:56:58,922 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 618 transitions. [2018-04-11 21:56:58,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-11 21:56:58,922 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:56:58,922 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 21:56:58,922 INFO L408 AbstractCegarLoop]: === Iteration 41 === [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 21:56:58,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1626219475, now seen corresponding path program 1 times [2018-04-11 21:56:58,923 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:56:58,923 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:56:58,923 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:56:58,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:56:58,923 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:56:58,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:56:58,935 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:56:59,168 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 21:56:59,168 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 21:56:59,168 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 21:56:59,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:56:59,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:56:59,191 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:56:59,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 21:56:59,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:56:59,206 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:56:59,206 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:56:59,207 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 21:56:59,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:56:59,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:56:59,213 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-11 21:56:59,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 21:56:59,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:56:59,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:56:59,233 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:56:59,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 21:56:59,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:56:59,246 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:56:59,248 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:56:59,262 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 21:56:59,263 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:53, output treesize:45 [2018-04-11 21:56:59,300 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:56:59,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-04-11 21:56:59,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 21:56:59,304 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:56:59,308 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:56:59,318 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:56:59,322 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 57 treesize of output 64 [2018-04-11 21:56:59,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 21:56:59,323 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:56:59,329 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:56:59,336 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 21:56:59,336 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:83, output treesize:67 [2018-04-11 21:56:59,389 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:56:59,390 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:56:59,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 92 [2018-04-11 21:56:59,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 21:56:59,399 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:56:59,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:56:59,427 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:56:59,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-04-11 21:56:59,431 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 21:56:59,431 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:56:59,435 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:56:59,446 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 21:56:59,446 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:109, output treesize:93 [2018-04-11 21:57:03,489 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:03,489 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 21:57:03,489 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:03,501 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:03,502 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:03,502 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:03,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-11 21:57:03,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:03,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:57:03,513 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:82, output treesize:74 [2018-04-11 21:57:03,539 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:03,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 64 [2018-04-11 21:57:03,546 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:03,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 78 [2018-04-11 21:57:03,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:03,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:03,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 40 [2018-04-11 21:57:03,580 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:03,581 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 21:57:03,581 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:03,586 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:03,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:57:03,600 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:100, output treesize:92 [2018-04-11 21:57:03,661 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:03,662 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:03,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 67 [2018-04-11 21:57:03,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 21:57:03,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:03,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:03,689 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:03,690 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:03,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 133 [2018-04-11 21:57:03,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 14 treesize of output 13 [2018-04-11 21:57:03,699 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:03,710 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:03,722 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 21:57:03,722 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:138, output treesize:118 [2018-04-11 21:57:03,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 74 [2018-04-11 21:57:03,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 21:57:03,831 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:03,838 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:03,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 134 [2018-04-11 21:57:03,860 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 21:57:03,860 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:03,871 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:03,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 21:57:03,884 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:162, output treesize:142 [2018-04-11 21:57:10,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 91 [2018-04-11 21:57:10,052 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 21:57:10,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:10,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 47 [2018-04-11 21:57:10,063 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 21:57:10,071 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 21:57:10,071 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:10,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:57:10,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 37 [2018-04-11 21:57:10,093 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 21:57:10,093 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:10,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 21:57:10,099 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:10,102 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 21:57:10,102 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:10,103 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:10,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:57:10,107 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:130, output treesize:18 [2018-04-11 21:57:10,215 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 21:57:10,231 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:57:10,232 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 31 [2018-04-11 21:57:10,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-11 21:57:10,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-11 21:57:10,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=835, Unknown=5, NotChecked=0, Total=992 [2018-04-11 21:57:10,232 INFO L87 Difference]: Start difference. First operand 485 states and 618 transitions. Second operand 32 states. [2018-04-11 21:57:12,538 WARN L151 SmtUtils]: Spent 2027ms on a formula simplification. DAG size of input: 61 DAG size of output 52 [2018-04-11 21:57:15,901 WARN L151 SmtUtils]: Spent 2035ms on a formula simplification. DAG size of input: 73 DAG size of output 59 [2018-04-11 21:57:19,178 WARN L151 SmtUtils]: Spent 2040ms on a formula simplification. DAG size of input: 70 DAG size of output 56 [2018-04-11 21:57:19,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:57:19,745 INFO L93 Difference]: Finished difference Result 1378 states and 1729 transitions. [2018-04-11 21:57:19,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-04-11 21:57:19,745 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 56 [2018-04-11 21:57:19,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:57:19,747 INFO L225 Difference]: With dead ends: 1378 [2018-04-11 21:57:19,747 INFO L226 Difference]: Without dead ends: 1378 [2018-04-11 21:57:19,748 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1956 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=1151, Invalid=5324, Unknown=5, NotChecked=0, Total=6480 [2018-04-11 21:57:19,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2018-04-11 21:57:19,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 499. [2018-04-11 21:57:19,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2018-04-11 21:57:19,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 637 transitions. [2018-04-11 21:57:19,753 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 637 transitions. Word has length 56 [2018-04-11 21:57:19,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:57:19,754 INFO L459 AbstractCegarLoop]: Abstraction has 499 states and 637 transitions. [2018-04-11 21:57:19,754 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-11 21:57:19,754 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 637 transitions. [2018-04-11 21:57:19,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-11 21:57:19,754 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:57:19,754 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:57:19,754 INFO L408 AbstractCegarLoop]: === Iteration 42 === [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 21:57:19,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1865966095, now seen corresponding path program 1 times [2018-04-11 21:57:19,754 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:57:19,754 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:57:19,755 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:57:19,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:57:19,755 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:57:19,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:57:19,766 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:57:20,057 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:57:20,057 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:57:20,057 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-04-11 21:57:20,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 21:57:20,057 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 21:57:20,058 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2018-04-11 21:57:20,058 INFO L87 Difference]: Start difference. First operand 499 states and 637 transitions. Second operand 21 states. [2018-04-11 21:57:20,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:57:20,867 INFO L93 Difference]: Finished difference Result 798 states and 997 transitions. [2018-04-11 21:57:20,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 21:57:20,868 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 61 [2018-04-11 21:57:20,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:57:20,869 INFO L225 Difference]: With dead ends: 798 [2018-04-11 21:57:20,869 INFO L226 Difference]: Without dead ends: 798 [2018-04-11 21:57:20,869 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=315, Invalid=1325, Unknown=0, NotChecked=0, Total=1640 [2018-04-11 21:57:20,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2018-04-11 21:57:20,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 565. [2018-04-11 21:57:20,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2018-04-11 21:57:20,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 719 transitions. [2018-04-11 21:57:20,873 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 719 transitions. Word has length 61 [2018-04-11 21:57:20,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:57:20,873 INFO L459 AbstractCegarLoop]: Abstraction has 565 states and 719 transitions. [2018-04-11 21:57:20,873 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 21:57:20,873 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 719 transitions. [2018-04-11 21:57:20,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-11 21:57:20,874 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:57:20,874 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:57:20,874 INFO L408 AbstractCegarLoop]: === Iteration 43 === [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 21:57:20,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1069104113, now seen corresponding path program 1 times [2018-04-11 21:57:20,874 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:57:20,874 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:57:20,875 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:57:20,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:57:20,875 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:57:20,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:57:20,882 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:57:21,193 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:57:21,193 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:57:21,193 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-04-11 21:57:21,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 21:57:21,194 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 21:57:21,194 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2018-04-11 21:57:21,194 INFO L87 Difference]: Start difference. First operand 565 states and 719 transitions. Second operand 22 states. [2018-04-11 21:57:22,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:57:22,002 INFO L93 Difference]: Finished difference Result 916 states and 1146 transitions. [2018-04-11 21:57:22,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 21:57:22,003 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 61 [2018-04-11 21:57:22,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:57:22,004 INFO L225 Difference]: With dead ends: 916 [2018-04-11 21:57:22,004 INFO L226 Difference]: Without dead ends: 915 [2018-04-11 21:57:22,005 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=366, Invalid=1614, Unknown=0, NotChecked=0, Total=1980 [2018-04-11 21:57:22,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2018-04-11 21:57:22,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 633. [2018-04-11 21:57:22,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2018-04-11 21:57:22,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 804 transitions. [2018-04-11 21:57:22,010 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 804 transitions. Word has length 61 [2018-04-11 21:57:22,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:57:22,010 INFO L459 AbstractCegarLoop]: Abstraction has 633 states and 804 transitions. [2018-04-11 21:57:22,010 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 21:57:22,010 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 804 transitions. [2018-04-11 21:57:22,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-11 21:57:22,011 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:57:22,011 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:57:22,011 INFO L408 AbstractCegarLoop]: === Iteration 44 === [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 21:57:22,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1218577044, now seen corresponding path program 2 times [2018-04-11 21:57:22,011 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:57:22,011 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:57:22,011 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:57:22,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:57:22,012 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:57:22,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:57:22,020 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:57:22,459 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:57:22,460 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 21:57:22,460 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 21:57:22,468 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 21:57:22,495 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 21:57:22,495 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 21:57:22,497 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:57:22,542 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:22,543 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:22,543 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 21:57:22,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:22,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:22,547 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-11 21:57:22,562 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 21:57:22,563 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 21:57:22,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:22,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:22,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 21:57:22,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 21:57:22,572 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:22,573 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:22,577 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 21:57:22,577 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:40, output treesize:20 [2018-04-11 21:57:22,612 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:22,616 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 69 treesize of output 76 [2018-04-11 21:57:22,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 21:57:22,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:22,622 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:22,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 50 [2018-04-11 21:57:22,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 21:57:22,634 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:22,637 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:22,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:22,643 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:78, output treesize:58 [2018-04-11 21:57:22,686 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 99 treesize of output 85 [2018-04-11 21:57:22,688 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 28 treesize of output 35 [2018-04-11 21:57:22,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:22,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:22,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 57 [2018-04-11 21:57:22,705 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 28 treesize of output 35 [2018-04-11 21:57:22,705 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:22,709 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:22,714 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 21:57:22,714 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:102, output treesize:82 [2018-04-11 21:57:28,770 WARN L148 SmtUtils]: Spent 2007ms on a formula simplification that was a NOOP. DAG size: 29 [2018-04-11 21:57:32,819 WARN L148 SmtUtils]: Spent 2007ms on a formula simplification that was a NOOP. DAG size: 28 [2018-04-11 21:57:32,953 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 95 treesize of output 74 [2018-04-11 21:57:32,955 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 26 treesize of output 3 [2018-04-11 21:57:32,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:32,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2018-04-11 21:57:32,960 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 21:57:32,964 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 21:57:32,970 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 32 treesize of output 26 [2018-04-11 21:57:32,971 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 22 treesize of output 3 [2018-04-11 21:57:32,971 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:32,973 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:32,975 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 21:57:32,975 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:95, output treesize:7 [2018-04-11 21:57:32,991 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:57:33,008 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:57:33,008 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 31 [2018-04-11 21:57:33,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-11 21:57:33,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-11 21:57:33,009 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=790, Unknown=6, NotChecked=0, Total=930 [2018-04-11 21:57:33,009 INFO L87 Difference]: Start difference. First operand 633 states and 804 transitions. Second operand 31 states. [2018-04-11 21:57:36,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:57:36,612 INFO L93 Difference]: Finished difference Result 944 states and 1178 transitions. [2018-04-11 21:57:36,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 21:57:36,612 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 66 [2018-04-11 21:57:36,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:57:36,614 INFO L225 Difference]: With dead ends: 944 [2018-04-11 21:57:36,614 INFO L226 Difference]: Without dead ends: 944 [2018-04-11 21:57:36,615 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 53 SyntacticMatches, 6 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 771 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=638, Invalid=2547, Unknown=7, NotChecked=0, Total=3192 [2018-04-11 21:57:36,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2018-04-11 21:57:36,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 632. [2018-04-11 21:57:36,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2018-04-11 21:57:36,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 800 transitions. [2018-04-11 21:57:36,619 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 800 transitions. Word has length 66 [2018-04-11 21:57:36,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:57:36,619 INFO L459 AbstractCegarLoop]: Abstraction has 632 states and 800 transitions. [2018-04-11 21:57:36,620 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-11 21:57:36,620 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 800 transitions. [2018-04-11 21:57:36,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-11 21:57:36,620 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:57:36,620 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:57:36,620 INFO L408 AbstractCegarLoop]: === Iteration 45 === [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 21:57:36,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1175150810, now seen corresponding path program 1 times [2018-04-11 21:57:36,620 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:57:36,620 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:57:36,621 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:57:36,621 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 21:57:36,621 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:57:36,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:57:36,633 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:57:37,105 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:57:37,105 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 21:57:37,105 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 21:57:37,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:57:37,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:57:37,130 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:57:37,136 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:37,137 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:37,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 21:57:37,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:37,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:37,143 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-11 21:57:37,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 21:57:37,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:57:37,163 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:37,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:37,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 21:57:37,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:57:37,176 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:37,178 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:37,185 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 21:57:37,185 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:48, output treesize:29 [2018-04-11 21:57:37,224 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:37,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2018-04-11 21:57:37,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 21:57:37,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:37,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:37,239 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:37,242 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 56 treesize of output 63 [2018-04-11 21:57:37,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 21:57:37,244 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:37,249 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:37,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:37,255 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:59 [2018-04-11 21:57:37,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 47 [2018-04-11 21:57:37,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 29 [2018-04-11 21:57:37,289 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:37,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:37,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 72 [2018-04-11 21:57:37,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 29 [2018-04-11 21:57:37,312 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:37,318 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:37,327 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 21:57:37,327 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:101, output treesize:85 [2018-04-11 21:57:45,397 WARN L148 SmtUtils]: Spent 2010ms on a formula simplification that was a NOOP. DAG size: 37 [2018-04-11 21:57:45,401 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:45,402 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:45,402 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:45,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-11 21:57:45,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:45,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:57:45,412 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:90, output treesize:83 [2018-04-11 21:57:49,448 WARN L148 SmtUtils]: Spent 2009ms on a formula simplification that was a NOOP. DAG size: 36 [2018-04-11 21:57:49,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 61 [2018-04-11 21:57:49,458 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:49,459 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 37 treesize of output 46 [2018-04-11 21:57:49,460 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:49,473 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:49,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 81 [2018-04-11 21:57:49,496 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:49,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 96 [2018-04-11 21:57:49,496 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:49,506 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:49,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:57:49,517 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:109, output treesize:95 [2018-04-11 21:57:51,558 WARN L148 SmtUtils]: Spent 2009ms on a formula simplification that was a NOOP. DAG size: 37 [2018-04-11 21:57:53,591 WARN L148 SmtUtils]: Spent 2010ms on a formula simplification that was a NOOP. DAG size: 41 [2018-04-11 21:57:53,596 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:53,597 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:53,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 149 [2018-04-11 21:57:53,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:57:53,607 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:53,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:53,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 90 [2018-04-11 21:57:53,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:57:53,639 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:53,650 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:53,663 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 21:57:53,663 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:141, output treesize:121 [2018-04-11 21:57:55,712 WARN L148 SmtUtils]: Spent 2024ms on a formula simplification that was a NOOP. DAG size: 46 [2018-04-11 21:57:57,758 WARN L148 SmtUtils]: Spent 2022ms on a formula simplification that was a NOOP. DAG size: 44 [2018-04-11 21:57:57,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 97 [2018-04-11 21:57:57,769 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 21:57:57,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:57,778 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:57,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 140 [2018-04-11 21:57:57,799 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 21:57:57,799 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:57,811 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:57,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 21:57:57,822 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:165, output treesize:145 [2018-04-11 21:58:05,967 WARN L151 SmtUtils]: Spent 4109ms on a formula simplification. DAG size of input: 50 DAG size of output 43 [2018-04-11 21:58:10,009 WARN L148 SmtUtils]: Spent 2010ms on a formula simplification that was a NOOP. DAG size: 43 [2018-04-11 21:58:10,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 119 [2018-04-11 21:58:10,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 59 [2018-04-11 21:58:10,115 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 21:58:10,127 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 26 treesize of output 3 [2018-04-11 21:58:10,127 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:10,137 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 21:58:10,137 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:10,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 21:58:10,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 41 [2018-04-11 21:58:10,156 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 22 treesize of output 3 [2018-04-11 21:58:10,156 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:10,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 7 treesize of output 1 [2018-04-11 21:58:10,160 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:10,161 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:10,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:10,165 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:149, output treesize:7 [2018-04-11 21:58:10,192 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:58:10,209 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:58:10,210 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 34 [2018-04-11 21:58:10,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-11 21:58:10,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-11 21:58:10,211 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=970, Unknown=10, NotChecked=0, Total=1122 [2018-04-11 21:58:10,211 INFO L87 Difference]: Start difference. First operand 632 states and 800 transitions. Second operand 34 states. [2018-04-11 21:58:35,711 WARN L151 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 115 DAG size of output 64 [2018-04-11 21:58:52,431 WARN L148 SmtUtils]: Spent 2085ms on a formula simplification that was a NOOP. DAG size: 47 [2018-04-11 21:58:53,003 WARN L151 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 141 DAG size of output 89 [2018-04-11 21:58:55,089 WARN L148 SmtUtils]: Spent 2016ms on a formula simplification that was a NOOP. DAG size: 83 [2018-04-11 21:58:57,287 WARN L148 SmtUtils]: Spent 2018ms on a formula simplification that was a NOOP. DAG size: 87 [2018-04-11 21:58:59,411 WARN L148 SmtUtils]: Spent 2064ms on a formula simplification that was a NOOP. DAG size: 89 [2018-04-11 21:59:01,473 WARN L148 SmtUtils]: Spent 2032ms on a formula simplification that was a NOOP. DAG size: 49 [2018-04-11 21:59:13,976 WARN L151 SmtUtils]: Spent 4035ms on a formula simplification. DAG size of input: 99 DAG size of output 59 [2018-04-11 21:59:18,203 WARN L151 SmtUtils]: Spent 4043ms on a formula simplification. DAG size of input: 101 DAG size of output 61 [2018-04-11 21:59:22,402 WARN L151 SmtUtils]: Spent 4084ms on a formula simplification. DAG size of input: 105 DAG size of output 82 [2018-04-11 21:59:32,523 WARN L151 SmtUtils]: Spent 4046ms on a formula simplification. DAG size of input: 108 DAG size of output 65 [2018-04-11 21:59:32,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:59:32,776 INFO L93 Difference]: Finished difference Result 988 states and 1233 transitions. [2018-04-11 21:59:32,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-11 21:59:32,776 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2018-04-11 21:59:32,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:59:32,778 INFO L225 Difference]: With dead ends: 988 [2018-04-11 21:59:32,778 INFO L226 Difference]: Without dead ends: 988 [2018-04-11 21:59:32,779 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1503 ImplicationChecksByTransitivity, 99.3s TimeCoverageRelationStatistics Valid=815, Invalid=4411, Unknown=30, NotChecked=0, Total=5256 [2018-04-11 21:59:32,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2018-04-11 21:59:32,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 743. [2018-04-11 21:59:32,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 743 states. [2018-04-11 21:59:32,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 946 transitions. [2018-04-11 21:59:32,784 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 946 transitions. Word has length 66 [2018-04-11 21:59:32,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:59:32,784 INFO L459 AbstractCegarLoop]: Abstraction has 743 states and 946 transitions. [2018-04-11 21:59:32,784 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-11 21:59:32,784 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 946 transitions. [2018-04-11 21:59:32,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-11 21:59:32,785 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:59:32,785 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:59:32,785 INFO L408 AbstractCegarLoop]: === Iteration 46 === [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 21:59:32,785 INFO L82 PathProgramCache]: Analyzing trace with hash 748616595, now seen corresponding path program 1 times [2018-04-11 21:59:32,785 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:59:32,785 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:59:32,785 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:59:32,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:59:32,785 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:59:32,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:59:32,798 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:59:33,178 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:59:33,178 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 21:59:33,178 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 21:59:33,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:59:33,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:59:33,211 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:59:33,282 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:33,282 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:33,283 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 21:59:33,283 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:59:33,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:59:33,289 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-11 21:59:33,309 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 21:59:33,310 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 21:59:33,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:59:33,312 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:59:33,317 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 21:59:33,318 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:36 [2018-04-11 21:59:33,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-04-11 21:59:33,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 21:59:33,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:59:33,338 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:59:33,345 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 21:59:33,345 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:49 [2018-04-11 21:59:33,391 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 21:59:33,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-11 21:59:33,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:59:33,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:59:33,403 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 21:59:33,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:58 [2018-04-11 21:59:39,433 WARN L151 SmtUtils]: Spent 2012ms on a formula simplification. DAG size of input: 28 DAG size of output 24 [2018-04-11 21:59:41,462 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:41,463 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:41,463 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:41,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 52 [2018-04-11 21:59:41,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:59:41,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:59:41,474 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:70 [2018-04-11 21:59:41,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 53 [2018-04-11 21:59:41,511 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:41,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 60 [2018-04-11 21:59:41,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:59:41,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:59:41,528 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 21:59:41,528 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:82 [2018-04-11 21:59:41,594 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:41,595 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:41,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 89 [2018-04-11 21:59:41,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 21:59:41,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:59:41,609 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:59:41,624 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 21:59:41,624 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:101, output treesize:93 [2018-04-11 21:59:41,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 93 [2018-04-11 21:59:41,744 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 21:59:41,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:59:41,752 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:59:41,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-11 21:59:41,763 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:111, output treesize:103 [2018-04-11 21:59:47,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 71 [2018-04-11 21:59:47,958 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:47,958 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:59:47,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2018-04-11 21:59:47,959 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 21:59:47,967 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 21:59:47,968 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:59:47,974 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 21:59:47,974 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:59:47,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:59:47,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 21:59:47,987 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:107, output treesize:28 [2018-04-11 21:59:48,168 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 11 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:59:48,185 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:59:48,185 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 39 [2018-04-11 21:59:48,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-11 21:59:48,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-11 21:59:48,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=1285, Unknown=6, NotChecked=0, Total=1560 [2018-04-11 21:59:48,186 INFO L87 Difference]: Start difference. First operand 743 states and 946 transitions. Second operand 40 states. [2018-04-11 22:00:17,059 WARN L151 SmtUtils]: Spent 2026ms on a formula simplification. DAG size of input: 54 DAG size of output 39 [2018-04-11 22:00:41,797 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 72 DAG size of output 60 [2018-04-11 22:00:54,103 WARN L151 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 65 DAG size of output 51 [2018-04-11 22:01:06,266 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 78 DAG size of output 61 [2018-04-11 22:01:06,431 WARN L151 SmtUtils]: Spent 143ms on a formula simplification. DAG size of input: 46 DAG size of output 43 [2018-04-11 22:01:12,698 WARN L151 SmtUtils]: Spent 4230ms on a formula simplification. DAG size of input: 113 DAG size of output 69 [2018-04-11 22:01:12,819 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 48 DAG size of output 45 [2018-04-11 22:01:23,090 WARN L151 SmtUtils]: Spent 4090ms on a formula simplification. DAG size of input: 104 DAG size of output 66 [2018-04-11 22:01:37,362 WARN L151 SmtUtils]: Spent 161ms on a formula simplification. DAG size of input: 59 DAG size of output 52 [2018-04-11 22:02:01,650 WARN L151 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 51 DAG size of output 48 [2018-04-11 22:02:24,001 WARN L151 SmtUtils]: Spent 2047ms on a formula simplification. DAG size of input: 70 DAG size of output 53 [2018-04-11 22:02:24,202 WARN L151 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 58 DAG size of output 49 Received shutdown request... [2018-04-11 22:02:40,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-11 22:02:40,458 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 22:02:40,462 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 22:02:40,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 10:02:40 BoogieIcfgContainer [2018-04-11 22:02:40,462 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 22:02:40,463 INFO L168 Benchmark]: Toolchain (without parser) took 859393.95 ms. Allocated memory was 399.5 MB in the beginning and 584.6 MB in the end (delta: 185.1 MB). Free memory was 329.9 MB in the beginning and 405.4 MB in the end (delta: -75.5 MB). Peak memory consumption was 109.6 MB. Max. memory is 5.3 GB. [2018-04-11 22:02:40,464 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 399.5 MB. Free memory is still 355.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 22:02:40,464 INFO L168 Benchmark]: CACSL2BoogieTranslator took 231.63 ms. Allocated memory is still 399.5 MB. Free memory was 329.2 MB in the beginning and 304.1 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. [2018-04-11 22:02:40,464 INFO L168 Benchmark]: Boogie Preprocessor took 40.54 ms. Allocated memory is still 399.5 MB. Free memory was 304.1 MB in the beginning and 301.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 5.3 GB. [2018-04-11 22:02:40,464 INFO L168 Benchmark]: RCFGBuilder took 505.61 ms. Allocated memory was 399.5 MB in the beginning and 583.5 MB in the end (delta: 184.0 MB). Free memory was 301.4 MB in the beginning and 500.5 MB in the end (delta: -199.1 MB). Peak memory consumption was 25.4 MB. Max. memory is 5.3 GB. [2018-04-11 22:02:40,465 INFO L168 Benchmark]: TraceAbstraction took 858613.22 ms. Allocated memory was 583.5 MB in the beginning and 584.6 MB in the end (delta: 1.0 MB). Free memory was 500.5 MB in the beginning and 405.4 MB in the end (delta: 95.1 MB). Peak memory consumption was 96.2 MB. Max. memory is 5.3 GB. [2018-04-11 22:02:40,466 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.16 ms. Allocated memory is still 399.5 MB. Free memory is still 355.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 231.63 ms. Allocated memory is still 399.5 MB. Free memory was 329.2 MB in the beginning and 304.1 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 40.54 ms. Allocated memory is still 399.5 MB. Free memory was 304.1 MB in the beginning and 301.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 5.3 GB. * RCFGBuilder took 505.61 ms. Allocated memory was 399.5 MB in the beginning and 583.5 MB in the end (delta: 184.0 MB). Free memory was 301.4 MB in the beginning and 500.5 MB in the end (delta: -199.1 MB). Peak memory consumption was 25.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 858613.22 ms. Allocated memory was 583.5 MB in the beginning and 584.6 MB in the end (delta: 1.0 MB). Free memory was 500.5 MB in the beginning and 405.4 MB in the end (delta: 95.1 MB). Peak memory consumption was 96.2 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 672]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 672). Cancelled while BasicCegarLoop was constructing difference of abstraction (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 659]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 659). Cancelled while BasicCegarLoop was constructing difference of abstraction (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 672]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 672). Cancelled while BasicCegarLoop was constructing difference of abstraction (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 659]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 659). Cancelled while BasicCegarLoop was constructing difference of abstraction (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (743states) and interpolant automaton (currently 36 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 151 locations, 65 error locations. TIMEOUT Result, 858.5s OverallTime, 46 OverallIterations, 4 TraceHistogramMax, 735.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5205 SDtfs, 17611 SDslu, 27789 SDs, 0 SdLazy, 26484 SolverSat, 2168 SolverUnsat, 154 SolverUnknown, 0 SolverNotchecked, 156.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1690 GetRequests, 604 SyntacticMatches, 50 SemanticMatches, 1035 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 14738 ImplicationChecksByTransitivity, 684.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=743occurred in iteration=45, 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, 45 MinimizatonAttempts, 5492 StatesRemovedByMinimization, 43 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 121.3s InterpolantComputationTime, 2363 NumberOfCodeBlocks, 2363 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 2304 ConstructedInterpolants, 256 QuantifiedInterpolants, 2202216 SizeOfPredicates, 218 NumberOfNonLiveVariables, 2860 ConjunctsInSsa, 487 ConjunctsInUnsatCore, 59 InterpolantComputations, 35 PerfectInterpolantSequences, 166/412 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_22-02-40-472.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_22-02-40-472.csv Completed graceful shutdown