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-408c70d-m [2018-04-12 13:33:53,546 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-12 13:33:53,548 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-12 13:33:53,561 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-12 13:33:53,561 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-12 13:33:53,562 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-12 13:33:53,562 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-12 13:33:53,564 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-12 13:33:53,566 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-12 13:33:53,566 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-12 13:33:53,567 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-12 13:33:53,567 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-12 13:33:53,568 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-12 13:33:53,569 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-12 13:33:53,570 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-12 13:33:53,571 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-12 13:33:53,573 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-12 13:33:53,574 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-12 13:33:53,575 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-12 13:33:53,576 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-12 13:33:53,578 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-12 13:33:53,578 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-12 13:33:53,578 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-12 13:33:53,579 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-12 13:33:53,580 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-12 13:33:53,581 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-12 13:33:53,581 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-12 13:33:53,582 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-12 13:33:53,582 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-12 13:33:53,582 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-12 13:33:53,583 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-12 13:33:53,583 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-12 13:33:53,593 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-12 13:33:53,593 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-12 13:33:53,594 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-12 13:33:53,594 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-12 13:33:53,594 INFO L133 SettingsManager]: * Use SBE=true [2018-04-12 13:33:53,594 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-12 13:33:53,594 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-12 13:33:53,594 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-12 13:33:53,595 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-12 13:33:53,595 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-12 13:33:53,595 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-12 13:33:53,595 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-12 13:33:53,595 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-12 13:33:53,595 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-12 13:33:53,595 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-12 13:33:53,596 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-12 13:33:53,596 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-12 13:33:53,596 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-12 13:33:53,596 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-12 13:33:53,596 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-12 13:33:53,596 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-12 13:33:53,597 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-12 13:33:53,597 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-12 13:33:53,597 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-12 13:33:53,625 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-12 13:33:53,634 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-12 13:33:53,638 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-12 13:33:53,639 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-12 13:33:53,639 INFO L276 PluginConnector]: CDTParser initialized [2018-04-12 13:33:53,640 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-12 13:33:53,928 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG67689bb6a [2018-04-12 13:33:54,068 INFO L287 CDTParser]: IsIndexed: true [2018-04-12 13:33:54,068 INFO L288 CDTParser]: Found 1 translation units. [2018-04-12 13:33:54,068 INFO L168 CDTParser]: Scanning tree_stack_true-valid-memsafety_false-termination.i [2018-04-12 13:33:54,076 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-12 13:33:54,077 INFO L215 ultiparseSymbolTable]: [2018-04-12 13:33:54,077 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-12 13:33:54,077 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in tree_stack_true-valid-memsafety_false-termination.i [2018-04-12 13:33:54,077 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-12 13:33:54,077 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-12 13:33:54,077 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-12 13:33:54,077 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-12 13:33:54,078 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-12 13:33:54,078 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-12 13:33:54,078 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-12 13:33:54,078 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-12 13:33:54,078 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-12 13:33:54,078 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-12 13:33:54,078 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-12 13:33:54,078 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-12 13:33:54,078 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-12 13:33:54,078 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-12 13:33:54,079 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-12 13:33:54,079 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-12 13:33:54,079 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-12 13:33:54,079 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-12 13:33:54,079 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-12 13:33:54,079 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-12 13:33:54,079 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-12 13:33:54,079 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-12 13:33:54,079 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-12 13:33:54,079 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-12 13:33:54,080 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-12 13:33:54,080 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-12 13:33:54,080 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-12 13:33:54,080 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-12 13:33:54,080 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-12 13:33:54,080 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-12 13:33:54,080 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-12 13:33:54,080 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-12 13:33:54,080 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-12 13:33:54,080 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-12 13:33:54,080 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-12 13:33:54,080 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-12 13:33:54,081 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-12 13:33:54,081 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-12 13:33:54,081 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-12 13:33:54,081 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-12 13:33:54,081 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-12 13:33:54,081 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-12 13:33:54,081 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-12 13:33:54,081 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-12 13:33:54,081 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-12 13:33:54,082 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-12 13:33:54,082 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-12 13:33:54,082 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-12 13:33:54,082 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-12 13:33:54,082 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-12 13:33:54,082 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-12 13:33:54,082 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-12 13:33:54,082 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-12 13:33:54,082 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-12 13:33:54,083 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-12 13:33:54,083 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-12 13:33:54,083 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-12 13:33:54,083 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-12 13:33:54,083 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-12 13:33:54,083 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-12 13:33:54,083 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-12 13:33:54,084 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-12 13:33:54,084 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-12 13:33:54,084 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-12 13:33:54,084 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-12 13:33:54,084 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-12 13:33:54,084 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-12 13:33:54,084 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-12 13:33:54,084 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-12 13:33:54,084 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-12 13:33:54,084 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-12 13:33:54,085 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-12 13:33:54,085 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-12 13:33:54,085 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-12 13:33:54,085 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-12 13:33:54,085 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-12 13:33:54,085 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-12 13:33:54,085 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-12 13:33:54,085 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-12 13:33:54,085 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-12 13:33:54,085 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-12 13:33:54,086 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-12 13:33:54,086 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-12 13:33:54,086 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-12 13:33:54,086 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-12 13:33:54,086 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-12 13:33:54,086 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-12 13:33:54,086 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-12 13:33:54,086 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-12 13:33:54,086 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-12 13:33:54,086 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-12 13:33:54,086 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-12 13:33:54,087 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-12 13:33:54,087 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-12 13:33:54,087 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-12 13:33:54,087 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-12 13:33:54,087 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-12 13:33:54,087 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-12 13:33:54,087 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-12 13:33:54,087 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-12 13:33:54,087 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-12 13:33:54,087 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-12 13:33:54,087 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-12 13:33:54,088 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-12 13:33:54,088 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-12 13:33:54,088 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-12 13:33:54,088 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-12 13:33:54,088 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-12 13:33:54,088 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-12 13:33:54,088 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-12 13:33:54,088 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-12 13:33:54,088 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-12 13:33:54,088 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-12 13:33:54,088 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-12 13:33:54,089 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-12 13:33:54,089 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-12 13:33:54,089 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-12 13:33:54,089 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-12 13:33:54,089 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-12 13:33:54,122 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG67689bb6a [2018-04-12 13:33:54,125 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-12 13:33:54,126 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-12 13:33:54,126 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-12 13:33:54,127 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-12 13:33:54,130 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-12 13:33:54,131 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 01:33:54" (1/1) ... [2018-04-12 13:33:54,132 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64e7d49f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:33:54, skipping insertion in model container [2018-04-12 13:33:54,133 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 01:33:54" (1/1) ... [2018-04-12 13:33:54,143 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 13:33:54,167 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 13:33:54,303 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 13:33:54,335 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 13:33:54,340 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 110 non ball SCCs. Number of states in SCCs 110. [2018-04-12 13:33:54,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:33:54 WrapperNode [2018-04-12 13:33:54,374 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-12 13:33:54,375 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-12 13:33:54,375 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-12 13:33:54,375 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-12 13:33:54,390 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:33:54" (1/1) ... [2018-04-12 13:33:54,390 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:33:54" (1/1) ... [2018-04-12 13:33:54,405 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:33:54" (1/1) ... [2018-04-12 13:33:54,406 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:33:54" (1/1) ... [2018-04-12 13:33:54,416 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:33:54" (1/1) ... [2018-04-12 13:33:54,421 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:33:54" (1/1) ... [2018-04-12 13:33:54,423 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:33:54" (1/1) ... [2018-04-12 13:33:54,427 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-12 13:33:54,428 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-12 13:33:54,428 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-12 13:33:54,428 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-12 13:33:54,429 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:33:54" (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-12 13:33:54,523 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-12 13:33:54,523 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-12 13:33:54,523 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-12 13:33:54,523 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-12 13:33:54,523 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-12 13:33:54,523 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-12 13:33:54,524 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-12 13:33:54,524 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-12 13:33:54,524 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-12 13:33:54,524 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-12 13:33:54,524 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-12 13:33:54,524 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-12 13:33:54,524 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-12 13:33:54,524 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-12 13:33:54,524 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-12 13:33:54,525 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-12 13:33:54,525 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-12 13:33:54,525 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-12 13:33:54,525 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-12 13:33:54,525 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-12 13:33:54,525 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-12 13:33:54,525 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-12 13:33:54,525 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-12 13:33:54,525 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-12 13:33:54,525 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-12 13:33:54,526 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-12 13:33:54,526 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-12 13:33:54,526 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-12 13:33:54,526 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-12 13:33:54,526 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-12 13:33:54,526 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-12 13:33:54,526 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-12 13:33:54,526 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-12 13:33:54,526 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-12 13:33:54,526 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-12 13:33:54,526 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-12 13:33:54,527 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-12 13:33:54,527 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-12 13:33:54,527 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-12 13:33:54,527 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-12 13:33:54,527 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-12 13:33:54,527 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-12 13:33:54,527 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-12 13:33:54,527 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-12 13:33:54,527 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-12 13:33:54,528 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-12 13:33:54,528 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-12 13:33:54,528 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-12 13:33:54,528 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-12 13:33:54,528 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-12 13:33:54,528 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-12 13:33:54,528 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-12 13:33:54,528 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-12 13:33:54,528 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-12 13:33:54,529 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-12 13:33:54,529 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-12 13:33:54,529 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-12 13:33:54,529 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-12 13:33:54,529 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-12 13:33:54,529 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-12 13:33:54,529 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-12 13:33:54,529 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-12 13:33:54,529 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-12 13:33:54,529 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-12 13:33:54,530 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-12 13:33:54,530 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-12 13:33:54,530 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-12 13:33:54,530 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-12 13:33:54,530 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-12 13:33:54,530 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-12 13:33:54,530 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-12 13:33:54,530 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-12 13:33:54,530 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-12 13:33:54,531 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-12 13:33:54,531 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-12 13:33:54,531 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-12 13:33:54,531 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-12 13:33:54,531 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-12 13:33:54,531 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-12 13:33:54,531 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-12 13:33:54,531 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-12 13:33:54,531 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-12 13:33:54,531 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-12 13:33:54,531 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-12 13:33:54,531 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-12 13:33:54,531 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-12 13:33:54,531 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-12 13:33:54,531 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-12 13:33:54,531 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-12 13:33:54,531 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-12 13:33:54,531 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-12 13:33:54,531 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-12 13:33:54,531 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-12 13:33:54,532 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-12 13:33:54,532 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-12 13:33:54,532 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-12 13:33:54,532 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-12 13:33:54,532 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-12 13:33:54,532 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-12 13:33:54,532 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-12 13:33:54,532 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-12 13:33:54,532 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-12 13:33:54,532 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-12 13:33:54,532 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-12 13:33:54,532 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-12 13:33:54,533 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-12 13:33:54,533 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-12 13:33:54,533 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-12 13:33:54,533 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-12 13:33:54,533 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-12 13:33:54,533 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-12 13:33:54,533 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-12 13:33:54,533 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-12 13:33:54,954 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-12 13:33:54,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 01:33:54 BoogieIcfgContainer [2018-04-12 13:33:54,954 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-12 13:33:54,955 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-12 13:33:54,955 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-12 13:33:54,957 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-12 13:33:54,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.04 01:33:54" (1/3) ... [2018-04-12 13:33:54,957 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e2c6524 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 01:33:54, skipping insertion in model container [2018-04-12 13:33:54,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:33:54" (2/3) ... [2018-04-12 13:33:54,957 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e2c6524 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 01:33:54, skipping insertion in model container [2018-04-12 13:33:54,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 01:33:54" (3/3) ... [2018-04-12 13:33:54,958 INFO L107 eAbstractionObserver]: Analyzing ICFG tree_stack_true-valid-memsafety_false-termination.i [2018-04-12 13:33:54,964 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-12 13:33:54,968 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 65 error locations. [2018-04-12 13:33:54,991 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-12 13:33:54,992 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-12 13:33:54,992 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-12 13:33:54,992 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-12 13:33:54,992 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-12 13:33:54,992 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-12 13:33:54,992 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-12 13:33:54,992 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-12 13:33:54,992 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-12 13:33:54,992 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-12 13:33:55,003 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2018-04-12 13:33:55,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-12 13:33:55,010 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:33:55,010 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:33:55,011 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-12 13:33:55,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1341836454, now seen corresponding path program 1 times [2018-04-12 13:33:55,014 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:33:55,014 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:33:55,045 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:33:55,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:33:55,045 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:33:55,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:33:55,073 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:33:55,110 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-12 13:33:55,111 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:33:55,112 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 13:33:55,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 13:33:55,120 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 13:33:55,121 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 13:33:55,122 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 4 states. [2018-04-12 13:33:55,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:33:55,303 INFO L93 Difference]: Finished difference Result 168 states and 179 transitions. [2018-04-12 13:33:55,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 13:33:55,304 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-12 13:33:55,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:33:55,311 INFO L225 Difference]: With dead ends: 168 [2018-04-12 13:33:55,311 INFO L226 Difference]: Without dead ends: 164 [2018-04-12 13:33:55,313 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-12 13:33:55,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-04-12 13:33:55,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 146. [2018-04-12 13:33:55,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-04-12 13:33:55,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 156 transitions. [2018-04-12 13:33:55,344 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 156 transitions. Word has length 8 [2018-04-12 13:33:55,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:33:55,344 INFO L459 AbstractCegarLoop]: Abstraction has 146 states and 156 transitions. [2018-04-12 13:33:55,344 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 13:33:55,344 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 156 transitions. [2018-04-12 13:33:55,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-12 13:33:55,344 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:33:55,345 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:33:55,345 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-12 13:33:55,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1341836455, now seen corresponding path program 1 times [2018-04-12 13:33:55,345 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:33:55,345 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:33:55,346 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:33:55,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:33:55,346 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:33:55,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:33:55,356 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:33:55,383 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-12 13:33:55,383 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:33:55,383 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 13:33:55,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 13:33:55,384 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 13:33:55,384 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 13:33:55,384 INFO L87 Difference]: Start difference. First operand 146 states and 156 transitions. Second operand 4 states. [2018-04-12 13:33:55,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:33:55,492 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2018-04-12 13:33:55,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 13:33:55,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-12 13:33:55,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:33:55,493 INFO L225 Difference]: With dead ends: 144 [2018-04-12 13:33:55,494 INFO L226 Difference]: Without dead ends: 144 [2018-04-12 13:33:55,494 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-12 13:33:55,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-04-12 13:33:55,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-04-12 13:33:55,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-04-12 13:33:55,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 154 transitions. [2018-04-12 13:33:55,504 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 154 transitions. Word has length 8 [2018-04-12 13:33:55,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:33:55,504 INFO L459 AbstractCegarLoop]: Abstraction has 144 states and 154 transitions. [2018-04-12 13:33:55,504 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 13:33:55,504 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 154 transitions. [2018-04-12 13:33:55,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-12 13:33:55,505 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:33:55,505 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:33:55,505 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-12 13:33:55,505 INFO L82 PathProgramCache]: Analyzing trace with hash -2000274829, now seen corresponding path program 1 times [2018-04-12 13:33:55,505 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:33:55,505 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:33:55,506 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:33:55,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:33:55,506 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:33:55,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:33:55,517 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:33:55,536 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-12 13:33:55,536 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:33:55,536 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 13:33:55,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 13:33:55,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 13:33:55,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 13:33:55,537 INFO L87 Difference]: Start difference. First operand 144 states and 154 transitions. Second operand 4 states. [2018-04-12 13:33:55,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:33:55,641 INFO L93 Difference]: Finished difference Result 154 states and 165 transitions. [2018-04-12 13:33:55,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 13:33:55,641 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-04-12 13:33:55,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:33:55,642 INFO L225 Difference]: With dead ends: 154 [2018-04-12 13:33:55,642 INFO L226 Difference]: Without dead ends: 154 [2018-04-12 13:33:55,653 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-12 13:33:55,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-04-12 13:33:55,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 131. [2018-04-12 13:33:55,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-04-12 13:33:55,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 142 transitions. [2018-04-12 13:33:55,659 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 142 transitions. Word has length 14 [2018-04-12 13:33:55,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:33:55,660 INFO L459 AbstractCegarLoop]: Abstraction has 131 states and 142 transitions. [2018-04-12 13:33:55,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 13:33:55,660 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 142 transitions. [2018-04-12 13:33:55,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-12 13:33:55,660 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:33:55,660 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:33:55,660 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-12 13:33:55,661 INFO L82 PathProgramCache]: Analyzing trace with hash -2000274828, now seen corresponding path program 1 times [2018-04-12 13:33:55,661 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:33:55,661 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:33:55,662 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:33:55,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:33:55,662 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:33:55,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:33:55,673 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:33:55,714 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-12 13:33:55,714 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:33:55,715 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 13:33:55,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 13:33:55,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 13:33:55,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 13:33:55,715 INFO L87 Difference]: Start difference. First operand 131 states and 142 transitions. Second operand 5 states. [2018-04-12 13:33:55,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:33:55,863 INFO L93 Difference]: Finished difference Result 177 states and 195 transitions. [2018-04-12 13:33:55,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 13:33:55,864 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-04-12 13:33:55,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:33:55,865 INFO L225 Difference]: With dead ends: 177 [2018-04-12 13:33:55,865 INFO L226 Difference]: Without dead ends: 177 [2018-04-12 13:33:55,866 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-12 13:33:55,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-04-12 13:33:55,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 161. [2018-04-12 13:33:55,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-04-12 13:33:55,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 184 transitions. [2018-04-12 13:33:55,872 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 184 transitions. Word has length 14 [2018-04-12 13:33:55,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:33:55,872 INFO L459 AbstractCegarLoop]: Abstraction has 161 states and 184 transitions. [2018-04-12 13:33:55,872 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 13:33:55,872 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 184 transitions. [2018-04-12 13:33:55,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-12 13:33:55,873 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:33:55,873 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:33:55,873 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-12 13:33:55,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1882745265, now seen corresponding path program 1 times [2018-04-12 13:33:55,873 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:33:55,873 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:33:55,874 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:33:55,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:33:55,874 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:33:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:33:55,883 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:33:55,900 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-12 13:33:55,900 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:33:55,900 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 13:33:55,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 13:33:55,900 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 13:33:55,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 13:33:55,900 INFO L87 Difference]: Start difference. First operand 161 states and 184 transitions. Second operand 4 states. [2018-04-12 13:33:55,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:33:55,975 INFO L93 Difference]: Finished difference Result 176 states and 199 transitions. [2018-04-12 13:33:55,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 13:33:55,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-04-12 13:33:55,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:33:55,976 INFO L225 Difference]: With dead ends: 176 [2018-04-12 13:33:55,976 INFO L226 Difference]: Without dead ends: 176 [2018-04-12 13:33:55,977 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-12 13:33:55,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-04-12 13:33:55,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 162. [2018-04-12 13:33:55,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-04-12 13:33:55,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 187 transitions. [2018-04-12 13:33:55,987 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 187 transitions. Word has length 16 [2018-04-12 13:33:55,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:33:55,987 INFO L459 AbstractCegarLoop]: Abstraction has 162 states and 187 transitions. [2018-04-12 13:33:55,987 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 13:33:55,987 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 187 transitions. [2018-04-12 13:33:55,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-12 13:33:55,988 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:33:55,988 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:33:55,988 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-12 13:33:55,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1882745266, now seen corresponding path program 1 times [2018-04-12 13:33:55,988 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:33:55,988 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:33:55,989 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:33:55,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:33:55,989 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:33:55,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:33:55,997 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:33:56,017 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-12 13:33:56,017 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:33:56,017 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 13:33:56,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 13:33:56,017 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 13:33:56,017 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 13:33:56,017 INFO L87 Difference]: Start difference. First operand 162 states and 187 transitions. Second operand 4 states. [2018-04-12 13:33:56,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:33:56,095 INFO L93 Difference]: Finished difference Result 164 states and 187 transitions. [2018-04-12 13:33:56,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 13:33:56,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-04-12 13:33:56,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:33:56,095 INFO L225 Difference]: With dead ends: 164 [2018-04-12 13:33:56,095 INFO L226 Difference]: Without dead ends: 164 [2018-04-12 13:33:56,096 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-12 13:33:56,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-04-12 13:33:56,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 160. [2018-04-12 13:33:56,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-04-12 13:33:56,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 184 transitions. [2018-04-12 13:33:56,101 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 184 transitions. Word has length 16 [2018-04-12 13:33:56,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:33:56,101 INFO L459 AbstractCegarLoop]: Abstraction has 160 states and 184 transitions. [2018-04-12 13:33:56,101 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 13:33:56,101 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 184 transitions. [2018-04-12 13:33:56,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-12 13:33:56,102 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:33:56,102 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-12 13:33:56,102 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-12 13:33:56,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1407261537, now seen corresponding path program 1 times [2018-04-12 13:33:56,102 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:33:56,102 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:33:56,103 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:33:56,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:33:56,103 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:33:56,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:33:56,113 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:33:56,126 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-12 13:33:56,127 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:33:56,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 13:33:56,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 13:33:56,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 13:33:56,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 13:33:56,127 INFO L87 Difference]: Start difference. First operand 160 states and 184 transitions. Second operand 4 states. [2018-04-12 13:33:56,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:33:56,139 INFO L93 Difference]: Finished difference Result 161 states and 184 transitions. [2018-04-12 13:33:56,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 13:33:56,139 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-04-12 13:33:56,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:33:56,140 INFO L225 Difference]: With dead ends: 161 [2018-04-12 13:33:56,140 INFO L226 Difference]: Without dead ends: 161 [2018-04-12 13:33:56,140 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-12 13:33:56,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-04-12 13:33:56,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2018-04-12 13:33:56,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-04-12 13:33:56,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 183 transitions. [2018-04-12 13:33:56,143 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 183 transitions. Word has length 21 [2018-04-12 13:33:56,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:33:56,143 INFO L459 AbstractCegarLoop]: Abstraction has 160 states and 183 transitions. [2018-04-12 13:33:56,143 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 13:33:56,143 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 183 transitions. [2018-04-12 13:33:56,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-12 13:33:56,144 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:33:56,144 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-12 13:33:56,144 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-12 13:33:56,144 INFO L82 PathProgramCache]: Analyzing trace with hash 675431961, now seen corresponding path program 1 times [2018-04-12 13:33:56,144 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:33:56,144 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:33:56,145 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:33:56,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:33:56,145 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:33:56,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:33:56,152 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:33:56,173 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-12 13:33:56,173 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:33:56,173 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 13:33:56,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 13:33:56,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 13:33:56,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-12 13:33:56,173 INFO L87 Difference]: Start difference. First operand 160 states and 183 transitions. Second operand 5 states. [2018-04-12 13:33:56,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:33:56,243 INFO L93 Difference]: Finished difference Result 177 states and 201 transitions. [2018-04-12 13:33:56,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 13:33:56,244 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-04-12 13:33:56,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:33:56,245 INFO L225 Difference]: With dead ends: 177 [2018-04-12 13:33:56,245 INFO L226 Difference]: Without dead ends: 177 [2018-04-12 13:33:56,245 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-12 13:33:56,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-04-12 13:33:56,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 159. [2018-04-12 13:33:56,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-04-12 13:33:56,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 183 transitions. [2018-04-12 13:33:56,247 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 183 transitions. Word has length 22 [2018-04-12 13:33:56,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:33:56,247 INFO L459 AbstractCegarLoop]: Abstraction has 159 states and 183 transitions. [2018-04-12 13:33:56,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 13:33:56,248 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 183 transitions. [2018-04-12 13:33:56,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-12 13:33:56,248 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:33:56,248 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-12 13:33:56,248 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-12 13:33:56,249 INFO L82 PathProgramCache]: Analyzing trace with hash 675431962, now seen corresponding path program 1 times [2018-04-12 13:33:56,249 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:33:56,249 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:33:56,250 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:33:56,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:33:56,250 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:33:56,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:33:56,260 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:33:56,309 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-12 13:33:56,309 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:33:56,310 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 13:33:56,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 13:33:56,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 13:33:56,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 13:33:56,310 INFO L87 Difference]: Start difference. First operand 159 states and 183 transitions. Second operand 5 states. [2018-04-12 13:33:56,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:33:56,451 INFO L93 Difference]: Finished difference Result 183 states and 208 transitions. [2018-04-12 13:33:56,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 13:33:56,451 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-04-12 13:33:56,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:33:56,452 INFO L225 Difference]: With dead ends: 183 [2018-04-12 13:33:56,452 INFO L226 Difference]: Without dead ends: 183 [2018-04-12 13:33:56,452 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-12 13:33:56,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-04-12 13:33:56,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 161. [2018-04-12 13:33:56,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-04-12 13:33:56,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 184 transitions. [2018-04-12 13:33:56,454 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 184 transitions. Word has length 22 [2018-04-12 13:33:56,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:33:56,454 INFO L459 AbstractCegarLoop]: Abstraction has 161 states and 184 transitions. [2018-04-12 13:33:56,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 13:33:56,455 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 184 transitions. [2018-04-12 13:33:56,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-12 13:33:56,455 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:33:56,455 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-12 13:33:56,455 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-12 13:33:56,455 INFO L82 PathProgramCache]: Analyzing trace with hash -684849302, now seen corresponding path program 1 times [2018-04-12 13:33:56,456 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:33:56,456 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:33:56,456 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:33:56,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:33:56,456 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:33:56,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:33:56,462 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:33:56,480 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-12 13:33:56,480 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:33:56,480 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 13:33:56,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-12 13:33:56,480 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-12 13:33:56,480 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 13:33:56,481 INFO L87 Difference]: Start difference. First operand 161 states and 184 transitions. Second operand 3 states. [2018-04-12 13:33:56,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:33:56,485 INFO L93 Difference]: Finished difference Result 163 states and 186 transitions. [2018-04-12 13:33:56,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-12 13:33:56,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-04-12 13:33:56,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:33:56,486 INFO L225 Difference]: With dead ends: 163 [2018-04-12 13:33:56,486 INFO L226 Difference]: Without dead ends: 163 [2018-04-12 13:33:56,486 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-12 13:33:56,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-04-12 13:33:56,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-04-12 13:33:56,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-04-12 13:33:56,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 186 transitions. [2018-04-12 13:33:56,489 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 186 transitions. Word has length 22 [2018-04-12 13:33:56,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:33:56,489 INFO L459 AbstractCegarLoop]: Abstraction has 163 states and 186 transitions. [2018-04-12 13:33:56,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-12 13:33:56,489 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 186 transitions. [2018-04-12 13:33:56,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-12 13:33:56,489 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:33:56,489 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-12 13:33:56,489 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-12 13:33:56,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1056809095, now seen corresponding path program 1 times [2018-04-12 13:33:56,490 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:33:56,490 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:33:56,490 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:33:56,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:33:56,490 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:33:56,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:33:56,511 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:33:56,566 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-12 13:33:56,566 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:33:56,566 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-12 13:33:56,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 13:33:56,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 13:33:56,567 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-12 13:33:56,567 INFO L87 Difference]: Start difference. First operand 163 states and 186 transitions. Second operand 6 states. [2018-04-12 13:33:56,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:33:56,736 INFO L93 Difference]: Finished difference Result 206 states and 236 transitions. [2018-04-12 13:33:56,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-12 13:33:56,737 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-04-12 13:33:56,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:33:56,738 INFO L225 Difference]: With dead ends: 206 [2018-04-12 13:33:56,738 INFO L226 Difference]: Without dead ends: 206 [2018-04-12 13:33:56,738 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-12 13:33:56,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-04-12 13:33:56,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 179. [2018-04-12 13:33:56,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-04-12 13:33:56,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 207 transitions. [2018-04-12 13:33:56,742 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 207 transitions. Word has length 24 [2018-04-12 13:33:56,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:33:56,743 INFO L459 AbstractCegarLoop]: Abstraction has 179 states and 207 transitions. [2018-04-12 13:33:56,743 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 13:33:56,743 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 207 transitions. [2018-04-12 13:33:56,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-12 13:33:56,744 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:33:56,744 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-12 13:33:56,744 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-12 13:33:56,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1890326275, now seen corresponding path program 1 times [2018-04-12 13:33:56,744 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:33:56,744 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:33:56,745 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:33:56,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:33:56,745 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:33:56,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:33:56,754 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:33:56,779 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-12 13:33:56,779 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:33:56,779 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 13:33:56,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 13:33:56,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 13:33:56,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 13:33:56,780 INFO L87 Difference]: Start difference. First operand 179 states and 207 transitions. Second operand 5 states. [2018-04-12 13:33:56,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:33:56,962 INFO L93 Difference]: Finished difference Result 265 states and 309 transitions. [2018-04-12 13:33:56,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 13:33:56,962 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-04-12 13:33:56,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:33:56,964 INFO L225 Difference]: With dead ends: 265 [2018-04-12 13:33:56,964 INFO L226 Difference]: Without dead ends: 265 [2018-04-12 13:33:56,964 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-12 13:33:56,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-04-12 13:33:56,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 178. [2018-04-12 13:33:56,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-04-12 13:33:56,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 205 transitions. [2018-04-12 13:33:56,969 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 205 transitions. Word has length 25 [2018-04-12 13:33:56,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:33:56,969 INFO L459 AbstractCegarLoop]: Abstraction has 178 states and 205 transitions. [2018-04-12 13:33:56,969 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 13:33:56,969 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 205 transitions. [2018-04-12 13:33:56,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-12 13:33:56,970 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:33:56,970 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-12 13:33:56,970 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-12 13:33:56,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1890326274, now seen corresponding path program 1 times [2018-04-12 13:33:56,970 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:33:56,970 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:33:56,971 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:33:56,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:33:56,971 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:33:56,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:33:56,982 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:33:57,022 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-12 13:33:57,022 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:33:57,022 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 13:33:57,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 13:33:57,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 13:33:57,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 13:33:57,023 INFO L87 Difference]: Start difference. First operand 178 states and 205 transitions. Second operand 5 states. [2018-04-12 13:33:57,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:33:57,250 INFO L93 Difference]: Finished difference Result 310 states and 355 transitions. [2018-04-12 13:33:57,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 13:33:57,251 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-04-12 13:33:57,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:33:57,252 INFO L225 Difference]: With dead ends: 310 [2018-04-12 13:33:57,252 INFO L226 Difference]: Without dead ends: 310 [2018-04-12 13:33:57,252 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-12 13:33:57,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-04-12 13:33:57,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 177. [2018-04-12 13:33:57,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-04-12 13:33:57,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 203 transitions. [2018-04-12 13:33:57,254 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 203 transitions. Word has length 25 [2018-04-12 13:33:57,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:33:57,255 INFO L459 AbstractCegarLoop]: Abstraction has 177 states and 203 transitions. [2018-04-12 13:33:57,255 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 13:33:57,255 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 203 transitions. [2018-04-12 13:33:57,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-12 13:33:57,255 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:33:57,256 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-12 13:33:57,256 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-12 13:33:57,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1446644267, now seen corresponding path program 1 times [2018-04-12 13:33:57,256 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:33:57,256 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:33:57,257 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:33:57,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:33:57,257 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:33:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:33:57,266 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:33:57,423 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-12 13:33:57,423 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:33:57,423 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-12 13:33:57,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-12 13:33:57,424 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-12 13:33:57,424 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-04-12 13:33:57,424 INFO L87 Difference]: Start difference. First operand 177 states and 203 transitions. Second operand 11 states. [2018-04-12 13:33:57,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:33:57,844 INFO L93 Difference]: Finished difference Result 197 states and 226 transitions. [2018-04-12 13:33:57,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-12 13:33:57,845 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-04-12 13:33:57,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:33:57,845 INFO L225 Difference]: With dead ends: 197 [2018-04-12 13:33:57,845 INFO L226 Difference]: Without dead ends: 197 [2018-04-12 13:33:57,846 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-12 13:33:57,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-04-12 13:33:57,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 180. [2018-04-12 13:33:57,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-04-12 13:33:57,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 207 transitions. [2018-04-12 13:33:57,849 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 207 transitions. Word has length 27 [2018-04-12 13:33:57,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:33:57,850 INFO L459 AbstractCegarLoop]: Abstraction has 180 states and 207 transitions. [2018-04-12 13:33:57,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-12 13:33:57,850 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 207 transitions. [2018-04-12 13:33:57,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-12 13:33:57,850 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:33:57,850 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-12 13:33:57,851 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-12 13:33:57,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1446644268, now seen corresponding path program 1 times [2018-04-12 13:33:57,851 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:33:57,851 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:33:57,852 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:33:57,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:33:57,852 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:33:57,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:33:57,862 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:33:58,080 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-12 13:33:58,080 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:33:58,080 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-04-12 13:33:58,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-12 13:33:58,081 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-12 13:33:58,081 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-04-12 13:33:58,081 INFO L87 Difference]: Start difference. First operand 180 states and 207 transitions. Second operand 13 states. [2018-04-12 13:33:58,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:33:58,655 INFO L93 Difference]: Finished difference Result 246 states and 273 transitions. [2018-04-12 13:33:58,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-12 13:33:58,656 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-04-12 13:33:58,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:33:58,657 INFO L225 Difference]: With dead ends: 246 [2018-04-12 13:33:58,657 INFO L226 Difference]: Without dead ends: 246 [2018-04-12 13:33:58,657 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-12 13:33:58,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-04-12 13:33:58,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 196. [2018-04-12 13:33:58,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-04-12 13:33:58,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 230 transitions. [2018-04-12 13:33:58,661 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 230 transitions. Word has length 27 [2018-04-12 13:33:58,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:33:58,661 INFO L459 AbstractCegarLoop]: Abstraction has 196 states and 230 transitions. [2018-04-12 13:33:58,661 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-12 13:33:58,661 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 230 transitions. [2018-04-12 13:33:58,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-12 13:33:58,661 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:33:58,662 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-12 13:33:58,662 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-12 13:33:58,662 INFO L82 PathProgramCache]: Analyzing trace with hash 901181277, now seen corresponding path program 1 times [2018-04-12 13:33:58,662 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:33:58,662 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:33:58,663 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:33:58,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:33:58,663 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:33:58,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:33:58,671 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:33:58,741 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-12 13:33:58,741 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:33:58,742 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-12 13:33:58,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-12 13:33:58,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-12 13:33:58,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-12 13:33:58,742 INFO L87 Difference]: Start difference. First operand 196 states and 230 transitions. Second operand 9 states. [2018-04-12 13:33:59,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:33:59,079 INFO L93 Difference]: Finished difference Result 233 states and 274 transitions. [2018-04-12 13:33:59,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-12 13:33:59,079 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-04-12 13:33:59,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:33:59,080 INFO L225 Difference]: With dead ends: 233 [2018-04-12 13:33:59,080 INFO L226 Difference]: Without dead ends: 233 [2018-04-12 13:33:59,080 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-12 13:33:59,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-04-12 13:33:59,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 195. [2018-04-12 13:33:59,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-04-12 13:33:59,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 228 transitions. [2018-04-12 13:33:59,086 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 228 transitions. Word has length 28 [2018-04-12 13:33:59,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:33:59,086 INFO L459 AbstractCegarLoop]: Abstraction has 195 states and 228 transitions. [2018-04-12 13:33:59,086 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-12 13:33:59,086 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 228 transitions. [2018-04-12 13:33:59,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-12 13:33:59,087 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:33:59,088 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-12 13:33:59,088 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-12 13:33:59,088 INFO L82 PathProgramCache]: Analyzing trace with hash 901181278, now seen corresponding path program 1 times [2018-04-12 13:33:59,088 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:33:59,088 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:33:59,089 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:33:59,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:33:59,089 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:33:59,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:33:59,100 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:33:59,185 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-12 13:33:59,185 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:33:59,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-12 13:33:59,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-12 13:33:59,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-12 13:33:59,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-12 13:33:59,186 INFO L87 Difference]: Start difference. First operand 195 states and 228 transitions. Second operand 9 states. [2018-04-12 13:33:59,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:33:59,596 INFO L93 Difference]: Finished difference Result 232 states and 272 transitions. [2018-04-12 13:33:59,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-12 13:33:59,596 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-04-12 13:33:59,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:33:59,597 INFO L225 Difference]: With dead ends: 232 [2018-04-12 13:33:59,597 INFO L226 Difference]: Without dead ends: 232 [2018-04-12 13:33:59,597 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-12 13:33:59,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-04-12 13:33:59,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 194. [2018-04-12 13:33:59,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-04-12 13:33:59,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 226 transitions. [2018-04-12 13:33:59,601 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 226 transitions. Word has length 28 [2018-04-12 13:33:59,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:33:59,601 INFO L459 AbstractCegarLoop]: Abstraction has 194 states and 226 transitions. [2018-04-12 13:33:59,601 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-12 13:33:59,601 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 226 transitions. [2018-04-12 13:33:59,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-12 13:33:59,601 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:33:59,602 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-12 13:33:59,602 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-12 13:33:59,602 INFO L82 PathProgramCache]: Analyzing trace with hash -2057254630, now seen corresponding path program 1 times [2018-04-12 13:33:59,602 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:33:59,602 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:33:59,603 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:33:59,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:33:59,603 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:33:59,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:33:59,610 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:33:59,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:33:59,643 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:33:59,643 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 13:33:59,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 13:33:59,643 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 13:33:59,643 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 13:33:59,644 INFO L87 Difference]: Start difference. First operand 194 states and 226 transitions. Second operand 5 states. [2018-04-12 13:33:59,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:33:59,804 INFO L93 Difference]: Finished difference Result 278 states and 324 transitions. [2018-04-12 13:33:59,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 13:33:59,805 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-12 13:33:59,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:33:59,806 INFO L225 Difference]: With dead ends: 278 [2018-04-12 13:33:59,806 INFO L226 Difference]: Without dead ends: 278 [2018-04-12 13:33:59,806 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-12 13:33:59,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-04-12 13:33:59,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 193. [2018-04-12 13:33:59,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-04-12 13:33:59,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 224 transitions. [2018-04-12 13:33:59,810 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 224 transitions. Word has length 29 [2018-04-12 13:33:59,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:33:59,810 INFO L459 AbstractCegarLoop]: Abstraction has 193 states and 224 transitions. [2018-04-12 13:33:59,810 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 13:33:59,810 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 224 transitions. [2018-04-12 13:33:59,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-12 13:33:59,811 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:33:59,811 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-12 13:33:59,811 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-12 13:33:59,811 INFO L82 PathProgramCache]: Analyzing trace with hash -2057254629, now seen corresponding path program 1 times [2018-04-12 13:33:59,811 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:33:59,811 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:33:59,812 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:33:59,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:33:59,812 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:33:59,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:33:59,819 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:33:59,859 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-12 13:33:59,859 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:33:59,859 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 13:33:59,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 13:33:59,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 13:33:59,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 13:33:59,860 INFO L87 Difference]: Start difference. First operand 193 states and 224 transitions. Second operand 5 states. [2018-04-12 13:34:00,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:34:00,124 INFO L93 Difference]: Finished difference Result 342 states and 397 transitions. [2018-04-12 13:34:00,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 13:34:00,125 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-12 13:34:00,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:34:00,126 INFO L225 Difference]: With dead ends: 342 [2018-04-12 13:34:00,126 INFO L226 Difference]: Without dead ends: 342 [2018-04-12 13:34:00,127 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-12 13:34:00,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-04-12 13:34:00,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 192. [2018-04-12 13:34:00,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-04-12 13:34:00,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 222 transitions. [2018-04-12 13:34:00,130 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 222 transitions. Word has length 29 [2018-04-12 13:34:00,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:34:00,130 INFO L459 AbstractCegarLoop]: Abstraction has 192 states and 222 transitions. [2018-04-12 13:34:00,131 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 13:34:00,131 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 222 transitions. [2018-04-12 13:34:00,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-12 13:34:00,131 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:34:00,131 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-12 13:34:00,131 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-12 13:34:00,132 INFO L82 PathProgramCache]: Analyzing trace with hash 952419245, now seen corresponding path program 1 times [2018-04-12 13:34:00,132 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:34:00,132 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:34:00,132 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:34:00,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:34:00,133 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:34:00,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:34:00,139 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:34:00,151 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-12 13:34:00,151 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:34:00,151 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 13:34:00,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 13:34:00,152 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 13:34:00,152 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 13:34:00,152 INFO L87 Difference]: Start difference. First operand 192 states and 222 transitions. Second operand 4 states. [2018-04-12 13:34:00,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:34:00,243 INFO L93 Difference]: Finished difference Result 222 states and 256 transitions. [2018-04-12 13:34:00,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 13:34:00,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-04-12 13:34:00,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:34:00,244 INFO L225 Difference]: With dead ends: 222 [2018-04-12 13:34:00,244 INFO L226 Difference]: Without dead ends: 222 [2018-04-12 13:34:00,245 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-12 13:34:00,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-04-12 13:34:00,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 191. [2018-04-12 13:34:00,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-04-12 13:34:00,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 220 transitions. [2018-04-12 13:34:00,248 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 220 transitions. Word has length 31 [2018-04-12 13:34:00,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:34:00,249 INFO L459 AbstractCegarLoop]: Abstraction has 191 states and 220 transitions. [2018-04-12 13:34:00,249 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 13:34:00,249 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 220 transitions. [2018-04-12 13:34:00,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-12 13:34:00,249 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:34:00,249 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-12 13:34:00,249 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-12 13:34:00,250 INFO L82 PathProgramCache]: Analyzing trace with hash 952419246, now seen corresponding path program 1 times [2018-04-12 13:34:00,250 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:34:00,250 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:34:00,250 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:34:00,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:34:00,251 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:34:00,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:34:00,258 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:34:00,277 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-12 13:34:00,278 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:34:00,278 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 13:34:00,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 13:34:00,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 13:34:00,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 13:34:00,279 INFO L87 Difference]: Start difference. First operand 191 states and 220 transitions. Second operand 4 states. [2018-04-12 13:34:00,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:34:00,394 INFO L93 Difference]: Finished difference Result 252 states and 286 transitions. [2018-04-12 13:34:00,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 13:34:00,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-04-12 13:34:00,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:34:00,396 INFO L225 Difference]: With dead ends: 252 [2018-04-12 13:34:00,396 INFO L226 Difference]: Without dead ends: 252 [2018-04-12 13:34:00,396 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-12 13:34:00,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-04-12 13:34:00,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 189. [2018-04-12 13:34:00,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-04-12 13:34:00,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 216 transitions. [2018-04-12 13:34:00,400 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 216 transitions. Word has length 31 [2018-04-12 13:34:00,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:34:00,400 INFO L459 AbstractCegarLoop]: Abstraction has 189 states and 216 transitions. [2018-04-12 13:34:00,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 13:34:00,400 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 216 transitions. [2018-04-12 13:34:00,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-12 13:34:00,401 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:34:00,401 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-12 13:34:00,401 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-12 13:34:00,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1510720002, now seen corresponding path program 1 times [2018-04-12 13:34:00,401 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:34:00,401 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:34:00,402 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:34:00,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:34:00,402 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:34:00,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:34:00,410 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:34:00,473 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-12 13:34:00,474 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:34:00,474 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-12 13:34:00,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-12 13:34:00,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-12 13:34:00,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-12 13:34:00,475 INFO L87 Difference]: Start difference. First operand 189 states and 216 transitions. Second operand 9 states. [2018-04-12 13:34:00,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:34:00,786 INFO L93 Difference]: Finished difference Result 196 states and 225 transitions. [2018-04-12 13:34:00,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-12 13:34:00,788 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-04-12 13:34:00,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:34:00,789 INFO L225 Difference]: With dead ends: 196 [2018-04-12 13:34:00,789 INFO L226 Difference]: Without dead ends: 196 [2018-04-12 13:34:00,789 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-12 13:34:00,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-04-12 13:34:00,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 188. [2018-04-12 13:34:00,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-04-12 13:34:00,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 215 transitions. [2018-04-12 13:34:00,792 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 215 transitions. Word has length 32 [2018-04-12 13:34:00,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:34:00,792 INFO L459 AbstractCegarLoop]: Abstraction has 188 states and 215 transitions. [2018-04-12 13:34:00,792 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-12 13:34:00,792 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 215 transitions. [2018-04-12 13:34:00,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-12 13:34:00,793 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:34:00,793 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-12 13:34:00,793 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-12 13:34:00,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1510720003, now seen corresponding path program 1 times [2018-04-12 13:34:00,793 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:34:00,793 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:34:00,794 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:34:00,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:34:00,794 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:34:00,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:34:00,802 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:34:00,879 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-12 13:34:00,880 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:34:00,880 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-12 13:34:00,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-12 13:34:00,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-12 13:34:00,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-12 13:34:00,880 INFO L87 Difference]: Start difference. First operand 188 states and 215 transitions. Second operand 9 states. [2018-04-12 13:34:01,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:34:01,161 INFO L93 Difference]: Finished difference Result 195 states and 224 transitions. [2018-04-12 13:34:01,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-12 13:34:01,162 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-04-12 13:34:01,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:34:01,162 INFO L225 Difference]: With dead ends: 195 [2018-04-12 13:34:01,163 INFO L226 Difference]: Without dead ends: 195 [2018-04-12 13:34:01,163 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-12 13:34:01,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-04-12 13:34:01,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 187. [2018-04-12 13:34:01,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-04-12 13:34:01,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 214 transitions. [2018-04-12 13:34:01,166 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 214 transitions. Word has length 32 [2018-04-12 13:34:01,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:34:01,166 INFO L459 AbstractCegarLoop]: Abstraction has 187 states and 214 transitions. [2018-04-12 13:34:01,166 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-12 13:34:01,166 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 214 transitions. [2018-04-12 13:34:01,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-12 13:34:01,167 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:34:01,167 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-12 13:34:01,167 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-12 13:34:01,167 INFO L82 PathProgramCache]: Analyzing trace with hash 862110831, now seen corresponding path program 1 times [2018-04-12 13:34:01,167 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:34:01,167 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:34:01,168 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:34:01,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:34:01,168 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:34:01,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:34:01,174 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:34:01,187 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-12 13:34:01,188 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:34:01,188 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 13:34:01,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 13:34:01,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 13:34:01,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 13:34:01,188 INFO L87 Difference]: Start difference. First operand 187 states and 214 transitions. Second operand 4 states. [2018-04-12 13:34:01,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:34:01,274 INFO L93 Difference]: Finished difference Result 205 states and 233 transitions. [2018-04-12 13:34:01,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 13:34:01,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-04-12 13:34:01,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:34:01,275 INFO L225 Difference]: With dead ends: 205 [2018-04-12 13:34:01,275 INFO L226 Difference]: Without dead ends: 205 [2018-04-12 13:34:01,276 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-12 13:34:01,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-04-12 13:34:01,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 186. [2018-04-12 13:34:01,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-04-12 13:34:01,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 212 transitions. [2018-04-12 13:34:01,279 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 212 transitions. Word has length 33 [2018-04-12 13:34:01,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:34:01,279 INFO L459 AbstractCegarLoop]: Abstraction has 186 states and 212 transitions. [2018-04-12 13:34:01,279 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 13:34:01,279 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 212 transitions. [2018-04-12 13:34:01,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-12 13:34:01,280 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:34:01,280 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-12 13:34:01,280 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-12 13:34:01,280 INFO L82 PathProgramCache]: Analyzing trace with hash 862110832, now seen corresponding path program 1 times [2018-04-12 13:34:01,280 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:34:01,280 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:34:01,281 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:34:01,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:34:01,281 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:34:01,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:34:01,317 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:34:01,336 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-12 13:34:01,336 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:34:01,336 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 13:34:01,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 13:34:01,336 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 13:34:01,336 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 13:34:01,337 INFO L87 Difference]: Start difference. First operand 186 states and 212 transitions. Second operand 4 states. [2018-04-12 13:34:01,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:34:01,460 INFO L93 Difference]: Finished difference Result 230 states and 256 transitions. [2018-04-12 13:34:01,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 13:34:01,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-04-12 13:34:01,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:34:01,461 INFO L225 Difference]: With dead ends: 230 [2018-04-12 13:34:01,461 INFO L226 Difference]: Without dead ends: 230 [2018-04-12 13:34:01,461 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-12 13:34:01,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-04-12 13:34:01,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 184. [2018-04-12 13:34:01,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-04-12 13:34:01,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 208 transitions. [2018-04-12 13:34:01,465 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 208 transitions. Word has length 33 [2018-04-12 13:34:01,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:34:01,465 INFO L459 AbstractCegarLoop]: Abstraction has 184 states and 208 transitions. [2018-04-12 13:34:01,465 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 13:34:01,465 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 208 transitions. [2018-04-12 13:34:01,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-12 13:34:01,466 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:34:01,466 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-12 13:34:01,466 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-12 13:34:01,466 INFO L82 PathProgramCache]: Analyzing trace with hash -746127005, now seen corresponding path program 1 times [2018-04-12 13:34:01,466 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:34:01,466 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:34:01,467 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:34:01,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:34:01,467 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:34:01,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:34:01,474 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:34:01,506 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-12 13:34:01,506 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:34:01,506 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-12 13:34:01,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:34:01,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:34:01,553 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:34:01,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 13:34:01,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-12 13:34:01,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:34:01,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:34:01,594 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-12 13:34:01,595 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-12 13:34:01,595 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:34:01,603 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:34:01,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:34:01,606 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-04-12 13:34:01,613 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-12 13:34:01,615 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:34:01,617 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-12 13:34:01,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:34:01,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:34:01,637 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-12 13:34:01,639 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:34:01,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-12 13:34:01,641 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:34:01,645 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:34:01,650 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-12 13:34:01,650 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2018-04-12 13:34:01,655 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-12 13:34:01,656 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-12 13:34:01,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:34:01,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:34:01,667 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-12 13:34:01,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-12 13:34:01,669 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:34:01,670 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:34:01,672 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-12 13:34:01,672 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-04-12 13:34:01,678 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-12 13:34:01,698 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 13:34:01,698 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-04-12 13:34:01,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 13:34:01,699 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 13:34:01,699 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 13:34:01,699 INFO L87 Difference]: Start difference. First operand 184 states and 208 transitions. Second operand 5 states. [2018-04-12 13:34:01,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:34:01,867 INFO L93 Difference]: Finished difference Result 197 states and 222 transitions. [2018-04-12 13:34:01,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 13:34:01,867 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-04-12 13:34:01,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:34:01,868 INFO L225 Difference]: With dead ends: 197 [2018-04-12 13:34:01,868 INFO L226 Difference]: Without dead ends: 197 [2018-04-12 13:34:01,869 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-12 13:34:01,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-04-12 13:34:01,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 191. [2018-04-12 13:34:01,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-04-12 13:34:01,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 216 transitions. [2018-04-12 13:34:01,872 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 216 transitions. Word has length 36 [2018-04-12 13:34:01,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:34:01,873 INFO L459 AbstractCegarLoop]: Abstraction has 191 states and 216 transitions. [2018-04-12 13:34:01,873 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 13:34:01,873 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 216 transitions. [2018-04-12 13:34:01,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-12 13:34:01,873 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:34:01,873 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-12 13:34:01,873 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-12 13:34:01,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1655100458, now seen corresponding path program 1 times [2018-04-12 13:34:01,874 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:34:01,874 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:34:01,874 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:34:01,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:34:01,875 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:34:01,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:34:01,889 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:34:02,222 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-12 13:34:02,222 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:34:02,223 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-12 13:34:02,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:34:02,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:34:02,262 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:34:02,397 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-12 13:34:02,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-12 13:34:02,399 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:34:02,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:34:02,409 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-12 13:34:02,409 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:47 [2018-04-12 13:34:02,497 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-12 13:34:02,503 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-12 13:34:02,505 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-12 13:34:02,519 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-12 13:34:02,544 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-12 13:34:02,544 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:56 [2018-04-12 13:34:02,823 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-12 13:34:02,833 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-12 13:34:02,852 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 13:34:02,852 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 24 [2018-04-12 13:34:02,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-12 13:34:02,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-12 13:34:02,852 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=499, Unknown=5, NotChecked=44, Total=600 [2018-04-12 13:34:02,853 INFO L87 Difference]: Start difference. First operand 191 states and 216 transitions. Second operand 25 states. [2018-04-12 13:34:04,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:34:04,076 INFO L93 Difference]: Finished difference Result 224 states and 251 transitions. [2018-04-12 13:34:04,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-12 13:34:04,076 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 37 [2018-04-12 13:34:04,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:34:04,077 INFO L225 Difference]: With dead ends: 224 [2018-04-12 13:34:04,077 INFO L226 Difference]: Without dead ends: 217 [2018-04-12 13:34:04,077 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=154, Invalid=1101, Unknown=9, NotChecked=68, Total=1332 [2018-04-12 13:34:04,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-04-12 13:34:04,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 209. [2018-04-12 13:34:04,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-04-12 13:34:04,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 235 transitions. [2018-04-12 13:34:04,080 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 235 transitions. Word has length 37 [2018-04-12 13:34:04,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:34:04,080 INFO L459 AbstractCegarLoop]: Abstraction has 209 states and 235 transitions. [2018-04-12 13:34:04,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-12 13:34:04,080 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 235 transitions. [2018-04-12 13:34:04,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-12 13:34:04,080 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:34:04,080 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-12 13:34:04,080 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-12 13:34:04,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1326396508, now seen corresponding path program 1 times [2018-04-12 13:34:04,081 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:34:04,081 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:34:04,081 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:34:04,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:34:04,081 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:34:04,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:34:04,091 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:34:04,137 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-12 13:34:04,138 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:34:04,138 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-12 13:34:04,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-12 13:34:04,138 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-12 13:34:04,138 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-12 13:34:04,139 INFO L87 Difference]: Start difference. First operand 209 states and 235 transitions. Second operand 8 states. [2018-04-12 13:34:04,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:34:04,351 INFO L93 Difference]: Finished difference Result 229 states and 256 transitions. [2018-04-12 13:34:04,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-12 13:34:04,351 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-04-12 13:34:04,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:34:04,352 INFO L225 Difference]: With dead ends: 229 [2018-04-12 13:34:04,352 INFO L226 Difference]: Without dead ends: 229 [2018-04-12 13:34:04,352 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-12 13:34:04,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-04-12 13:34:04,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 218. [2018-04-12 13:34:04,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-04-12 13:34:04,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 248 transitions. [2018-04-12 13:34:04,356 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 248 transitions. Word has length 42 [2018-04-12 13:34:04,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:34:04,356 INFO L459 AbstractCegarLoop]: Abstraction has 218 states and 248 transitions. [2018-04-12 13:34:04,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-12 13:34:04,356 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 248 transitions. [2018-04-12 13:34:04,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-12 13:34:04,357 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:34:04,357 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-12 13:34:04,357 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-12 13:34:04,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1326396509, now seen corresponding path program 1 times [2018-04-12 13:34:04,357 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:34:04,357 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:34:04,358 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:34:04,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:34:04,358 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:34:04,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:34:04,366 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:34:04,415 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-12 13:34:04,415 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:34:04,415 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 13:34:04,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 13:34:04,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 13:34:04,415 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 13:34:04,416 INFO L87 Difference]: Start difference. First operand 218 states and 248 transitions. Second operand 5 states. [2018-04-12 13:34:04,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:34:04,602 INFO L93 Difference]: Finished difference Result 282 states and 312 transitions. [2018-04-12 13:34:04,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 13:34:04,602 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-04-12 13:34:04,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:34:04,603 INFO L225 Difference]: With dead ends: 282 [2018-04-12 13:34:04,604 INFO L226 Difference]: Without dead ends: 282 [2018-04-12 13:34:04,604 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-12 13:34:04,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-04-12 13:34:04,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 220. [2018-04-12 13:34:04,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-04-12 13:34:04,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 248 transitions. [2018-04-12 13:34:04,608 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 248 transitions. Word has length 42 [2018-04-12 13:34:04,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:34:04,608 INFO L459 AbstractCegarLoop]: Abstraction has 220 states and 248 transitions. [2018-04-12 13:34:04,608 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 13:34:04,608 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 248 transitions. [2018-04-12 13:34:04,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-12 13:34:04,609 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:34:04,609 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-12 13:34:04,609 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-12 13:34:04,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1155279748, now seen corresponding path program 1 times [2018-04-12 13:34:04,609 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:34:04,609 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:34:04,610 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:34:04,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:34:04,610 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:34:04,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:34:04,619 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:34:04,663 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-12 13:34:04,664 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:34:04,664 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-12 13:34:04,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-12 13:34:04,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-12 13:34:04,664 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-12 13:34:04,664 INFO L87 Difference]: Start difference. First operand 220 states and 248 transitions. Second operand 7 states. [2018-04-12 13:34:04,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:34:04,985 INFO L93 Difference]: Finished difference Result 269 states and 299 transitions. [2018-04-12 13:34:04,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-12 13:34:04,985 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2018-04-12 13:34:04,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:34:04,986 INFO L225 Difference]: With dead ends: 269 [2018-04-12 13:34:04,986 INFO L226 Difference]: Without dead ends: 269 [2018-04-12 13:34:04,986 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-12 13:34:04,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-04-12 13:34:04,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 230. [2018-04-12 13:34:04,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-04-12 13:34:04,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 264 transitions. [2018-04-12 13:34:04,989 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 264 transitions. Word has length 42 [2018-04-12 13:34:04,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:34:04,990 INFO L459 AbstractCegarLoop]: Abstraction has 230 states and 264 transitions. [2018-04-12 13:34:04,990 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-12 13:34:04,990 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 264 transitions. [2018-04-12 13:34:04,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-12 13:34:04,990 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:34:04,990 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-12 13:34:04,990 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-12 13:34:04,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1155279747, now seen corresponding path program 1 times [2018-04-12 13:34:04,991 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:34:04,991 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:34:04,992 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:34:04,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:34:04,992 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:34:05,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:34:05,002 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:34:05,051 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-12 13:34:05,052 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:34:05,052 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 13:34:05,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 13:34:05,052 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 13:34:05,052 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 13:34:05,052 INFO L87 Difference]: Start difference. First operand 230 states and 264 transitions. Second operand 5 states. [2018-04-12 13:34:05,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:34:05,255 INFO L93 Difference]: Finished difference Result 319 states and 354 transitions. [2018-04-12 13:34:05,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 13:34:05,255 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-04-12 13:34:05,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:34:05,256 INFO L225 Difference]: With dead ends: 319 [2018-04-12 13:34:05,256 INFO L226 Difference]: Without dead ends: 319 [2018-04-12 13:34:05,257 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-12 13:34:05,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-04-12 13:34:05,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 221. [2018-04-12 13:34:05,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-04-12 13:34:05,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 251 transitions. [2018-04-12 13:34:05,260 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 251 transitions. Word has length 42 [2018-04-12 13:34:05,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:34:05,260 INFO L459 AbstractCegarLoop]: Abstraction has 221 states and 251 transitions. [2018-04-12 13:34:05,260 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 13:34:05,261 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 251 transitions. [2018-04-12 13:34:05,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-12 13:34:05,261 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:34:05,261 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-12 13:34:05,261 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-12 13:34:05,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1831380995, now seen corresponding path program 1 times [2018-04-12 13:34:05,262 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:34:05,262 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:34:05,262 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:34:05,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:34:05,262 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:34:05,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:34:05,269 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:34:05,296 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-12 13:34:05,296 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:34:05,296 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-12 13:34:05,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 13:34:05,297 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 13:34:05,297 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 13:34:05,297 INFO L87 Difference]: Start difference. First operand 221 states and 251 transitions. Second operand 5 states. [2018-04-12 13:34:05,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:34:05,355 INFO L93 Difference]: Finished difference Result 303 states and 341 transitions. [2018-04-12 13:34:05,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 13:34:05,355 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-04-12 13:34:05,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:34:05,356 INFO L225 Difference]: With dead ends: 303 [2018-04-12 13:34:05,356 INFO L226 Difference]: Without dead ends: 303 [2018-04-12 13:34:05,357 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-12 13:34:05,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-04-12 13:34:05,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 227. [2018-04-12 13:34:05,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-04-12 13:34:05,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 258 transitions. [2018-04-12 13:34:05,360 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 258 transitions. Word has length 43 [2018-04-12 13:34:05,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:34:05,361 INFO L459 AbstractCegarLoop]: Abstraction has 227 states and 258 transitions. [2018-04-12 13:34:05,361 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 13:34:05,361 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 258 transitions. [2018-04-12 13:34:05,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-12 13:34:05,361 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:34:05,361 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-12 13:34:05,362 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-12 13:34:05,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1453933603, now seen corresponding path program 1 times [2018-04-12 13:34:05,362 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:34:05,362 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:34:05,363 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:34:05,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:34:05,363 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:34:05,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:34:05,370 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:34:05,389 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-12 13:34:05,389 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:34:05,389 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-12 13:34:05,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 13:34:05,389 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 13:34:05,390 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 13:34:05,390 INFO L87 Difference]: Start difference. First operand 227 states and 258 transitions. Second operand 5 states. [2018-04-12 13:34:05,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:34:05,452 INFO L93 Difference]: Finished difference Result 316 states and 349 transitions. [2018-04-12 13:34:05,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 13:34:05,453 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-04-12 13:34:05,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:34:05,454 INFO L225 Difference]: With dead ends: 316 [2018-04-12 13:34:05,454 INFO L226 Difference]: Without dead ends: 316 [2018-04-12 13:34:05,454 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-12 13:34:05,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-04-12 13:34:05,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 221. [2018-04-12 13:34:05,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-04-12 13:34:05,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 250 transitions. [2018-04-12 13:34:05,457 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 250 transitions. Word has length 43 [2018-04-12 13:34:05,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:34:05,458 INFO L459 AbstractCegarLoop]: Abstraction has 221 states and 250 transitions. [2018-04-12 13:34:05,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 13:34:05,458 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 250 transitions. [2018-04-12 13:34:05,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-12 13:34:05,458 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:34:05,458 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-12 13:34:05,459 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-12 13:34:05,459 INFO L82 PathProgramCache]: Analyzing trace with hash 2140724876, now seen corresponding path program 1 times [2018-04-12 13:34:05,459 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:34:05,459 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:34:05,460 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:34:05,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:34:05,460 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:34:05,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:34:05,472 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:34:05,620 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-12 13:34:05,621 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:34:05,621 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-12 13:34:05,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:34:05,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:34:05,657 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:34:05,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12 13:34:05,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 10 treesize of output 9 [2018-04-12 13:34:05,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:34:05,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:34:05,678 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-12 13:34:05,679 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-12 13:34:05,679 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:34:05,680 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:34:05,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:34:05,683 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2018-04-12 13:34:05,705 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:34:05,706 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:34:05,706 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-12 13:34:05,707 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:34:05,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:34:05,713 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:36 [2018-04-12 13:34:05,744 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-12 13:34:05,752 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-12 13:34:05,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 13:34:05,763 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 13:34:05,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 21 treesize of output 19 [2018-04-12 13:34:05,785 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-12 13:34:05,785 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-12 13:34:05,793 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 13:34:05,808 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-12 13:34:05,809 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:58, output treesize:156 [2018-04-12 13:34:05,882 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:34:05,885 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-12 13:34:05,888 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-12 13:34:05,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:34:05,898 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:34:05,930 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:34:05,938 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-12 13:34:05,942 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-12 13:34:05,942 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:34:05,954 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:34:05,982 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-12 13:34:05,984 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-12 13:34:05,984 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 13:34:05,993 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:34:06,016 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:34:06,020 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-12 13:34:06,021 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-12 13:34:06,021 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 13:34:06,029 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:34:06,047 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-12 13:34:06,048 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:152, output treesize:120 [2018-04-12 13:34:06,147 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-12 13:34:06,150 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-12 13:34:06,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:34:06,159 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:34:06,194 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-12 13:34:06,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12 13:34:06,198 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:34:06,209 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:34:06,240 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-12 13:34:06,245 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-12 13:34:06,245 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 13:34:06,256 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:34:06,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12 13:34:06,282 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-12 13:34:06,282 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 13:34:06,289 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:34:06,307 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-12 13:34:06,308 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 9 variables, input treesize:209, output treesize:173 [2018-04-12 13:34:12,393 WARN L151 SmtUtils]: Spent 2028ms on a formula simplification. DAG size of input: 62 DAG size of output 55 [2018-04-12 13:34:12,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 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-12 13:34:12,456 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-12 13:34:12,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:34:12,466 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-12 13:34:12,466 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 13:34:12,473 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:34:12,491 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-12 13:34:12,493 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-12 13:34:12,493 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 13:34:12,500 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-12 13:34:12,500 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 13:34:12,504 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:34:12,517 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-12 13:34:12,518 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:183, output treesize:120 [2018-04-12 13:34:12,652 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-12 13:34:12,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 13:34:12,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:34:12,658 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-12 13:34:12,658 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 13:34:12,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:34:12,663 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-12 13:34:12,663 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:51, output treesize:15 [2018-04-12 13:34:12,753 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-12 13:34:12,772 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 13:34:12,772 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16] total 26 [2018-04-12 13:34:12,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-12 13:34:12,772 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-12 13:34:12,772 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=574, Unknown=2, NotChecked=0, Total=650 [2018-04-12 13:34:12,773 INFO L87 Difference]: Start difference. First operand 221 states and 250 transitions. Second operand 26 states. [2018-04-12 13:34:49,847 WARN L151 SmtUtils]: Spent 10111ms on a formula simplification. DAG size of input: 139 DAG size of output 57 [2018-04-12 13:35:06,003 WARN L151 SmtUtils]: Spent 10071ms on a formula simplification. DAG size of input: 125 DAG size of output 53 [2018-04-12 13:35:16,135 WARN L151 SmtUtils]: Spent 10081ms on a formula simplification. DAG size of input: 129 DAG size of output 57 [2018-04-12 13:35:32,553 WARN L151 SmtUtils]: Spent 10116ms on a formula simplification. DAG size of input: 133 DAG size of output 55 [2018-04-12 13:35:42,745 WARN L151 SmtUtils]: Spent 10121ms on a formula simplification. DAG size of input: 137 DAG size of output 60 [2018-04-12 13:35:54,903 WARN L151 SmtUtils]: Spent 12102ms on a formula simplification. DAG size of input: 142 DAG size of output 62 [2018-04-12 13:35:55,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:35:55,779 INFO L93 Difference]: Finished difference Result 344 states and 402 transitions. [2018-04-12 13:35:55,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-12 13:35:55,779 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2018-04-12 13:35:55,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:35:55,780 INFO L225 Difference]: With dead ends: 344 [2018-04-12 13:35:55,780 INFO L226 Difference]: Without dead ends: 344 [2018-04-12 13:35:55,780 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 96.6s TimeCoverageRelationStatistics Valid=786, Invalid=2859, Unknown=15, NotChecked=0, Total=3660 [2018-04-12 13:35:55,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-04-12 13:35:55,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 247. [2018-04-12 13:35:55,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-04-12 13:35:55,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 282 transitions. [2018-04-12 13:35:55,783 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 282 transitions. Word has length 48 [2018-04-12 13:35:55,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:35:55,784 INFO L459 AbstractCegarLoop]: Abstraction has 247 states and 282 transitions. [2018-04-12 13:35:55,784 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-12 13:35:55,784 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 282 transitions. [2018-04-12 13:35:55,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-12 13:35:55,784 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:35:55,784 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-12 13:35:55,784 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-12 13:35:55,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1839300468, now seen corresponding path program 1 times [2018-04-12 13:35:55,785 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:35:55,785 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:35:55,785 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:35:55,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:35:55,786 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:35:55,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:35:55,796 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:35:56,006 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-12 13:35:56,006 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:35:56,007 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-12 13:35:56,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:35:56,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:35:56,044 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:35:56,205 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:35:56,205 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:35:56,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-12 13:35:56,206 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:35:56,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:35:56,214 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:34 [2018-04-12 13:35:56,235 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-12 13:35:56,236 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:35:56,237 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-12 13:35:56,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:35:56,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:35:56,256 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-12 13:35:56,257 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:35:56,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12 13:35:56,258 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:35:56,261 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:35:56,268 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-12 13:35:56,268 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:57, output treesize:46 [2018-04-12 13:35:56,324 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:35:56,327 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-12 13:35:56,329 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-12 13:35:56,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:35:56,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:35:56,347 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:35:56,351 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-12 13:35:56,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 13:35:56,352 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:35:56,357 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:35:56,366 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-12 13:35:56,367 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:92, output treesize:72 [2018-04-12 13:35:56,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 80 [2018-04-12 13:35:56,450 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-12 13:35:56,450 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:35:56,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:35:56,473 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-12 13:35:56,476 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-12 13:35:56,476 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:35:56,481 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:35:56,490 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-12 13:35:56,491 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:116, output treesize:96 [2018-04-12 13:36:02,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 46 [2018-04-12 13:36:02,617 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-12 13:36:02,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:36:02,626 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:36:02,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, 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-12 13:36:02,628 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-12 13:36:02,631 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-12 13:36:02,640 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-12 13:36:02,641 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-12 13:36:02,642 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 13:36:02,646 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:36:02,646 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-12 13:36:02,647 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 13:36:02,649 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:36:02,653 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-12 13:36:02,653 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:84, output treesize:7 [2018-04-12 13:36:02,666 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-12 13:36:02,684 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 13:36:02,684 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 29 [2018-04-12 13:36:02,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-12 13:36:02,685 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-12 13:36:02,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=686, Unknown=3, NotChecked=0, Total=812 [2018-04-12 13:36:02,685 INFO L87 Difference]: Start difference. First operand 247 states and 282 transitions. Second operand 29 states. [2018-04-12 13:36:40,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:36:40,533 INFO L93 Difference]: Finished difference Result 351 states and 408 transitions. [2018-04-12 13:36:40,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-12 13:36:40,533 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 48 [2018-04-12 13:36:40,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:36:40,534 INFO L225 Difference]: With dead ends: 351 [2018-04-12 13:36:40,534 INFO L226 Difference]: Without dead ends: 351 [2018-04-12 13:36:40,535 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-12 13:36:40,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-04-12 13:36:40,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 286. [2018-04-12 13:36:40,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-04-12 13:36:40,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 331 transitions. [2018-04-12 13:36:40,537 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 331 transitions. Word has length 48 [2018-04-12 13:36:40,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:36:40,537 INFO L459 AbstractCegarLoop]: Abstraction has 286 states and 331 transitions. [2018-04-12 13:36:40,537 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-12 13:36:40,537 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 331 transitions. [2018-04-12 13:36:40,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-12 13:36:40,538 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:36:40,538 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-12 13:36:40,538 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-12 13:36:40,538 INFO L82 PathProgramCache]: Analyzing trace with hash 920609223, now seen corresponding path program 1 times [2018-04-12 13:36:40,538 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:36:40,538 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:36:40,539 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:36:40,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:36:40,539 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:36:40,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:36:40,549 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:36:40,945 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-12 13:36:40,945 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:36:40,945 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-12 13:36:40,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:36:40,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:36:40,967 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:36:40,993 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-12 13:36:40,996 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-12 13:36:40,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:36:40,998 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:36:41,004 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-12 13:36:41,005 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-12 13:36:41,005 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:36:41,006 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:36:41,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:36:41,010 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-04-12 13:36:41,020 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:36:41,020 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:36:41,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-12 13:36:41,021 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:36:41,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:36:41,027 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:29 [2018-04-12 13:36:41,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-04-12 13:36:41,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 13:36:41,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:36:41,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:36:41,105 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-12 13:36:41,107 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-12 13:36:41,107 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:36:41,110 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:36:41,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:36:41,119 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:54, output treesize:46 [2018-04-12 13:36:41,171 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-12 13:36:41,174 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:36:41,175 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-12 13:36:41,176 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:36:41,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:36:41,193 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-12 13:36:41,196 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:36:41,196 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-12 13:36:41,197 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:36:41,201 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:36:41,211 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-12 13:36:41,211 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:65, output treesize:66 [2018-04-12 13:36:41,567 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:36:41,567 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 13:36:41,569 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-12 13:36:41,570 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:36:41,571 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:36:41,571 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 13:36:41,573 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-12 13:36:41,573 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-12 13:36:41,583 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-12 13:36:41,584 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-12 13:36:41,588 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-12 13:36:41,601 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-12 13:36:41,603 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:36:41,603 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-12 13:36:41,603 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 13:36:41,611 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-12 13:36:41,611 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-12 13:36:41,614 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 13:36:41,616 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-12 13:36:41,617 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:36:41,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-12 13:36:41,618 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 13:36:41,622 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:36:41,622 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-12 13:36:41,622 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-12 13:36:41,624 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:36:41,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-12 13:36:41,634 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:95, output treesize:34 [2018-04-12 13:36:41,691 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-12 13:36:41,708 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-12 13:36:41,708 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [25] total 37 [2018-04-12 13:36:41,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-12 13:36:41,709 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-12 13:36:41,709 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1207, Unknown=9, NotChecked=0, Total=1332 [2018-04-12 13:36:41,709 INFO L87 Difference]: Start difference. First operand 286 states and 331 transitions. Second operand 37 states. [2018-04-12 13:36:44,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:36:44,888 INFO L93 Difference]: Finished difference Result 320 states and 368 transitions. [2018-04-12 13:36:44,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-12 13:36:44,889 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 49 [2018-04-12 13:36:44,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:36:44,889 INFO L225 Difference]: With dead ends: 320 [2018-04-12 13:36:44,889 INFO L226 Difference]: Without dead ends: 311 [2018-04-12 13:36:44,890 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=503, Invalid=3015, Unknown=22, NotChecked=0, Total=3540 [2018-04-12 13:36:44,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-04-12 13:36:44,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 284. [2018-04-12 13:36:44,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-04-12 13:36:44,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 328 transitions. [2018-04-12 13:36:44,893 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 328 transitions. Word has length 49 [2018-04-12 13:36:44,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:36:44,893 INFO L459 AbstractCegarLoop]: Abstraction has 284 states and 328 transitions. [2018-04-12 13:36:44,893 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-12 13:36:44,893 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 328 transitions. [2018-04-12 13:36:44,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-12 13:36:44,893 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:36:44,893 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-12 13:36:44,893 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-12 13:36:44,894 INFO L82 PathProgramCache]: Analyzing trace with hash -2072224345, now seen corresponding path program 1 times [2018-04-12 13:36:44,894 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:36:44,894 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:36:44,894 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:36:44,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:36:44,895 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:36:44,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:36:44,905 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:36:45,307 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-12 13:36:45,307 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:36:45,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 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-12 13:36:45,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:36:45,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:36:45,341 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:36:45,345 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-12 13:36:45,347 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-12 13:36:45,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:36:45,352 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:36:45,358 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-12 13:36:45,359 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-12 13:36:45,359 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:36:45,360 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:36:45,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:36:45,364 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2018-04-12 13:36:45,370 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-12 13:36:45,371 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:36:45,372 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-12 13:36:45,372 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:36:45,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:36:45,382 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-12 13:36:45,383 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:36:45,383 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-12 13:36:45,383 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:36:45,386 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:36:45,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:36:45,391 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2018-04-12 13:36:45,412 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:36:45,413 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:36:45,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-12 13:36:45,414 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:36:45,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:36:45,420 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:43 [2018-04-12 13:36:45,471 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-12 13:36:45,473 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-12 13:36:45,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:36:45,476 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:36:45,489 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-12 13:36:45,490 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-12 13:36:45,491 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:36:45,494 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:36:45,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:36:45,504 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:68, output treesize:60 [2018-04-12 13:36:45,538 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-12 13:36:45,541 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:36:45,541 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-12 13:36:45,541 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:36:45,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:36:45,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 35 treesize of output 34 [2018-04-12 13:36:45,567 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:36:45,568 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-12 13:36:45,568 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:36:45,573 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:36:45,582 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-12 13:36:45,582 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:79, output treesize:92 [2018-04-12 13:36:45,968 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:36:45,969 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 13:36:45,970 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-12 13:36:45,973 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:36:45,973 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:36:45,974 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 13:36:45,975 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-12 13:36:45,976 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-12 13:36:45,994 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-12 13:36:45,995 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-12 13:36:46,003 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-12 13:36:46,035 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-12 13:36:46,044 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-12 13:36:46,044 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-12 13:36:46,054 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:36:46,054 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-12 13:36:46,054 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 13:36:46,060 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 13:36:46,062 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-12 13:36:46,065 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-12 13:36:46,065 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 13:36:46,071 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:36:46,072 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-12 13:36:46,072 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-12 13:36:46,076 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:36:46,092 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-12 13:36:46,092 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:117, output treesize:38 [2018-04-12 13:36:46,156 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-12 13:36:46,173 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-12 13:36:46,174 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [22] total 33 [2018-04-12 13:36:46,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-12 13:36:46,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-12 13:36:46,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=971, Unknown=2, NotChecked=0, Total=1056 [2018-04-12 13:36:46,174 INFO L87 Difference]: Start difference. First operand 284 states and 328 transitions. Second operand 33 states. [2018-04-12 13:36:49,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:36:49,550 INFO L93 Difference]: Finished difference Result 307 states and 352 transitions. [2018-04-12 13:36:49,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-12 13:36:49,550 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 49 [2018-04-12 13:36:49,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:36:49,551 INFO L225 Difference]: With dead ends: 307 [2018-04-12 13:36:49,551 INFO L226 Difference]: Without dead ends: 275 [2018-04-12 13:36:49,551 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=354, Invalid=2398, Unknown=4, NotChecked=0, Total=2756 [2018-04-12 13:36:49,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-04-12 13:36:49,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 268. [2018-04-12 13:36:49,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-04-12 13:36:49,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 311 transitions. [2018-04-12 13:36:49,553 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 311 transitions. Word has length 49 [2018-04-12 13:36:49,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:36:49,553 INFO L459 AbstractCegarLoop]: Abstraction has 268 states and 311 transitions. [2018-04-12 13:36:49,553 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-12 13:36:49,553 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 311 transitions. [2018-04-12 13:36:49,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-12 13:36:49,554 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:36:49,554 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-12 13:36:49,554 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-12 13:36:49,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1631945112, now seen corresponding path program 1 times [2018-04-12 13:36:49,554 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:36:49,554 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:36:49,555 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:36:49,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:36:49,555 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:36:49,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:36:49,568 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:36:49,737 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-12 13:36:49,738 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:36:49,738 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-12 13:36:49,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:36:49,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:36:49,761 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:36:49,789 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:36:49,789 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:36:49,789 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-12 13:36:49,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:36:49,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:36:49,795 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-12 13:36:49,808 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-12 13:36:49,809 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-12 13:36:49,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:36:49,810 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:36:49,817 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-12 13:36:49,817 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:36 [2018-04-12 13:36:49,845 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:36:49,848 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-12 13:36:49,849 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-12 13:36:49,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:36:49,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:36:49,859 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-12 13:36:49,859 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:49 [2018-04-12 13:36:49,906 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-12 13:36:49,909 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-12 13:36:49,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:36:49,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:36:49,919 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-12 13:36:49,919 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:58 [2018-04-12 13:36:55,953 WARN L151 SmtUtils]: Spent 2011ms on a formula simplification. DAG size of input: 28 DAG size of output 24 [2018-04-12 13:36:58,013 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-12 13:36:58,016 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-12 13:36:58,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:36:58,022 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 13:36:58,023 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-12 13:36:58,023 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 13:36:58,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:36:58,033 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-12 13:36:58,034 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:60, output treesize:15 [2018-04-12 13:36:58,095 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-12 13:36:58,113 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 13:36:58,114 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 27 [2018-04-12 13:36:58,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-12 13:36:58,114 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-12 13:36:58,114 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=631, Unknown=3, NotChecked=0, Total=756 [2018-04-12 13:36:58,114 INFO L87 Difference]: Start difference. First operand 268 states and 311 transitions. Second operand 28 states. [2018-04-12 13:37:55,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:37:55,631 INFO L93 Difference]: Finished difference Result 681 states and 830 transitions. [2018-04-12 13:37:55,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-12 13:37:55,632 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 56 [2018-04-12 13:37:55,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:37:55,633 INFO L225 Difference]: With dead ends: 681 [2018-04-12 13:37:55,633 INFO L226 Difference]: Without dead ends: 681 [2018-04-12 13:37:55,634 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 52.9s TimeCoverageRelationStatistics Valid=539, Invalid=1598, Unknown=25, NotChecked=0, Total=2162 [2018-04-12 13:37:55,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2018-04-12 13:37:55,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 315. [2018-04-12 13:37:55,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-04-12 13:37:55,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 381 transitions. [2018-04-12 13:37:55,637 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 381 transitions. Word has length 56 [2018-04-12 13:37:55,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:37:55,637 INFO L459 AbstractCegarLoop]: Abstraction has 315 states and 381 transitions. [2018-04-12 13:37:55,637 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-12 13:37:55,637 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 381 transitions. [2018-04-12 13:37:55,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-12 13:37:55,637 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:37:55,637 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-12 13:37:55,637 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-12 13:37:55,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1631945113, now seen corresponding path program 1 times [2018-04-12 13:37:55,638 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:37:55,638 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:37:55,638 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:37:55,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:37:55,638 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:37:55,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:37:55,648 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:37:55,912 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-12 13:37:55,912 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:37:55,937 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-12 13:37:55,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:37:55,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:37:55,965 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:37:56,027 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-12 13:37:56,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:37:56,035 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:37:56,036 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:37:56,036 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-12 13:37:56,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:37:56,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:37:56,042 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-04-12 13:37:56,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12 13:37:56,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-12 13:37:56,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:37:56,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:37:56,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, 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-12 13:37:56,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-12 13:37:56,080 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:37:56,081 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:37:56,088 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-12 13:37:56,088 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:40 [2018-04-12 13:37:56,109 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-12 13:37:56,111 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-12 13:37:56,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:37:56,116 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:37:56,129 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-12 13:37:56,131 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-12 13:37:56,131 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:37:56,135 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:37:56,145 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-12 13:37:56,145 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:86, output treesize:66 [2018-04-12 13:37:56,212 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-12 13:37:56,223 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-12 13:37:56,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:37:56,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:37:56,243 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-12 13:37:56,245 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-12 13:37:56,245 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:37:56,249 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:37:56,256 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-12 13:37:56,257 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:110, output treesize:90 [2018-04-12 13:38:02,310 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-12 13:38:02,311 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-12 13:38:02,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:38:02,317 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-12 13:38:02,318 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 13:38:02,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:38:02,328 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-12 13:38:02,330 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-12 13:38:02,330 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 13:38:02,334 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-12 13:38:02,334 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 13:38:02,347 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:38:02,350 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-12 13:38:02,350 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:65, output treesize:9 [2018-04-12 13:38:02,370 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-12 13:38:02,388 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 13:38:02,388 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 20 [2018-04-12 13:38:02,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-12 13:38:02,389 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-12 13:38:02,389 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=331, Unknown=3, NotChecked=0, Total=420 [2018-04-12 13:38:02,389 INFO L87 Difference]: Start difference. First operand 315 states and 381 transitions. Second operand 21 states. [2018-04-12 13:38:03,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:38:03,373 INFO L93 Difference]: Finished difference Result 639 states and 774 transitions. [2018-04-12 13:38:03,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-12 13:38:03,373 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 56 [2018-04-12 13:38:03,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:38:03,375 INFO L225 Difference]: With dead ends: 639 [2018-04-12 13:38:03,375 INFO L226 Difference]: Without dead ends: 639 [2018-04-12 13:38:03,375 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-12 13:38:03,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2018-04-12 13:38:03,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 349. [2018-04-12 13:38:03,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-04-12 13:38:03,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 423 transitions. [2018-04-12 13:38:03,379 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 423 transitions. Word has length 56 [2018-04-12 13:38:03,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:38:03,380 INFO L459 AbstractCegarLoop]: Abstraction has 349 states and 423 transitions. [2018-04-12 13:38:03,380 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-12 13:38:03,380 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 423 transitions. [2018-04-12 13:38:03,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-12 13:38:03,380 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:38:03,380 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-12 13:38:03,380 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-12 13:38:03,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1626219474, now seen corresponding path program 1 times [2018-04-12 13:38:03,381 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:38:03,381 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:38:03,381 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:38:03,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:38:03,382 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:38:03,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:38:03,393 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:38:03,634 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-12 13:38:03,634 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:38:03,634 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-12 13:38:03,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:38:03,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:38:03,664 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:38:03,675 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:38:03,675 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:38:03,676 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-12 13:38:03,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:38:03,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:38:03,680 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-12 13:38:03,695 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-12 13:38:03,696 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-12 13:38:03,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:38:03,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:38:03,703 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-12 13:38:03,703 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2018-04-12 13:38:03,726 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-12 13:38:03,727 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-12 13:38:03,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:38:03,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:38:03,736 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-12 13:38:03,736 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2018-04-12 13:38:03,827 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 13:38:03,836 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-12 13:38:03,839 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-12 13:38:03,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:38:03,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:38:03,859 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-12 13:38:03,859 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:53 [2018-04-12 13:38:09,898 WARN L151 SmtUtils]: Spent 2013ms on a formula simplification. DAG size of input: 30 DAG size of output 26 [2018-04-12 13:38:09,902 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:38:09,902 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:38:09,903 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:38:09,903 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-12 13:38:09,904 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:38:09,913 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-12 13:38:09,914 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:59 [2018-04-12 13:38:09,944 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-12 13:38:09,945 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:38:09,946 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-12 13:38:09,946 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:38:09,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:38:09,960 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-12 13:38:09,960 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:72, output treesize:77 [2018-04-12 13:38:10,022 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:38:10,023 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:38:10,029 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-12 13:38:10,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-12 13:38:10,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:38:10,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:38:10,047 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-12 13:38:10,047 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:100, output treesize:90 [2018-04-12 13:38:10,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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-12 13:38:10,137 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-12 13:38:10,137 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:38:10,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:38:10,154 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-12 13:38:10,155 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:109, output treesize:99 [2018-04-12 13:38:16,228 WARN L151 SmtUtils]: Spent 2048ms on a formula simplification. DAG size of input: 40 DAG size of output 36 [2018-04-12 13:38:18,265 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-12 13:38:18,267 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-12 13:38:18,267 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-12 13:38:18,274 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-12 13:38:18,275 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 13:38:18,280 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-12 13:38:18,280 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:38:18,285 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-12 13:38:18,289 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-12 13:38:18,289 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:93, output treesize:28 [2018-04-12 13:38:18,393 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-12 13:38:18,410 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 13:38:18,411 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 31 [2018-04-12 13:38:18,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-12 13:38:18,411 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-12 13:38:18,411 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=790, Unknown=5, NotChecked=0, Total=992 [2018-04-12 13:38:18,411 INFO L87 Difference]: Start difference. First operand 349 states and 423 transitions. Second operand 32 states. [2018-04-12 13:38:34,818 WARN L151 SmtUtils]: Spent 2027ms on a formula simplification. DAG size of input: 43 DAG size of output 35 [2018-04-12 13:39:05,490 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 74 DAG size of output 56 [2018-04-12 13:39:40,271 WARN L151 SmtUtils]: Spent 2051ms on a formula simplification. DAG size of input: 58 DAG size of output 49 [2018-04-12 13:39:54,793 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 57 DAG size of output 50 [2018-04-12 13:40:13,120 WARN L151 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 55 DAG size of output 50 [2018-04-12 13:40:17,264 WARN L151 SmtUtils]: Spent 2091ms on a formula simplification. DAG size of input: 63 DAG size of output 52 [2018-04-12 13:40:30,044 WARN L151 SmtUtils]: Spent 231ms on a formula simplification. DAG size of input: 64 DAG size of output 50 [2018-04-12 13:41:17,233 WARN L151 SmtUtils]: Spent 2045ms on a formula simplification. DAG size of input: 64 DAG size of output 53 [2018-04-12 13:42:01,838 WARN L151 SmtUtils]: Spent 185ms on a formula simplification. DAG size of input: 69 DAG size of output 51 [2018-04-12 13:42:06,607 WARN L151 SmtUtils]: Spent 149ms on a formula simplification. DAG size of input: 65 DAG size of output 51 [2018-04-12 13:42:06,923 WARN L151 SmtUtils]: Spent 297ms on a formula simplification. DAG size of input: 40 DAG size of output 30 [2018-04-12 13:42:32,253 WARN L151 SmtUtils]: Spent 2024ms on a formula simplification. DAG size of input: 52 DAG size of output 42 [2018-04-12 13:42:38,839 WARN L151 SmtUtils]: Spent 376ms on a formula simplification. DAG size of input: 48 DAG size of output 38 [2018-04-12 13:42:39,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:42:39,113 INFO L93 Difference]: Finished difference Result 1863 states and 2348 transitions. [2018-04-12 13:42:39,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-04-12 13:42:39,113 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 56 [2018-04-12 13:42:39,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:42:39,116 INFO L225 Difference]: With dead ends: 1863 [2018-04-12 13:42:39,116 INFO L226 Difference]: Without dead ends: 1863 [2018-04-12 13:42:39,118 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4998 ImplicationChecksByTransitivity, 227.0s TimeCoverageRelationStatistics Valid=2955, Invalid=11462, Unknown=103, NotChecked=0, Total=14520 [2018-04-12 13:42:39,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1863 states. [2018-04-12 13:42:39,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1863 to 485. [2018-04-12 13:42:39,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2018-04-12 13:42:39,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 618 transitions. [2018-04-12 13:42:39,125 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 618 transitions. Word has length 56 [2018-04-12 13:42:39,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:42:39,125 INFO L459 AbstractCegarLoop]: Abstraction has 485 states and 618 transitions. [2018-04-12 13:42:39,125 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-12 13:42:39,125 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 618 transitions. [2018-04-12 13:42:39,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-12 13:42:39,125 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:42:39,126 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-12 13:42:39,126 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-12 13:42:39,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1626219475, now seen corresponding path program 1 times [2018-04-12 13:42:39,126 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:42:39,126 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:42:39,126 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:42:39,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:42:39,126 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:42:39,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:42:39,134 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:42:39,325 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-12 13:42:39,325 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:42:39,325 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-12 13:42:39,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:42:39,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:42:39,350 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:42:39,355 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-12 13:42:39,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:42:39,363 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:42:39,363 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:42:39,363 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-12 13:42:39,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:42:39,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:42:39,370 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-12 13:42:39,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12 13:42:39,390 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-12 13:42:39,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:42:39,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:42:39,401 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-12 13:42:39,402 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-12 13:42:39,402 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:42:39,403 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:42:39,410 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-12 13:42:39,410 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:53, output treesize:45 [2018-04-12 13:42:39,447 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:42:39,449 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-12 13:42:39,451 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-12 13:42:39,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:42:39,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:42:39,464 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:42:39,468 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-12 13:42:39,469 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-12 13:42:39,470 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:42:39,475 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:42:39,488 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-12 13:42:39,488 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:83, output treesize:67 [2018-04-12 13:42:39,546 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 13:42:39,547 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:42:39,554 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-12 13:42:39,557 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-12 13:42:39,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:42:39,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:42:39,581 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:42:39,584 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-12 13:42:39,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-04-12 13:42:39,586 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:42:39,591 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:42:39,602 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-12 13:42:39,603 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:109, output treesize:93 [2018-04-12 13:42:43,656 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:42:43,656 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-12 13:42:43,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:42:43,674 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:42:43,675 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:42:43,676 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:42:43,676 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-12 13:42:43,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:42:43,687 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-12 13:42:43,687 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:82, output treesize:74 [2018-04-12 13:42:43,714 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:42:43,718 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-12 13:42:43,720 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:42:43,721 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-12 13:42:43,721 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:42:43,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:42:43,748 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-12 13:42:43,749 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:42:43,750 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-12 13:42:43,751 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:42:43,756 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:42:43,768 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-12 13:42:43,768 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:100, output treesize:92 [2018-04-12 13:42:43,832 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:42:43,833 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:42:43,838 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-12 13:42:43,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 13:42:43,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:42:43,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:42:43,862 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:42:43,863 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:42:43,870 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-12 13:42:43,872 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-12 13:42:43,872 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:42:43,884 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:42:43,897 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-12 13:42:43,898 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:138, output treesize:118 [2018-04-12 13:42:44,064 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-12 13:42:44,066 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-12 13:42:44,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:42:44,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:42:44,094 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-12 13:42:44,097 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-12 13:42:44,097 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:42:44,109 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:42:44,121 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-12 13:42:44,122 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:162, output treesize:142 [2018-04-12 13:42:50,283 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-12 13:42:50,285 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-12 13:42:50,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:42:50,297 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-12 13:42:50,298 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-12 13:42:50,307 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-12 13:42:50,307 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:42:50,314 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-12 13:42:50,325 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-12 13:42:50,326 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-12 13:42:50,326 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 13:42:50,332 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-12 13:42:50,332 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 13:42:50,335 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-12 13:42:50,336 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 13:42:50,337 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:42:50,341 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-12 13:42:50,341 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:130, output treesize:18 [2018-04-12 13:42:50,456 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-12 13:42:50,473 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 13:42:50,474 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 31 [2018-04-12 13:42:50,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-12 13:42:50,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-12 13:42:50,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=835, Unknown=5, NotChecked=0, Total=992 [2018-04-12 13:42:50,474 INFO L87 Difference]: Start difference. First operand 485 states and 618 transitions. Second operand 32 states. [2018-04-12 13:42:52,787 WARN L151 SmtUtils]: Spent 2027ms on a formula simplification. DAG size of input: 61 DAG size of output 52 [2018-04-12 13:42:56,189 WARN L151 SmtUtils]: Spent 2037ms on a formula simplification. DAG size of input: 73 DAG size of output 59 [2018-04-12 13:42:59,429 WARN L151 SmtUtils]: Spent 2039ms on a formula simplification. DAG size of input: 70 DAG size of output 56 [2018-04-12 13:42:59,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:42:59,934 INFO L93 Difference]: Finished difference Result 1378 states and 1729 transitions. [2018-04-12 13:42:59,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-04-12 13:42:59,934 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 56 [2018-04-12 13:42:59,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:42:59,937 INFO L225 Difference]: With dead ends: 1378 [2018-04-12 13:42:59,937 INFO L226 Difference]: Without dead ends: 1378 [2018-04-12 13:42:59,938 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1956 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=1151, Invalid=5324, Unknown=5, NotChecked=0, Total=6480 [2018-04-12 13:42:59,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2018-04-12 13:42:59,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 499. [2018-04-12 13:42:59,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2018-04-12 13:42:59,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 637 transitions. [2018-04-12 13:42:59,943 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 637 transitions. Word has length 56 [2018-04-12 13:42:59,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:42:59,943 INFO L459 AbstractCegarLoop]: Abstraction has 499 states and 637 transitions. [2018-04-12 13:42:59,943 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-12 13:42:59,944 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 637 transitions. [2018-04-12 13:42:59,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-12 13:42:59,944 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:42:59,944 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-12 13:42:59,944 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-12 13:42:59,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1865966095, now seen corresponding path program 1 times [2018-04-12 13:42:59,944 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:42:59,944 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:42:59,945 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:42:59,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:42:59,945 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:42:59,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:42:59,961 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:43:00,274 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-12 13:43:00,274 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:43:00,275 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-04-12 13:43:00,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-12 13:43:00,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-12 13:43:00,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2018-04-12 13:43:00,275 INFO L87 Difference]: Start difference. First operand 499 states and 637 transitions. Second operand 21 states. [2018-04-12 13:43:01,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:43:01,195 INFO L93 Difference]: Finished difference Result 798 states and 997 transitions. [2018-04-12 13:43:01,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-12 13:43:01,195 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 61 [2018-04-12 13:43:01,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:43:01,197 INFO L225 Difference]: With dead ends: 798 [2018-04-12 13:43:01,197 INFO L226 Difference]: Without dead ends: 798 [2018-04-12 13:43:01,197 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=315, Invalid=1325, Unknown=0, NotChecked=0, Total=1640 [2018-04-12 13:43:01,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2018-04-12 13:43:01,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 565. [2018-04-12 13:43:01,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2018-04-12 13:43:01,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 719 transitions. [2018-04-12 13:43:01,201 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 719 transitions. Word has length 61 [2018-04-12 13:43:01,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:43:01,201 INFO L459 AbstractCegarLoop]: Abstraction has 565 states and 719 transitions. [2018-04-12 13:43:01,201 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-12 13:43:01,201 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 719 transitions. [2018-04-12 13:43:01,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-12 13:43:01,202 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:43:01,202 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-12 13:43:01,202 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-12 13:43:01,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1069104113, now seen corresponding path program 1 times [2018-04-12 13:43:01,202 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:43:01,202 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:43:01,203 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:43:01,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:43:01,203 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:43:01,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:43:01,212 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:43:01,583 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-12 13:43:01,583 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:43:01,583 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-04-12 13:43:01,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-12 13:43:01,584 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-12 13:43:01,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2018-04-12 13:43:01,584 INFO L87 Difference]: Start difference. First operand 565 states and 719 transitions. Second operand 22 states. [2018-04-12 13:43:02,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:43:02,647 INFO L93 Difference]: Finished difference Result 916 states and 1146 transitions. [2018-04-12 13:43:02,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-12 13:43:02,648 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 61 [2018-04-12 13:43:02,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:43:02,649 INFO L225 Difference]: With dead ends: 916 [2018-04-12 13:43:02,649 INFO L226 Difference]: Without dead ends: 915 [2018-04-12 13:43:02,650 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=366, Invalid=1614, Unknown=0, NotChecked=0, Total=1980 [2018-04-12 13:43:02,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2018-04-12 13:43:02,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 633. [2018-04-12 13:43:02,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2018-04-12 13:43:02,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 804 transitions. [2018-04-12 13:43:02,655 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 804 transitions. Word has length 61 [2018-04-12 13:43:02,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:43:02,655 INFO L459 AbstractCegarLoop]: Abstraction has 633 states and 804 transitions. [2018-04-12 13:43:02,655 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-12 13:43:02,655 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 804 transitions. [2018-04-12 13:43:02,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-12 13:43:02,656 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:43:02,656 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-12 13:43:02,656 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-12 13:43:02,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1218577044, now seen corresponding path program 2 times [2018-04-12 13:43:02,656 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:43:02,656 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:43:02,657 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:43:02,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:43:02,657 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:43:02,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:43:02,665 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:43:02,967 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-12 13:43:02,967 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:43:02,967 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-12 13:43:02,978 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-12 13:43:03,005 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-12 13:43:03,005 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 13:43:03,007 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:43:03,041 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:43:03,041 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:43:03,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 13:43:03,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:43:03,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:43:03,046 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-12 13:43:03,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12 13:43:03,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-12 13:43:03,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:43:03,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:43:03,077 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-12 13:43:03,078 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-12 13:43:03,078 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:43:03,079 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:43:03,083 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-12 13:43:03,084 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:40, output treesize:20 [2018-04-12 13:43:03,115 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:43:03,119 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-12 13:43:03,121 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-12 13:43:03,121 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:43:03,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:43:03,134 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-12 13:43:03,135 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-12 13:43:03,136 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:43:03,139 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:43:03,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:43:03,144 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:78, output treesize:58 [2018-04-12 13:43:03,187 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-12 13:43:03,190 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-12 13:43:03,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:43:03,196 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:43:03,206 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-12 13:43:03,207 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-12 13:43:03,208 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:43:03,212 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:43:03,217 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-12 13:43:03,217 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:102, output treesize:82 [2018-04-12 13:43:09,309 WARN L148 SmtUtils]: Spent 2006ms on a formula simplification that was a NOOP. DAG size: 29 [2018-04-12 13:43:13,405 WARN L148 SmtUtils]: Spent 2006ms on a formula simplification that was a NOOP. DAG size: 28 [2018-04-12 13:43:13,514 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-12 13:43:13,515 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-12 13:43:13,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:43:13,520 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-12 13:43:13,521 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-12 13:43:13,525 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-12 13:43:13,530 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-12 13:43:13,532 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-12 13:43:13,532 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 13:43:13,534 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:43:13,536 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-12 13:43:13,536 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:95, output treesize:7 [2018-04-12 13:43:13,552 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-12 13:43:13,570 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 13:43:13,570 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 31 [2018-04-12 13:43:13,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-12 13:43:13,571 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-12 13:43:13,571 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=790, Unknown=6, NotChecked=0, Total=930 [2018-04-12 13:43:13,571 INFO L87 Difference]: Start difference. First operand 633 states and 804 transitions. Second operand 31 states. [2018-04-12 13:43:17,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:43:17,299 INFO L93 Difference]: Finished difference Result 944 states and 1178 transitions. [2018-04-12 13:43:17,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-12 13:43:17,300 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 66 [2018-04-12 13:43:17,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:43:17,301 INFO L225 Difference]: With dead ends: 944 [2018-04-12 13:43:17,301 INFO L226 Difference]: Without dead ends: 944 [2018-04-12 13:43:17,302 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 53 SyntacticMatches, 6 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 771 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=638, Invalid=2547, Unknown=7, NotChecked=0, Total=3192 [2018-04-12 13:43:17,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2018-04-12 13:43:17,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 632. [2018-04-12 13:43:17,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2018-04-12 13:43:17,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 800 transitions. [2018-04-12 13:43:17,306 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 800 transitions. Word has length 66 [2018-04-12 13:43:17,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:43:17,307 INFO L459 AbstractCegarLoop]: Abstraction has 632 states and 800 transitions. [2018-04-12 13:43:17,307 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-12 13:43:17,307 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 800 transitions. [2018-04-12 13:43:17,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-12 13:43:17,307 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:43:17,307 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-12 13:43:17,307 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-12 13:43:17,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1175150810, now seen corresponding path program 1 times [2018-04-12 13:43:17,307 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:43:17,307 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:43:17,308 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:43:17,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-12 13:43:17,308 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:43:17,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:43:17,317 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:43:17,834 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-12 13:43:17,834 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:43:17,835 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-12 13:43:17,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:43:17,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:43:17,861 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:43:17,865 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:43:17,866 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:43:17,866 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-12 13:43:17,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:43:17,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:43:17,871 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-12 13:43:17,890 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-12 13:43:17,891 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-12 13:43:17,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:43:17,892 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:43:17,901 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-12 13:43:17,902 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-12 13:43:17,902 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:43:17,903 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:43:17,909 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-12 13:43:17,909 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:48, output treesize:29 [2018-04-12 13:43:17,950 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:43:17,953 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-12 13:43:17,954 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-12 13:43:17,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:43:17,957 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:43:17,965 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:43:17,968 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-12 13:43:17,970 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-12 13:43:17,970 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:43:17,976 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:43:17,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:43:17,982 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:59 [2018-04-12 13:43:18,023 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-12 13:43:18,025 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-12 13:43:18,026 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:43:18,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:43:18,052 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-12 13:43:18,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12 13:43:18,054 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:43:18,060 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:43:18,069 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-12 13:43:18,069 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:101, output treesize:85 [2018-04-12 13:43:26,141 WARN L148 SmtUtils]: Spent 2009ms on a formula simplification that was a NOOP. DAG size: 37 [2018-04-12 13:43:26,145 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:43:26,146 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:43:26,146 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:43:26,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 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-12 13:43:26,147 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:43:26,158 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-12 13:43:26,159 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:90, output treesize:83 [2018-04-12 13:43:30,186 WARN L148 SmtUtils]: Spent 2008ms on a formula simplification that was a NOOP. DAG size: 36 [2018-04-12 13:43:30,196 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-12 13:43:30,199 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:43:30,201 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-12 13:43:30,201 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:43:30,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:43:30,241 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-12 13:43:30,244 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:43:30,244 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-12 13:43:30,244 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:43:30,255 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:43:30,266 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-12 13:43:30,266 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:109, output treesize:95 [2018-04-12 13:43:32,308 WARN L148 SmtUtils]: Spent 2009ms on a formula simplification that was a NOOP. DAG size: 37 [2018-04-12 13:43:34,343 WARN L148 SmtUtils]: Spent 2010ms on a formula simplification that was a NOOP. DAG size: 41 [2018-04-12 13:43:34,347 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:43:34,348 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:43:34,355 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-12 13:43:34,357 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-12 13:43:34,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:43:34,370 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:43:34,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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-12 13:43:34,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 13:43:34,397 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:43:34,404 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:43:34,415 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-12 13:43:34,415 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:141, output treesize:121 [2018-04-12 13:43:36,476 WARN L148 SmtUtils]: Spent 2037ms on a formula simplification that was a NOOP. DAG size: 46 [2018-04-12 13:43:38,586 WARN L148 SmtUtils]: Spent 2084ms on a formula simplification that was a NOOP. DAG size: 44 [2018-04-12 13:43:38,594 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-12 13:43:38,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12 13:43:38,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:43:38,604 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:43:38,624 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-12 13:43:38,626 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-12 13:43:38,626 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:43:38,638 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:43:38,650 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-12 13:43:38,650 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:165, output treesize:145 [2018-04-12 13:43:46,762 WARN L151 SmtUtils]: Spent 4063ms on a formula simplification. DAG size of input: 50 DAG size of output 43 [2018-04-12 13:43:50,803 WARN L148 SmtUtils]: Spent 2009ms on a formula simplification that was a NOOP. DAG size: 43 [2018-04-12 13:43:50,963 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-12 13:43:50,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 59 [2018-04-12 13:43:50,965 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-12 13:43:50,979 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-12 13:43:50,979 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 13:43:50,988 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-12 13:43:50,988 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:43:50,995 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-12 13:43:51,004 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-12 13:43:51,005 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-12 13:43:51,006 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 13:43:51,009 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-12 13:43:51,010 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 13:43:51,011 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:43:51,014 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-12 13:43:51,014 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:149, output treesize:7 [2018-04-12 13:43:51,046 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-12 13:43:51,063 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 13:43:51,063 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 34 [2018-04-12 13:43:51,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-12 13:43:51,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-12 13:43:51,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=970, Unknown=10, NotChecked=0, Total=1122 [2018-04-12 13:43:51,064 INFO L87 Difference]: Start difference. First operand 632 states and 800 transitions. Second operand 34 states. [2018-04-12 13:44:00,129 WARN L151 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 102 DAG size of output 63 [2018-04-12 13:44:33,095 WARN L148 SmtUtils]: Spent 2031ms on a formula simplification that was a NOOP. DAG size: 47 [2018-04-12 13:44:33,724 WARN L151 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 141 DAG size of output 89 [2018-04-12 13:44:35,808 WARN L148 SmtUtils]: Spent 2025ms on a formula simplification that was a NOOP. DAG size: 83 [2018-04-12 13:44:37,962 WARN L148 SmtUtils]: Spent 2026ms on a formula simplification that was a NOOP. DAG size: 87 [2018-04-12 13:44:40,138 WARN L148 SmtUtils]: Spent 2121ms on a formula simplification that was a NOOP. DAG size: 89 [2018-04-12 13:44:42,187 WARN L148 SmtUtils]: Spent 2019ms on a formula simplification that was a NOOP. DAG size: 49 [2018-04-12 13:44:54,742 WARN L151 SmtUtils]: Spent 4037ms on a formula simplification. DAG size of input: 99 DAG size of output 59 [2018-04-12 13:44:58,981 WARN L151 SmtUtils]: Spent 4037ms on a formula simplification. DAG size of input: 101 DAG size of output 61 [2018-04-12 13:45:03,233 WARN L151 SmtUtils]: Spent 4082ms on a formula simplification. DAG size of input: 105 DAG size of output 82 [2018-04-12 13:45:13,347 WARN L151 SmtUtils]: Spent 4044ms on a formula simplification. DAG size of input: 108 DAG size of output 65 [2018-04-12 13:45:13,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:45:13,632 INFO L93 Difference]: Finished difference Result 988 states and 1233 transitions. [2018-04-12 13:45:13,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-12 13:45:13,632 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2018-04-12 13:45:13,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:45:13,634 INFO L225 Difference]: With dead ends: 988 [2018-04-12 13:45:13,634 INFO L226 Difference]: Without dead ends: 988 [2018-04-12 13:45:13,635 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1503 ImplicationChecksByTransitivity, 99.5s TimeCoverageRelationStatistics Valid=815, Invalid=4411, Unknown=30, NotChecked=0, Total=5256 [2018-04-12 13:45:13,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2018-04-12 13:45:13,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 743. [2018-04-12 13:45:13,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 743 states. [2018-04-12 13:45:13,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 946 transitions. [2018-04-12 13:45:13,640 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 946 transitions. Word has length 66 [2018-04-12 13:45:13,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:45:13,640 INFO L459 AbstractCegarLoop]: Abstraction has 743 states and 946 transitions. [2018-04-12 13:45:13,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-12 13:45:13,640 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 946 transitions. [2018-04-12 13:45:13,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-12 13:45:13,641 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:45:13,641 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-12 13:45:13,641 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-12 13:45:13,641 INFO L82 PathProgramCache]: Analyzing trace with hash 748616595, now seen corresponding path program 1 times [2018-04-12 13:45:13,641 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:45:13,641 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:45:13,642 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:45:13,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:45:13,642 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:45:13,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:45:13,659 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:45:14,028 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-12 13:45:14,028 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:45:14,028 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-12 13:45:14,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:45:14,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:45:14,062 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:45:14,105 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:45:14,106 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:45:14,106 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-12 13:45:14,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:45:14,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:45:14,111 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-12 13:45:14,128 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-12 13:45:14,129 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-12 13:45:14,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:45:14,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:45:14,136 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-12 13:45:14,136 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:36 [2018-04-12 13:45:14,152 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-12 13:45:14,154 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-12 13:45:14,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:45:14,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:45:14,166 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-12 13:45:14,166 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:49 [2018-04-12 13:45:14,213 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-12 13:45:14,215 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-12 13:45:14,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:45:14,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:45:14,224 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-12 13:45:14,224 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:58 [2018-04-12 13:45:20,254 WARN L151 SmtUtils]: Spent 2011ms on a formula simplification. DAG size of input: 28 DAG size of output 24 [2018-04-12 13:45:22,286 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:45:22,287 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:45:22,287 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:45:22,288 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-12 13:45:22,288 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:45:22,306 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-12 13:45:22,306 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:70 [2018-04-12 13:45:22,346 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-12 13:45:22,349 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:45:22,349 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-12 13:45:22,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:45:22,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:45:22,375 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-12 13:45:22,375 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:82 [2018-04-12 13:45:22,454 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:45:22,455 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:45:22,461 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-12 13:45:22,463 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-12 13:45:22,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:45:22,470 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:45:22,481 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-12 13:45:22,482 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:101, output treesize:93 [2018-04-12 13:45:22,612 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-12 13:45:22,614 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-12 13:45:22,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:45:22,623 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:45:22,634 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-12 13:45:22,634 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:111, output treesize:103 [2018-04-12 13:45:28,811 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-12 13:45:28,813 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:45:28,813 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 13:45:28,813 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-12 13:45:28,814 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-12 13:45:28,824 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-12 13:45:28,824 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 13:45:28,832 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-12 13:45:28,832 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:45:28,836 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-12 13:45:28,845 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-12 13:45:28,845 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:107, output treesize:28 [2018-04-12 13:45:28,970 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-12 13:45:28,988 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 13:45:28,988 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 39 [2018-04-12 13:45:28,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-12 13:45:28,988 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-12 13:45:28,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=1285, Unknown=6, NotChecked=0, Total=1560 [2018-04-12 13:45:28,989 INFO L87 Difference]: Start difference. First operand 743 states and 946 transitions. Second operand 40 states. [2018-04-12 13:45:57,749 WARN L151 SmtUtils]: Spent 2026ms on a formula simplification. DAG size of input: 54 DAG size of output 39 [2018-04-12 13:46:46,876 WARN L151 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 46 DAG size of output 43 [2018-04-12 13:46:53,122 WARN L151 SmtUtils]: Spent 4210ms on a formula simplification. DAG size of input: 113 DAG size of output 69 [2018-04-12 13:47:03,532 WARN L151 SmtUtils]: Spent 4163ms on a formula simplification. DAG size of input: 104 DAG size of output 66 [2018-04-12 13:47:17,775 WARN L151 SmtUtils]: Spent 165ms on a formula simplification. DAG size of input: 59 DAG size of output 52 [2018-04-12 13:47:42,043 WARN L151 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 51 DAG size of output 48 [2018-04-12 13:48:00,327 WARN L151 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 63 DAG size of output 52 [2018-04-12 13:48:04,495 WARN L151 SmtUtils]: Spent 2049ms on a formula simplification. DAG size of input: 70 DAG size of output 53 [2018-04-12 13:48:04,695 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 58 DAG size of output 49 Received shutdown request... [2018-04-12 13:48:14,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-12 13:48:14,905 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-12 13:48:14,908 WARN L197 ceAbstractionStarter]: Timeout [2018-04-12 13:48:14,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.04 01:48:14 BoogieIcfgContainer [2018-04-12 13:48:14,908 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-12 13:48:14,909 INFO L168 Benchmark]: Toolchain (without parser) took 860783.47 ms. Allocated memory was 407.4 MB in the beginning and 650.6 MB in the end (delta: 243.3 MB). Free memory was 343.2 MB in the beginning and 495.1 MB in the end (delta: -151.9 MB). Peak memory consumption was 91.4 MB. Max. memory is 5.3 GB. [2018-04-12 13:48:14,910 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 407.4 MB. Free memory is still 369.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-12 13:48:14,910 INFO L168 Benchmark]: CACSL2BoogieTranslator took 248.27 ms. Allocated memory is still 407.4 MB. Free memory was 343.2 MB in the beginning and 317.9 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 5.3 GB. [2018-04-12 13:48:14,910 INFO L168 Benchmark]: Boogie Preprocessor took 52.54 ms. Allocated memory is still 407.4 MB. Free memory was 317.9 MB in the beginning and 315.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-12 13:48:14,910 INFO L168 Benchmark]: RCFGBuilder took 526.42 ms. Allocated memory was 407.4 MB in the beginning and 617.1 MB in the end (delta: 209.7 MB). Free memory was 315.3 MB in the beginning and 532.2 MB in the end (delta: -216.9 MB). Peak memory consumption was 23.2 MB. Max. memory is 5.3 GB. [2018-04-12 13:48:14,911 INFO L168 Benchmark]: TraceAbstraction took 859953.64 ms. Allocated memory was 617.1 MB in the beginning and 650.6 MB in the end (delta: 33.6 MB). Free memory was 531.9 MB in the beginning and 495.1 MB in the end (delta: 36.8 MB). Peak memory consumption was 70.3 MB. Max. memory is 5.3 GB. [2018-04-12 13:48:14,912 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.15 ms. Allocated memory is still 407.4 MB. Free memory is still 369.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 248.27 ms. Allocated memory is still 407.4 MB. Free memory was 343.2 MB in the beginning and 317.9 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 52.54 ms. Allocated memory is still 407.4 MB. Free memory was 317.9 MB in the beginning and 315.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 526.42 ms. Allocated memory was 407.4 MB in the beginning and 617.1 MB in the end (delta: 209.7 MB). Free memory was 315.3 MB in the beginning and 532.2 MB in the end (delta: -216.9 MB). Peak memory consumption was 23.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 859953.64 ms. Allocated memory was 617.1 MB in the beginning and 650.6 MB in the end (delta: 33.6 MB). Free memory was 531.9 MB in the beginning and 495.1 MB in the end (delta: 36.8 MB). Peak memory consumption was 70.3 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, 859.9s OverallTime, 46 OverallIterations, 4 TraceHistogramMax, 737.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5205 SDtfs, 17611 SDslu, 27786 SDs, 0 SdLazy, 26489 SolverSat, 2168 SolverUnsat, 148 SolverUnknown, 0 SolverNotchecked, 161.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1690 GetRequests, 604 SyntacticMatches, 50 SemanticMatches, 1035 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 14727 ImplicationChecksByTransitivity, 687.8s 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.6s SatisfiabilityAnalysisTime, 120.7s 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-12_13-48-14-917.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-12_13-48-14-917.csv Completed graceful shutdown