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_parent_ptr_true-valid-memsafety_false-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 10:52:32,509 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 10:52:32,510 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 10:52:32,522 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 10:52:32,523 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 10:52:32,523 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 10:52:32,524 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 10:52:32,525 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 10:52:32,527 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 10:52:32,527 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 10:52:32,528 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 10:52:32,528 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 10:52:32,529 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 10:52:32,530 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 10:52:32,531 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 10:52:32,532 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 10:52:32,534 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 10:52:32,535 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 10:52:32,536 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 10:52:32,537 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 10:52:32,539 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 10:52:32,539 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 10:52:32,539 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 10:52:32,540 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 10:52:32,541 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 10:52:32,542 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 10:52:32,542 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 10:52:32,543 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 10:52:32,543 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 10:52:32,543 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 10:52:32,544 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 10:52:32,544 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-04-11 10:52:32,563 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 10:52:32,563 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 10:52:32,564 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 10:52:32,564 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 10:52:32,565 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 10:52:32,565 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 10:52:32,565 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 10:52:32,565 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 10:52:32,565 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 10:52:32,565 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 10:52:32,565 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 10:52:32,565 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 10:52:32,565 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 10:52:32,566 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 10:52:32,566 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 10:52:32,566 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 10:52:32,566 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 10:52:32,566 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 10:52:32,566 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 10:52:32,566 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 10:52:32,566 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 10:52:32,566 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 10:52:32,567 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 10:52:32,567 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-11 10:52:32,592 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 10:52:32,600 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 10:52:32,602 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 10:52:32,603 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 10:52:32,603 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 10:52:32,604 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:32,926 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG696a71278 [2018-04-11 10:52:33,065 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 10:52:33,065 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 10:52:33,066 INFO L168 CDTParser]: Scanning tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,072 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 10:52:33,072 INFO L215 ultiparseSymbolTable]: [2018-04-11 10:52:33,072 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 10:52:33,073 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,073 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 10:52:33,073 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____ssize_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,073 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____mode_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,073 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__fsfilcnt_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,073 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__int8_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,073 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__u_int64_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,073 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__int32_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,073 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____socklen_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,073 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__pthread_mutexattr_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,073 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__gid_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,073 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__ldiv_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,073 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____blkcnt64_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,073 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__u_short in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,074 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____fsfilcnt64_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,074 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__pthread_mutex_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,074 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____time_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,074 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__pid_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,074 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__ino_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,074 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__timer_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,074 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__mode_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,074 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__u_int in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,074 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____int8_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,074 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____u_short in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,074 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____fsblkcnt64_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,074 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__key_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,074 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____nlink_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,074 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____fsfilcnt_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,074 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__fsblkcnt_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,074 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____timer_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,074 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____id_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,075 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____int32_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,075 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____fd_mask in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,075 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__nlink_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,075 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____qaddr_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,075 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____blksize_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,075 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__pthread_rwlock_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,075 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__pthread_key_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,075 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____rlim64_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,075 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____fsblkcnt_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,075 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____sig_atomic_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,075 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__u_quad_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,075 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____useconds_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,076 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____uint64_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,076 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__loff_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,076 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__uint in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,076 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____uint8_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,076 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____key_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,076 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____uid_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,076 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__ssize_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,076 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____int64_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,076 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__pthread_barrierattr_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,076 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____swblk_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,076 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__register_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,077 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__sigset_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,077 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__dev_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,077 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__id_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,077 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____u_int in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,077 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__time_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,077 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____blkcnt_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,077 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____quad_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,077 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____off_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,077 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____fsid_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,077 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____uint16_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,077 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____gid_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,077 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__daddr_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,078 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____ino64_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,078 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__clock_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,078 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____pid_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,078 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____ino_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,078 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__ushort in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,078 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__fd_mask in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,078 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__u_long in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,078 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__pthread_barrier_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,078 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__ulong in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,078 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__pthread_rwlockattr_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,078 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____u_quad_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,079 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__fsid_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,079 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__clockid_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,079 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__u_int32_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,079 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__int64_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,079 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__suseconds_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,079 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____daddr_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,079 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____WAIT_STATUS in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,079 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__u_int8_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,079 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__pthread_condattr_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,079 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____loff_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,079 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____clock_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,079 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__pthread_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,080 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__blksize_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,080 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____u_char in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,080 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__fd_set in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,080 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__wchar_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,080 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__uid_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,080 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__pthread_attr_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,080 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__lldiv_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,080 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____dev_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,080 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__int16_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,080 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____off64_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,080 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____suseconds_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,080 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____caddr_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,080 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__caddr_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,081 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__u_int16_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,081 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__u_char in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,081 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__pthread_spinlock_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,081 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____rlim_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,081 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__quad_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,081 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__blkcnt_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,081 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____sigset_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,081 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____clockid_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,081 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____pthread_list_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,081 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__size_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,081 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____int16_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,081 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__off_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,081 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____intptr_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,081 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__div_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,081 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____uint32_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,081 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i____u_long in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,081 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__pthread_cond_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,082 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_parent_ptr_true_valid_memsafety_false_termination_i__pthread_once_t in tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,095 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG696a71278 [2018-04-11 10:52:33,098 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 10:52:33,099 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 10:52:33,099 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 10:52:33,099 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 10:52:33,103 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 10:52:33,104 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 10:52:33" (1/1) ... [2018-04-11 10:52:33,105 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c5324e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:52:33, skipping insertion in model container [2018-04-11 10:52:33,105 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 10:52:33" (1/1) ... [2018-04-11 10:52:33,115 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 10:52:33,138 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 10:52:33,261 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 10:52:33,301 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 10:52:33,306 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 110 non ball SCCs. Number of states in SCCs 110. [2018-04-11 10:52:33,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:52:33 WrapperNode [2018-04-11 10:52:33,344 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 10:52:33,345 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 10:52:33,345 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 10:52:33,345 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 10:52:33,353 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:52:33" (1/1) ... [2018-04-11 10:52:33,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:52:33" (1/1) ... [2018-04-11 10:52:33,364 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:52:33" (1/1) ... [2018-04-11 10:52:33,365 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:52:33" (1/1) ... [2018-04-11 10:52:33,375 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:52:33" (1/1) ... [2018-04-11 10:52:33,380 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:52:33" (1/1) ... [2018-04-11 10:52:33,382 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:52:33" (1/1) ... [2018-04-11 10:52:33,386 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 10:52:33,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 10:52:33,387 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 10:52:33,387 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 10:52:33,387 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:52:33" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 10:52:33,480 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 10:52:33,480 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 10:52:33,480 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 10:52:33,481 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 10:52:33,481 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-11 10:52:33,481 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 10:52:33,481 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 10:52:33,481 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 10:52:33,481 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 10:52:33,481 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 10:52:33,481 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 10:52:33,481 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 10:52:33,481 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 10:52:33,481 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 10:52:33,481 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 10:52:33,481 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 10:52:33,481 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 10:52:33,482 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 10:52:33,482 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 10:52:33,482 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 10:52:33,482 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 10:52:33,482 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 10:52:33,482 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 10:52:33,482 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 10:52:33,482 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 10:52:33,482 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 10:52:33,483 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 10:52:33,483 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 10:52:33,483 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 10:52:33,483 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 10:52:33,483 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 10:52:33,483 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 10:52:33,483 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 10:52:33,483 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 10:52:33,483 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 10:52:33,484 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 10:52:33,484 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 10:52:33,484 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 10:52:33,484 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 10:52:33,484 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 10:52:33,484 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 10:52:33,484 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 10:52:33,484 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 10:52:33,484 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 10:52:33,485 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 10:52:33,485 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 10:52:33,485 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 10:52:33,485 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 10:52:33,485 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 10:52:33,485 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 10:52:33,485 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 10:52:33,485 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 10:52:33,485 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 10:52:33,485 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 10:52:33,486 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 10:52:33,486 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 10:52:33,486 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 10:52:33,486 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 10:52:33,486 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 10:52:33,486 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 10:52:33,486 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 10:52:33,486 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 10:52:33,486 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 10:52:33,487 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 10:52:33,487 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 10:52:33,487 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 10:52:33,487 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 10:52:33,487 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 10:52:33,487 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 10:52:33,487 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-11 10:52:33,487 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 10:52:33,487 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 10:52:33,487 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 10:52:33,487 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 10:52:33,488 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 10:52:33,488 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 10:52:33,488 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 10:52:33,488 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 10:52:33,488 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 10:52:33,488 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 10:52:33,488 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 10:52:33,488 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 10:52:33,488 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 10:52:33,488 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 10:52:33,489 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 10:52:33,489 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 10:52:33,489 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 10:52:33,489 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 10:52:33,489 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 10:52:33,489 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 10:52:33,489 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 10:52:33,489 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 10:52:33,489 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 10:52:33,489 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 10:52:33,489 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 10:52:33,490 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 10:52:33,490 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 10:52:33,490 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 10:52:33,490 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 10:52:33,490 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 10:52:33,490 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 10:52:33,490 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 10:52:33,490 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 10:52:33,490 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 10:52:33,490 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 10:52:33,491 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 10:52:33,491 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 10:52:33,491 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 10:52:33,491 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-11 10:52:33,491 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-11 10:52:33,491 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 10:52:33,491 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 10:52:33,491 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 10:52:33,931 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 10:52:33,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 10:52:33 BoogieIcfgContainer [2018-04-11 10:52:33,932 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 10:52:33,933 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 10:52:33,933 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 10:52:33,934 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 10:52:33,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 10:52:33" (1/3) ... [2018-04-11 10:52:33,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d09d3c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 10:52:33, skipping insertion in model container [2018-04-11 10:52:33,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:52:33" (2/3) ... [2018-04-11 10:52:33,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d09d3c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 10:52:33, skipping insertion in model container [2018-04-11 10:52:33,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 10:52:33" (3/3) ... [2018-04-11 10:52:33,936 INFO L107 eAbstractionObserver]: Analyzing ICFG tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-04-11 10:52:33,942 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 10:52:33,951 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 75 error locations. [2018-04-11 10:52:33,981 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 10:52:33,981 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 10:52:33,981 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 10:52:33,981 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 10:52:33,981 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 10:52:33,981 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 10:52:33,982 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 10:52:33,982 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 10:52:33,982 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 10:52:33,982 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 10:52:33,992 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states. [2018-04-11 10:52:33,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-11 10:52:33,998 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:33,999 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:33,999 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 10:52:34,002 INFO L82 PathProgramCache]: Analyzing trace with hash 921047381, now seen corresponding path program 1 times [2018-04-11 10:52:34,003 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:34,003 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:34,038 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:34,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:34,038 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:34,065 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:34,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:34,104 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:52:34,105 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 10:52:34,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 10:52:34,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 10:52:34,114 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 10:52:34,115 INFO L87 Difference]: Start difference. First operand 168 states. Second operand 4 states. [2018-04-11 10:52:34,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:34,287 INFO L93 Difference]: Finished difference Result 184 states and 195 transitions. [2018-04-11 10:52:34,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 10:52:34,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-11 10:52:34,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:34,298 INFO L225 Difference]: With dead ends: 184 [2018-04-11 10:52:34,299 INFO L226 Difference]: Without dead ends: 180 [2018-04-11 10:52:34,300 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:52:34,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-04-11 10:52:34,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 162. [2018-04-11 10:52:34,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-04-11 10:52:34,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 172 transitions. [2018-04-11 10:52:34,337 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 172 transitions. Word has length 8 [2018-04-11 10:52:34,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:34,338 INFO L459 AbstractCegarLoop]: Abstraction has 162 states and 172 transitions. [2018-04-11 10:52:34,338 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 10:52:34,338 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 172 transitions. [2018-04-11 10:52:34,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-11 10:52:34,338 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:34,338 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:34,338 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 10:52:34,339 INFO L82 PathProgramCache]: Analyzing trace with hash 921047382, now seen corresponding path program 1 times [2018-04-11 10:52:34,339 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:34,339 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:34,339 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:34,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:34,340 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:34,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:34,351 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:34,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:34,387 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:52:34,387 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 10:52:34,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 10:52:34,389 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 10:52:34,389 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 10:52:34,389 INFO L87 Difference]: Start difference. First operand 162 states and 172 transitions. Second operand 4 states. [2018-04-11 10:52:34,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:34,514 INFO L93 Difference]: Finished difference Result 159 states and 169 transitions. [2018-04-11 10:52:34,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 10:52:34,514 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-11 10:52:34,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:34,515 INFO L225 Difference]: With dead ends: 159 [2018-04-11 10:52:34,515 INFO L226 Difference]: Without dead ends: 159 [2018-04-11 10:52:34,516 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:52:34,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-04-11 10:52:34,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-04-11 10:52:34,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-04-11 10:52:34,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 169 transitions. [2018-04-11 10:52:34,524 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 169 transitions. Word has length 8 [2018-04-11 10:52:34,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:34,524 INFO L459 AbstractCegarLoop]: Abstraction has 159 states and 169 transitions. [2018-04-11 10:52:34,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 10:52:34,525 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 169 transitions. [2018-04-11 10:52:34,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-11 10:52:34,525 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:34,525 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:34,525 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 10:52:34,525 INFO L82 PathProgramCache]: Analyzing trace with hash -394420831, now seen corresponding path program 1 times [2018-04-11 10:52:34,526 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:34,526 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:34,526 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:34,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:34,527 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:34,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:34,548 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:34,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:34,574 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:52:34,574 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 10:52:34,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 10:52:34,574 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 10:52:34,575 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 10:52:34,575 INFO L87 Difference]: Start difference. First operand 159 states and 169 transitions. Second operand 4 states. [2018-04-11 10:52:34,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:34,720 INFO L93 Difference]: Finished difference Result 167 states and 178 transitions. [2018-04-11 10:52:34,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 10:52:34,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-04-11 10:52:34,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:34,721 INFO L225 Difference]: With dead ends: 167 [2018-04-11 10:52:34,721 INFO L226 Difference]: Without dead ends: 167 [2018-04-11 10:52:34,722 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:52:34,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-04-11 10:52:34,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 144. [2018-04-11 10:52:34,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-04-11 10:52:34,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 155 transitions. [2018-04-11 10:52:34,727 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 155 transitions. Word has length 15 [2018-04-11 10:52:34,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:34,727 INFO L459 AbstractCegarLoop]: Abstraction has 144 states and 155 transitions. [2018-04-11 10:52:34,727 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 10:52:34,727 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 155 transitions. [2018-04-11 10:52:34,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-11 10:52:34,727 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:34,727 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:34,727 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 10:52:34,728 INFO L82 PathProgramCache]: Analyzing trace with hash -394420830, now seen corresponding path program 1 times [2018-04-11 10:52:34,728 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:34,728 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:34,728 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:34,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:34,729 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:34,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:34,739 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:34,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:34,772 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:52:34,772 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 10:52:34,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 10:52:34,772 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 10:52:34,772 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:52:34,772 INFO L87 Difference]: Start difference. First operand 144 states and 155 transitions. Second operand 5 states. [2018-04-11 10:52:34,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:34,943 INFO L93 Difference]: Finished difference Result 200 states and 218 transitions. [2018-04-11 10:52:34,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 10:52:34,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-04-11 10:52:34,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:34,946 INFO L225 Difference]: With dead ends: 200 [2018-04-11 10:52:34,946 INFO L226 Difference]: Without dead ends: 200 [2018-04-11 10:52:34,946 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 10:52:34,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-04-11 10:52:34,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 180. [2018-04-11 10:52:34,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-04-11 10:52:34,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 207 transitions. [2018-04-11 10:52:34,955 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 207 transitions. Word has length 15 [2018-04-11 10:52:34,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:34,955 INFO L459 AbstractCegarLoop]: Abstraction has 180 states and 207 transitions. [2018-04-11 10:52:34,956 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 10:52:34,956 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 207 transitions. [2018-04-11 10:52:34,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-11 10:52:34,956 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:34,956 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:34,956 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 10:52:34,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1079358145, now seen corresponding path program 1 times [2018-04-11 10:52:34,957 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:34,957 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:34,957 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:34,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:34,958 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:34,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:34,968 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:34,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:34,987 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:52:34,987 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 10:52:34,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 10:52:34,988 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 10:52:34,988 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 10:52:34,988 INFO L87 Difference]: Start difference. First operand 180 states and 207 transitions. Second operand 4 states. [2018-04-11 10:52:35,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:35,070 INFO L93 Difference]: Finished difference Result 195 states and 222 transitions. [2018-04-11 10:52:35,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 10:52:35,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-04-11 10:52:35,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:35,071 INFO L225 Difference]: With dead ends: 195 [2018-04-11 10:52:35,071 INFO L226 Difference]: Without dead ends: 195 [2018-04-11 10:52:35,071 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:52:35,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-04-11 10:52:35,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 181. [2018-04-11 10:52:35,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-04-11 10:52:35,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 210 transitions. [2018-04-11 10:52:35,077 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 210 transitions. Word has length 17 [2018-04-11 10:52:35,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:35,077 INFO L459 AbstractCegarLoop]: Abstraction has 181 states and 210 transitions. [2018-04-11 10:52:35,077 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 10:52:35,077 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 210 transitions. [2018-04-11 10:52:35,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-11 10:52:35,078 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:35,078 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:35,078 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 10:52:35,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1079358144, now seen corresponding path program 1 times [2018-04-11 10:52:35,078 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:35,079 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:35,079 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:35,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:35,080 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:35,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:35,089 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:35,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:35,120 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:52:35,120 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 10:52:35,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 10:52:35,121 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 10:52:35,121 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 10:52:35,121 INFO L87 Difference]: Start difference. First operand 181 states and 210 transitions. Second operand 4 states. [2018-04-11 10:52:35,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:35,243 INFO L93 Difference]: Finished difference Result 183 states and 210 transitions. [2018-04-11 10:52:35,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 10:52:35,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-04-11 10:52:35,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:35,244 INFO L225 Difference]: With dead ends: 183 [2018-04-11 10:52:35,244 INFO L226 Difference]: Without dead ends: 183 [2018-04-11 10:52:35,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-11 10:52:35,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-04-11 10:52:35,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 179. [2018-04-11 10:52:35,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-04-11 10:52:35,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 207 transitions. [2018-04-11 10:52:35,250 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 207 transitions. Word has length 17 [2018-04-11 10:52:35,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:35,250 INFO L459 AbstractCegarLoop]: Abstraction has 179 states and 207 transitions. [2018-04-11 10:52:35,250 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 10:52:35,250 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 207 transitions. [2018-04-11 10:52:35,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-11 10:52:35,250 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:35,250 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:35,250 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 10:52:35,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1382861924, now seen corresponding path program 1 times [2018-04-11 10:52:35,251 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:35,251 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:35,251 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:35,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:35,251 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:35,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:35,261 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:35,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:35,279 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:52:35,279 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 10:52:35,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 10:52:35,279 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 10:52:35,279 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 10:52:35,279 INFO L87 Difference]: Start difference. First operand 179 states and 207 transitions. Second operand 4 states. [2018-04-11 10:52:35,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:35,292 INFO L93 Difference]: Finished difference Result 180 states and 207 transitions. [2018-04-11 10:52:35,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 10:52:35,292 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-04-11 10:52:35,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:35,293 INFO L225 Difference]: With dead ends: 180 [2018-04-11 10:52:35,293 INFO L226 Difference]: Without dead ends: 180 [2018-04-11 10:52:35,293 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:52:35,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-04-11 10:52:35,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 179. [2018-04-11 10:52:35,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-04-11 10:52:35,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 206 transitions. [2018-04-11 10:52:35,296 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 206 transitions. Word has length 22 [2018-04-11 10:52:35,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:35,296 INFO L459 AbstractCegarLoop]: Abstraction has 179 states and 206 transitions. [2018-04-11 10:52:35,296 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 10:52:35,296 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 206 transitions. [2018-04-11 10:52:35,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-11 10:52:35,296 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:35,296 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:35,296 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 10:52:35,296 INFO L82 PathProgramCache]: Analyzing trace with hash -80956025, now seen corresponding path program 1 times [2018-04-11 10:52:35,297 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:35,297 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:35,297 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:35,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:35,297 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:35,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:35,309 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:35,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:35,345 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:52:35,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 10:52:35,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 10:52:35,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 10:52:35,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:52:35,346 INFO L87 Difference]: Start difference. First operand 179 states and 206 transitions. Second operand 5 states. [2018-04-11 10:52:35,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:35,458 INFO L93 Difference]: Finished difference Result 196 states and 224 transitions. [2018-04-11 10:52:35,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 10:52:35,459 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-04-11 10:52:35,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:35,459 INFO L225 Difference]: With dead ends: 196 [2018-04-11 10:52:35,459 INFO L226 Difference]: Without dead ends: 196 [2018-04-11 10:52:35,460 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-04-11 10:52:35,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-04-11 10:52:35,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 178. [2018-04-11 10:52:35,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-04-11 10:52:35,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 206 transitions. [2018-04-11 10:52:35,462 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 206 transitions. Word has length 23 [2018-04-11 10:52:35,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:35,463 INFO L459 AbstractCegarLoop]: Abstraction has 178 states and 206 transitions. [2018-04-11 10:52:35,463 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 10:52:35,463 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 206 transitions. [2018-04-11 10:52:35,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-11 10:52:35,463 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:35,463 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:35,463 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 10:52:35,464 INFO L82 PathProgramCache]: Analyzing trace with hash -80956024, now seen corresponding path program 1 times [2018-04-11 10:52:35,464 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:35,464 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:35,464 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:35,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:35,464 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:35,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:35,474 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:35,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:35,517 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:52:35,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 10:52:35,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 10:52:35,519 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 10:52:35,519 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:52:35,519 INFO L87 Difference]: Start difference. First operand 178 states and 206 transitions. Second operand 5 states. [2018-04-11 10:52:35,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:35,673 INFO L93 Difference]: Finished difference Result 202 states and 231 transitions. [2018-04-11 10:52:35,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 10:52:35,673 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-04-11 10:52:35,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:35,674 INFO L225 Difference]: With dead ends: 202 [2018-04-11 10:52:35,674 INFO L226 Difference]: Without dead ends: 202 [2018-04-11 10:52:35,674 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-11 10:52:35,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-04-11 10:52:35,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 180. [2018-04-11 10:52:35,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-04-11 10:52:35,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 207 transitions. [2018-04-11 10:52:35,676 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 207 transitions. Word has length 23 [2018-04-11 10:52:35,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:35,676 INFO L459 AbstractCegarLoop]: Abstraction has 180 states and 207 transitions. [2018-04-11 10:52:35,676 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 10:52:35,677 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 207 transitions. [2018-04-11 10:52:35,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-11 10:52:35,677 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:35,677 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:35,677 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 10:52:35,677 INFO L82 PathProgramCache]: Analyzing trace with hash -2040041390, now seen corresponding path program 1 times [2018-04-11 10:52:35,677 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:35,677 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:35,678 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:35,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:35,678 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:35,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:35,684 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:35,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:35,704 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:52:35,704 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 10:52:35,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 10:52:35,705 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 10:52:35,705 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 10:52:35,705 INFO L87 Difference]: Start difference. First operand 180 states and 207 transitions. Second operand 3 states. [2018-04-11 10:52:35,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:35,709 INFO L93 Difference]: Finished difference Result 182 states and 209 transitions. [2018-04-11 10:52:35,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 10:52:35,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-04-11 10:52:35,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:35,711 INFO L225 Difference]: With dead ends: 182 [2018-04-11 10:52:35,711 INFO L226 Difference]: Without dead ends: 182 [2018-04-11 10:52:35,711 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 10:52:35,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-04-11 10:52:35,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-04-11 10:52:35,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-04-11 10:52:35,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 209 transitions. [2018-04-11 10:52:35,714 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 209 transitions. Word has length 23 [2018-04-11 10:52:35,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:35,715 INFO L459 AbstractCegarLoop]: Abstraction has 182 states and 209 transitions. [2018-04-11 10:52:35,715 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 10:52:35,715 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 209 transitions. [2018-04-11 10:52:35,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-11 10:52:35,716 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:35,716 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:35,716 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 10:52:35,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1293948495, now seen corresponding path program 1 times [2018-04-11 10:52:35,716 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:35,716 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:35,717 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:35,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:35,717 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:35,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:35,727 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:35,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:35,794 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:52:35,794 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 10:52:35,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 10:52:35,794 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 10:52:35,794 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 10:52:35,795 INFO L87 Difference]: Start difference. First operand 182 states and 209 transitions. Second operand 6 states. [2018-04-11 10:52:35,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:35,933 INFO L93 Difference]: Finished difference Result 225 states and 258 transitions. [2018-04-11 10:52:35,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 10:52:35,933 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-04-11 10:52:35,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:35,934 INFO L225 Difference]: With dead ends: 225 [2018-04-11 10:52:35,934 INFO L226 Difference]: Without dead ends: 225 [2018-04-11 10:52:35,934 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-04-11 10:52:35,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-04-11 10:52:35,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 198. [2018-04-11 10:52:35,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-04-11 10:52:35,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 230 transitions. [2018-04-11 10:52:35,937 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 230 transitions. Word has length 25 [2018-04-11 10:52:35,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:35,937 INFO L459 AbstractCegarLoop]: Abstraction has 198 states and 230 transitions. [2018-04-11 10:52:35,937 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 10:52:35,937 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 230 transitions. [2018-04-11 10:52:35,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 10:52:35,937 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:35,937 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:35,937 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 10:52:35,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1343522610, now seen corresponding path program 1 times [2018-04-11 10:52:35,938 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:35,938 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:35,938 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:35,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:35,938 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:35,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:35,943 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:35,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:35,963 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:52:35,963 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 10:52:35,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 10:52:35,964 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 10:52:35,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:52:35,964 INFO L87 Difference]: Start difference. First operand 198 states and 230 transitions. Second operand 5 states. [2018-04-11 10:52:36,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:36,108 INFO L93 Difference]: Finished difference Result 293 states and 343 transitions. [2018-04-11 10:52:36,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 10:52:36,108 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-04-11 10:52:36,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:36,109 INFO L225 Difference]: With dead ends: 293 [2018-04-11 10:52:36,109 INFO L226 Difference]: Without dead ends: 293 [2018-04-11 10:52:36,109 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-11 10:52:36,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-04-11 10:52:36,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 197. [2018-04-11 10:52:36,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-04-11 10:52:36,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 228 transitions. [2018-04-11 10:52:36,112 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 228 transitions. Word has length 26 [2018-04-11 10:52:36,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:36,112 INFO L459 AbstractCegarLoop]: Abstraction has 197 states and 228 transitions. [2018-04-11 10:52:36,112 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 10:52:36,112 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 228 transitions. [2018-04-11 10:52:36,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 10:52:36,113 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:36,113 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:36,113 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 10:52:36,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1343522611, now seen corresponding path program 1 times [2018-04-11 10:52:36,113 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:36,113 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:36,113 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:36,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:36,114 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:36,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:36,119 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:36,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:36,172 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:52:36,173 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 10:52:36,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 10:52:36,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 10:52:36,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:52:36,173 INFO L87 Difference]: Start difference. First operand 197 states and 228 transitions. Second operand 5 states. [2018-04-11 10:52:36,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:36,346 INFO L93 Difference]: Finished difference Result 280 states and 329 transitions. [2018-04-11 10:52:36,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 10:52:36,346 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-04-11 10:52:36,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:36,347 INFO L225 Difference]: With dead ends: 280 [2018-04-11 10:52:36,347 INFO L226 Difference]: Without dead ends: 280 [2018-04-11 10:52:36,347 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-11 10:52:36,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-04-11 10:52:36,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 196. [2018-04-11 10:52:36,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-04-11 10:52:36,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 226 transitions. [2018-04-11 10:52:36,350 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 226 transitions. Word has length 26 [2018-04-11 10:52:36,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:36,350 INFO L459 AbstractCegarLoop]: Abstraction has 196 states and 226 transitions. [2018-04-11 10:52:36,350 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 10:52:36,350 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 226 transitions. [2018-04-11 10:52:36,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 10:52:36,351 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:36,351 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:36,351 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 10:52:36,351 INFO L82 PathProgramCache]: Analyzing trace with hash -332817586, now seen corresponding path program 1 times [2018-04-11 10:52:36,351 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:36,351 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:36,352 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:36,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:36,352 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:36,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:36,362 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:36,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:36,523 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:52:36,523 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-11 10:52:36,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 10:52:36,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 10:52:36,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-04-11 10:52:36,523 INFO L87 Difference]: Start difference. First operand 196 states and 226 transitions. Second operand 11 states. [2018-04-11 10:52:37,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:37,042 INFO L93 Difference]: Finished difference Result 216 states and 249 transitions. [2018-04-11 10:52:37,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 10:52:37,042 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2018-04-11 10:52:37,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:37,043 INFO L225 Difference]: With dead ends: 216 [2018-04-11 10:52:37,043 INFO L226 Difference]: Without dead ends: 216 [2018-04-11 10:52:37,043 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2018-04-11 10:52:37,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-04-11 10:52:37,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 199. [2018-04-11 10:52:37,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-04-11 10:52:37,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 230 transitions. [2018-04-11 10:52:37,047 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 230 transitions. Word has length 28 [2018-04-11 10:52:37,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:37,047 INFO L459 AbstractCegarLoop]: Abstraction has 199 states and 230 transitions. [2018-04-11 10:52:37,047 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 10:52:37,047 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 230 transitions. [2018-04-11 10:52:37,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 10:52:37,048 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:37,048 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:37,048 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 10:52:37,048 INFO L82 PathProgramCache]: Analyzing trace with hash -332817585, now seen corresponding path program 1 times [2018-04-11 10:52:37,048 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:37,048 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:37,049 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:37,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:37,049 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:37,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:37,062 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:37,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:37,272 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:52:37,273 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-04-11 10:52:37,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 10:52:37,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 10:52:37,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-04-11 10:52:37,273 INFO L87 Difference]: Start difference. First operand 199 states and 230 transitions. Second operand 13 states. [2018-04-11 10:52:37,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:37,853 INFO L93 Difference]: Finished difference Result 271 states and 299 transitions. [2018-04-11 10:52:37,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 10:52:37,854 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2018-04-11 10:52:37,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:37,854 INFO L225 Difference]: With dead ends: 271 [2018-04-11 10:52:37,854 INFO L226 Difference]: Without dead ends: 271 [2018-04-11 10:52:37,855 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=561, Unknown=0, NotChecked=0, Total=702 [2018-04-11 10:52:37,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-04-11 10:52:37,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 203. [2018-04-11 10:52:37,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-04-11 10:52:37,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 235 transitions. [2018-04-11 10:52:37,858 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 235 transitions. Word has length 28 [2018-04-11 10:52:37,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:37,859 INFO L459 AbstractCegarLoop]: Abstraction has 203 states and 235 transitions. [2018-04-11 10:52:37,859 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 10:52:37,859 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 235 transitions. [2018-04-11 10:52:37,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 10:52:37,859 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:37,860 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:37,860 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 10:52:37,860 INFO L82 PathProgramCache]: Analyzing trace with hash 81900715, now seen corresponding path program 1 times [2018-04-11 10:52:37,860 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:37,860 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:37,861 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:37,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:37,861 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:37,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:37,868 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:37,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:37,925 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:52:37,925 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 10:52:37,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 10:52:37,925 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 10:52:37,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-11 10:52:37,926 INFO L87 Difference]: Start difference. First operand 203 states and 235 transitions. Second operand 9 states. [2018-04-11 10:52:38,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:38,194 INFO L93 Difference]: Finished difference Result 249 states and 290 transitions. [2018-04-11 10:52:38,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 10:52:38,195 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-04-11 10:52:38,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:38,195 INFO L225 Difference]: With dead ends: 249 [2018-04-11 10:52:38,195 INFO L226 Difference]: Without dead ends: 249 [2018-04-11 10:52:38,196 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-04-11 10:52:38,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-04-11 10:52:38,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 202. [2018-04-11 10:52:38,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-04-11 10:52:38,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 233 transitions. [2018-04-11 10:52:38,200 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 233 transitions. Word has length 29 [2018-04-11 10:52:38,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:38,200 INFO L459 AbstractCegarLoop]: Abstraction has 202 states and 233 transitions. [2018-04-11 10:52:38,200 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 10:52:38,200 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 233 transitions. [2018-04-11 10:52:38,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 10:52:38,201 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:38,201 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:38,201 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 10:52:38,201 INFO L82 PathProgramCache]: Analyzing trace with hash 81900716, now seen corresponding path program 1 times [2018-04-11 10:52:38,201 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:38,201 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:38,202 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:38,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:38,202 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:38,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:38,211 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:38,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:38,308 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:52:38,308 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 10:52:38,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 10:52:38,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 10:52:38,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-11 10:52:38,309 INFO L87 Difference]: Start difference. First operand 202 states and 233 transitions. Second operand 9 states. [2018-04-11 10:52:38,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:38,620 INFO L93 Difference]: Finished difference Result 248 states and 288 transitions. [2018-04-11 10:52:38,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 10:52:38,620 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-04-11 10:52:38,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:38,621 INFO L225 Difference]: With dead ends: 248 [2018-04-11 10:52:38,621 INFO L226 Difference]: Without dead ends: 248 [2018-04-11 10:52:38,621 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-04-11 10:52:38,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-04-11 10:52:38,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 201. [2018-04-11 10:52:38,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-04-11 10:52:38,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 231 transitions. [2018-04-11 10:52:38,625 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 231 transitions. Word has length 29 [2018-04-11 10:52:38,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:38,625 INFO L459 AbstractCegarLoop]: Abstraction has 201 states and 231 transitions. [2018-04-11 10:52:38,625 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 10:52:38,626 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 231 transitions. [2018-04-11 10:52:38,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 10:52:38,626 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:38,626 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:38,626 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 10:52:38,626 INFO L82 PathProgramCache]: Analyzing trace with hash -13014505, now seen corresponding path program 1 times [2018-04-11 10:52:38,626 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:38,627 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:38,627 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:38,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:38,628 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:38,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:38,636 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:38,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:38,695 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:52:38,695 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 10:52:38,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 10:52:38,695 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 10:52:38,695 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:52:38,695 INFO L87 Difference]: Start difference. First operand 201 states and 231 transitions. Second operand 5 states. [2018-04-11 10:52:38,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:38,924 INFO L93 Difference]: Finished difference Result 282 states and 328 transitions. [2018-04-11 10:52:38,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 10:52:38,924 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-04-11 10:52:38,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:38,925 INFO L225 Difference]: With dead ends: 282 [2018-04-11 10:52:38,925 INFO L226 Difference]: Without dead ends: 282 [2018-04-11 10:52:38,926 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-11 10:52:38,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-04-11 10:52:38,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 200. [2018-04-11 10:52:38,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-04-11 10:52:38,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 229 transitions. [2018-04-11 10:52:38,929 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 229 transitions. Word has length 30 [2018-04-11 10:52:38,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:38,929 INFO L459 AbstractCegarLoop]: Abstraction has 200 states and 229 transitions. [2018-04-11 10:52:38,929 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 10:52:38,929 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 229 transitions. [2018-04-11 10:52:38,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 10:52:38,930 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:38,930 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:38,930 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 10:52:38,930 INFO L82 PathProgramCache]: Analyzing trace with hash -13014506, now seen corresponding path program 1 times [2018-04-11 10:52:38,930 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:38,930 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:38,931 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:38,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:38,931 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:38,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:38,938 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:38,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:38,959 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:52:38,959 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 10:52:38,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 10:52:38,960 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 10:52:38,960 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:52:38,960 INFO L87 Difference]: Start difference. First operand 200 states and 229 transitions. Second operand 5 states. [2018-04-11 10:52:39,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:39,144 INFO L93 Difference]: Finished difference Result 293 states and 338 transitions. [2018-04-11 10:52:39,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 10:52:39,144 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-04-11 10:52:39,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:39,145 INFO L225 Difference]: With dead ends: 293 [2018-04-11 10:52:39,146 INFO L226 Difference]: Without dead ends: 293 [2018-04-11 10:52:39,146 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-11 10:52:39,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-04-11 10:52:39,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 199. [2018-04-11 10:52:39,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-04-11 10:52:39,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 227 transitions. [2018-04-11 10:52:39,149 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 227 transitions. Word has length 30 [2018-04-11 10:52:39,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:39,150 INFO L459 AbstractCegarLoop]: Abstraction has 199 states and 227 transitions. [2018-04-11 10:52:39,150 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 10:52:39,150 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 227 transitions. [2018-04-11 10:52:39,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 10:52:39,150 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:39,150 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:39,150 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 10:52:39,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1014564753, now seen corresponding path program 1 times [2018-04-11 10:52:39,151 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:39,151 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:39,151 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:39,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:39,152 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:39,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:39,159 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:39,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:39,216 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:52:39,216 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 10:52:39,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 10:52:39,217 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 10:52:39,217 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-11 10:52:39,217 INFO L87 Difference]: Start difference. First operand 199 states and 227 transitions. Second operand 7 states. [2018-04-11 10:52:39,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:39,535 INFO L93 Difference]: Finished difference Result 261 states and 292 transitions. [2018-04-11 10:52:39,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 10:52:39,536 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-04-11 10:52:39,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:39,536 INFO L225 Difference]: With dead ends: 261 [2018-04-11 10:52:39,536 INFO L226 Difference]: Without dead ends: 261 [2018-04-11 10:52:39,537 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-04-11 10:52:39,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-04-11 10:52:39,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 197. [2018-04-11 10:52:39,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-04-11 10:52:39,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 225 transitions. [2018-04-11 10:52:39,539 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 225 transitions. Word has length 32 [2018-04-11 10:52:39,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:39,539 INFO L459 AbstractCegarLoop]: Abstraction has 197 states and 225 transitions. [2018-04-11 10:52:39,539 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 10:52:39,539 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 225 transitions. [2018-04-11 10:52:39,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 10:52:39,539 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:39,539 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:39,539 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 10:52:39,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1014564752, now seen corresponding path program 1 times [2018-04-11 10:52:39,540 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:39,540 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:39,540 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:39,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:39,540 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:39,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:39,546 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:39,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:39,558 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:52:39,558 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 10:52:39,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 10:52:39,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 10:52:39,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 10:52:39,558 INFO L87 Difference]: Start difference. First operand 197 states and 225 transitions. Second operand 4 states. [2018-04-11 10:52:39,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:39,629 INFO L93 Difference]: Finished difference Result 217 states and 246 transitions. [2018-04-11 10:52:39,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 10:52:39,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-04-11 10:52:39,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:39,630 INFO L225 Difference]: With dead ends: 217 [2018-04-11 10:52:39,630 INFO L226 Difference]: Without dead ends: 217 [2018-04-11 10:52:39,630 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:52:39,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-04-11 10:52:39,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 196. [2018-04-11 10:52:39,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-04-11 10:52:39,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 224 transitions. [2018-04-11 10:52:39,633 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 224 transitions. Word has length 32 [2018-04-11 10:52:39,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:39,633 INFO L459 AbstractCegarLoop]: Abstraction has 196 states and 224 transitions. [2018-04-11 10:52:39,633 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 10:52:39,633 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 224 transitions. [2018-04-11 10:52:39,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 10:52:39,633 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:39,633 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:39,633 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 10:52:39,633 INFO L82 PathProgramCache]: Analyzing trace with hash 362841017, now seen corresponding path program 1 times [2018-04-11 10:52:39,633 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:39,633 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:39,634 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:39,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:39,634 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:39,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:39,643 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:39,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:39,712 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:52:39,712 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-11 10:52:39,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 10:52:39,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 10:52:39,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-04-11 10:52:39,713 INFO L87 Difference]: Start difference. First operand 196 states and 224 transitions. Second operand 10 states. [2018-04-11 10:52:40,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:40,028 INFO L93 Difference]: Finished difference Result 244 states and 280 transitions. [2018-04-11 10:52:40,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 10:52:40,030 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-04-11 10:52:40,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:40,030 INFO L225 Difference]: With dead ends: 244 [2018-04-11 10:52:40,030 INFO L226 Difference]: Without dead ends: 244 [2018-04-11 10:52:40,031 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2018-04-11 10:52:40,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-04-11 10:52:40,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 195. [2018-04-11 10:52:40,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-04-11 10:52:40,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 222 transitions. [2018-04-11 10:52:40,034 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 222 transitions. Word has length 32 [2018-04-11 10:52:40,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:40,034 INFO L459 AbstractCegarLoop]: Abstraction has 195 states and 222 transitions. [2018-04-11 10:52:40,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 10:52:40,034 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 222 transitions. [2018-04-11 10:52:40,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 10:52:40,035 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:40,035 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:40,035 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 10:52:40,036 INFO L82 PathProgramCache]: Analyzing trace with hash 362841018, now seen corresponding path program 1 times [2018-04-11 10:52:40,036 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:40,036 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:40,036 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:40,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:40,037 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:40,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:40,046 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:40,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:40,172 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:52:40,172 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-11 10:52:40,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 10:52:40,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 10:52:40,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-04-11 10:52:40,172 INFO L87 Difference]: Start difference. First operand 195 states and 222 transitions. Second operand 10 states. [2018-04-11 10:52:40,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:40,509 INFO L93 Difference]: Finished difference Result 239 states and 273 transitions. [2018-04-11 10:52:40,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 10:52:40,509 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-04-11 10:52:40,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:40,510 INFO L225 Difference]: With dead ends: 239 [2018-04-11 10:52:40,510 INFO L226 Difference]: Without dead ends: 239 [2018-04-11 10:52:40,510 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2018-04-11 10:52:40,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-04-11 10:52:40,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 194. [2018-04-11 10:52:40,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-04-11 10:52:40,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 220 transitions. [2018-04-11 10:52:40,513 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 220 transitions. Word has length 32 [2018-04-11 10:52:40,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:40,513 INFO L459 AbstractCegarLoop]: Abstraction has 194 states and 220 transitions. [2018-04-11 10:52:40,514 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 10:52:40,514 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 220 transitions. [2018-04-11 10:52:40,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 10:52:40,514 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:40,514 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:40,514 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 10:52:40,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1386736404, now seen corresponding path program 1 times [2018-04-11 10:52:40,515 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:40,515 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:40,515 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:40,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:40,515 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:40,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:40,523 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:40,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:40,554 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:52:40,554 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 10:52:40,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 10:52:40,554 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 10:52:40,555 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:52:40,555 INFO L87 Difference]: Start difference. First operand 194 states and 220 transitions. Second operand 5 states. [2018-04-11 10:52:40,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:40,660 INFO L93 Difference]: Finished difference Result 221 states and 249 transitions. [2018-04-11 10:52:40,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 10:52:40,661 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-04-11 10:52:40,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:40,661 INFO L225 Difference]: With dead ends: 221 [2018-04-11 10:52:40,661 INFO L226 Difference]: Without dead ends: 221 [2018-04-11 10:52:40,662 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-04-11 10:52:40,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-04-11 10:52:40,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 186. [2018-04-11 10:52:40,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-04-11 10:52:40,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 212 transitions. [2018-04-11 10:52:40,663 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 212 transitions. Word has length 33 [2018-04-11 10:52:40,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:40,664 INFO L459 AbstractCegarLoop]: Abstraction has 186 states and 212 transitions. [2018-04-11 10:52:40,664 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 10:52:40,664 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 212 transitions. [2018-04-11 10:52:40,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 10:52:40,664 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:40,664 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:40,664 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 10:52:40,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1167993264, now seen corresponding path program 1 times [2018-04-11 10:52:40,664 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:40,664 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:40,665 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:40,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:40,665 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:40,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:40,670 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:40,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:40,715 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:52:40,715 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 10:52:40,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 10:52:40,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 10:52:40,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-11 10:52:40,716 INFO L87 Difference]: Start difference. First operand 186 states and 212 transitions. Second operand 9 states. [2018-04-11 10:52:40,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:40,936 INFO L93 Difference]: Finished difference Result 193 states and 220 transitions. [2018-04-11 10:52:40,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 10:52:40,936 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-04-11 10:52:40,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:40,937 INFO L225 Difference]: With dead ends: 193 [2018-04-11 10:52:40,937 INFO L226 Difference]: Without dead ends: 193 [2018-04-11 10:52:40,937 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-04-11 10:52:40,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-04-11 10:52:40,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 185. [2018-04-11 10:52:40,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-04-11 10:52:40,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 210 transitions. [2018-04-11 10:52:40,939 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 210 transitions. Word has length 33 [2018-04-11 10:52:40,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:40,939 INFO L459 AbstractCegarLoop]: Abstraction has 185 states and 210 transitions. [2018-04-11 10:52:40,939 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 10:52:40,939 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 210 transitions. [2018-04-11 10:52:40,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 10:52:40,939 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:40,939 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:40,939 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 10:52:40,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1167993263, now seen corresponding path program 1 times [2018-04-11 10:52:40,939 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:40,940 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:40,940 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:40,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:40,940 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:40,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:40,946 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:41,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:41,012 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:52:41,012 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 10:52:41,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 10:52:41,013 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 10:52:41,013 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-11 10:52:41,013 INFO L87 Difference]: Start difference. First operand 185 states and 210 transitions. Second operand 9 states. [2018-04-11 10:52:41,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:41,249 INFO L93 Difference]: Finished difference Result 192 states and 218 transitions. [2018-04-11 10:52:41,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 10:52:41,250 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-04-11 10:52:41,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:41,250 INFO L225 Difference]: With dead ends: 192 [2018-04-11 10:52:41,251 INFO L226 Difference]: Without dead ends: 192 [2018-04-11 10:52:41,251 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-04-11 10:52:41,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-04-11 10:52:41,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 184. [2018-04-11 10:52:41,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-04-11 10:52:41,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 208 transitions. [2018-04-11 10:52:41,254 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 208 transitions. Word has length 33 [2018-04-11 10:52:41,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:41,254 INFO L459 AbstractCegarLoop]: Abstraction has 184 states and 208 transitions. [2018-04-11 10:52:41,254 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 10:52:41,254 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 208 transitions. [2018-04-11 10:52:41,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 10:52:41,255 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:41,255 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:41,255 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 10:52:41,255 INFO L82 PathProgramCache]: Analyzing trace with hash 454401458, now seen corresponding path program 1 times [2018-04-11 10:52:41,255 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:41,255 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:41,256 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:41,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:41,256 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:41,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:41,263 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:41,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:41,289 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:52:41,289 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 10:52:41,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 10:52:41,289 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 10:52:41,290 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 10:52:41,290 INFO L87 Difference]: Start difference. First operand 184 states and 208 transitions. Second operand 4 states. [2018-04-11 10:52:41,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:41,365 INFO L93 Difference]: Finished difference Result 196 states and 221 transitions. [2018-04-11 10:52:41,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 10:52:41,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-04-11 10:52:41,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:41,366 INFO L225 Difference]: With dead ends: 196 [2018-04-11 10:52:41,366 INFO L226 Difference]: Without dead ends: 196 [2018-04-11 10:52:41,366 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:52:41,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-04-11 10:52:41,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 183. [2018-04-11 10:52:41,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-04-11 10:52:41,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 207 transitions. [2018-04-11 10:52:41,368 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 207 transitions. Word has length 34 [2018-04-11 10:52:41,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:41,368 INFO L459 AbstractCegarLoop]: Abstraction has 183 states and 207 transitions. [2018-04-11 10:52:41,368 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 10:52:41,368 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 207 transitions. [2018-04-11 10:52:41,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 10:52:41,369 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:41,369 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:41,369 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 10:52:41,369 INFO L82 PathProgramCache]: Analyzing trace with hash 454401459, now seen corresponding path program 1 times [2018-04-11 10:52:41,369 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:41,369 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:41,369 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:41,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:41,369 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:41,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:41,373 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:41,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:41,408 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:52:41,408 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 10:52:41,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 10:52:41,408 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 10:52:41,408 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-11 10:52:41,408 INFO L87 Difference]: Start difference. First operand 183 states and 207 transitions. Second operand 7 states. [2018-04-11 10:52:41,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:41,653 INFO L93 Difference]: Finished difference Result 236 states and 262 transitions. [2018-04-11 10:52:41,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 10:52:41,653 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-04-11 10:52:41,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:41,654 INFO L225 Difference]: With dead ends: 236 [2018-04-11 10:52:41,654 INFO L226 Difference]: Without dead ends: 236 [2018-04-11 10:52:41,654 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-04-11 10:52:41,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-04-11 10:52:41,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 181. [2018-04-11 10:52:41,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-04-11 10:52:41,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 205 transitions. [2018-04-11 10:52:41,656 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 205 transitions. Word has length 34 [2018-04-11 10:52:41,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:41,656 INFO L459 AbstractCegarLoop]: Abstraction has 181 states and 205 transitions. [2018-04-11 10:52:41,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 10:52:41,656 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 205 transitions. [2018-04-11 10:52:41,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-11 10:52:41,657 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:41,657 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:41,657 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 10:52:41,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1201543495, now seen corresponding path program 1 times [2018-04-11 10:52:41,657 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:41,657 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:41,658 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:41,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:41,658 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:41,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:41,663 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:41,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:41,712 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:52:41,712 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 10:52:41,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 10:52:41,712 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 10:52:41,712 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 10:52:41,713 INFO L87 Difference]: Start difference. First operand 181 states and 205 transitions. Second operand 6 states. [2018-04-11 10:52:41,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:41,848 INFO L93 Difference]: Finished difference Result 228 states and 257 transitions. [2018-04-11 10:52:41,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 10:52:41,848 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-04-11 10:52:41,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:41,848 INFO L225 Difference]: With dead ends: 228 [2018-04-11 10:52:41,848 INFO L226 Difference]: Without dead ends: 228 [2018-04-11 10:52:41,849 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-04-11 10:52:41,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-04-11 10:52:41,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 159. [2018-04-11 10:52:41,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-04-11 10:52:41,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 179 transitions. [2018-04-11 10:52:41,850 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 179 transitions. Word has length 35 [2018-04-11 10:52:41,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:41,850 INFO L459 AbstractCegarLoop]: Abstraction has 159 states and 179 transitions. [2018-04-11 10:52:41,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 10:52:41,850 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 179 transitions. [2018-04-11 10:52:41,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 10:52:41,850 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:41,851 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:41,851 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 10:52:41,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1026073512, now seen corresponding path program 1 times [2018-04-11 10:52:41,851 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:41,851 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:41,851 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:41,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:41,851 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:41,861 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:42,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:42,321 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:52:42,321 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-04-11 10:52:42,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 10:52:42,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 10:52:42,322 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-04-11 10:52:42,322 INFO L87 Difference]: Start difference. First operand 159 states and 179 transitions. Second operand 15 states. [2018-04-11 10:52:43,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:43,178 INFO L93 Difference]: Finished difference Result 236 states and 260 transitions. [2018-04-11 10:52:43,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 10:52:43,178 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2018-04-11 10:52:43,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:43,179 INFO L225 Difference]: With dead ends: 236 [2018-04-11 10:52:43,179 INFO L226 Difference]: Without dead ends: 236 [2018-04-11 10:52:43,179 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=195, Invalid=675, Unknown=0, NotChecked=0, Total=870 [2018-04-11 10:52:43,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-04-11 10:52:43,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 175. [2018-04-11 10:52:43,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-04-11 10:52:43,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 195 transitions. [2018-04-11 10:52:43,182 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 195 transitions. Word has length 36 [2018-04-11 10:52:43,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:43,182 INFO L459 AbstractCegarLoop]: Abstraction has 175 states and 195 transitions. [2018-04-11 10:52:43,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 10:52:43,182 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 195 transitions. [2018-04-11 10:52:43,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 10:52:43,183 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:43,183 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:43,183 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 10:52:43,183 INFO L82 PathProgramCache]: Analyzing trace with hash 2137809661, now seen corresponding path program 1 times [2018-04-11 10:52:43,183 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:43,183 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:43,184 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:43,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:43,184 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:43,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:43,193 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:43,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:43,266 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:52:43,266 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-11 10:52:43,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 10:52:43,266 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 10:52:43,266 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-11 10:52:43,266 INFO L87 Difference]: Start difference. First operand 175 states and 195 transitions. Second operand 10 states. [2018-04-11 10:52:43,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:43,474 INFO L93 Difference]: Finished difference Result 182 states and 204 transitions. [2018-04-11 10:52:43,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 10:52:43,475 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2018-04-11 10:52:43,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:43,475 INFO L225 Difference]: With dead ends: 182 [2018-04-11 10:52:43,475 INFO L226 Difference]: Without dead ends: 182 [2018-04-11 10:52:43,475 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2018-04-11 10:52:43,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-04-11 10:52:43,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 174. [2018-04-11 10:52:43,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-04-11 10:52:43,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 194 transitions. [2018-04-11 10:52:43,477 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 194 transitions. Word has length 36 [2018-04-11 10:52:43,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:43,477 INFO L459 AbstractCegarLoop]: Abstraction has 174 states and 194 transitions. [2018-04-11 10:52:43,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 10:52:43,477 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 194 transitions. [2018-04-11 10:52:43,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 10:52:43,478 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:43,478 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:43,478 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 10:52:43,478 INFO L82 PathProgramCache]: Analyzing trace with hash 2137809662, now seen corresponding path program 1 times [2018-04-11 10:52:43,478 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:43,478 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:43,478 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:43,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:43,479 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:43,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:43,484 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:43,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:43,590 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:52:43,590 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-11 10:52:43,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 10:52:43,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 10:52:43,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-11 10:52:43,591 INFO L87 Difference]: Start difference. First operand 174 states and 194 transitions. Second operand 10 states. [2018-04-11 10:52:43,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:43,867 INFO L93 Difference]: Finished difference Result 181 states and 203 transitions. [2018-04-11 10:52:43,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 10:52:43,867 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2018-04-11 10:52:43,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:43,868 INFO L225 Difference]: With dead ends: 181 [2018-04-11 10:52:43,868 INFO L226 Difference]: Without dead ends: 181 [2018-04-11 10:52:43,868 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2018-04-11 10:52:43,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-04-11 10:52:43,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 173. [2018-04-11 10:52:43,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-04-11 10:52:43,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 193 transitions. [2018-04-11 10:52:43,870 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 193 transitions. Word has length 36 [2018-04-11 10:52:43,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:43,870 INFO L459 AbstractCegarLoop]: Abstraction has 173 states and 193 transitions. [2018-04-11 10:52:43,870 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 10:52:43,870 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 193 transitions. [2018-04-11 10:52:43,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-11 10:52:43,871 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:43,871 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:43,871 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 10:52:43,871 INFO L82 PathProgramCache]: Analyzing trace with hash -648528079, now seen corresponding path program 1 times [2018-04-11 10:52:43,871 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:43,871 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:43,872 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:43,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:43,872 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:43,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:43,878 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:43,926 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:43,927 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:52:43,927 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:52:43,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:43,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:43,968 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:52:44,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 10:52:44,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 10:52:44,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:44,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:44,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 10:52:44,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 10:52:44,025 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:44,031 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:44,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:44,034 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-04-11 10:52:44,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 10:52:44,045 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:44,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 10:52:44,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:44,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:44,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 10:52:44,070 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:44,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 10:52:44,072 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:44,076 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:44,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:44,082 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2018-04-11 10:52:44,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 10:52:44,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 10:52:44,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:44,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:44,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 10:52:44,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 10:52:44,095 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:44,095 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:44,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:44,097 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-04-11 10:52:44,101 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:44,118 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:52:44,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-04-11 10:52:44,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 10:52:44,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 10:52:44,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:52:44,119 INFO L87 Difference]: Start difference. First operand 173 states and 193 transitions. Second operand 5 states. [2018-04-11 10:52:44,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:44,188 INFO L93 Difference]: Finished difference Result 189 states and 209 transitions. [2018-04-11 10:52:44,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 10:52:44,189 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-04-11 10:52:44,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:44,189 INFO L225 Difference]: With dead ends: 189 [2018-04-11 10:52:44,190 INFO L226 Difference]: Without dead ends: 189 [2018-04-11 10:52:44,190 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 10:52:44,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-04-11 10:52:44,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 177. [2018-04-11 10:52:44,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-04-11 10:52:44,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 197 transitions. [2018-04-11 10:52:44,203 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 197 transitions. Word has length 37 [2018-04-11 10:52:44,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:44,204 INFO L459 AbstractCegarLoop]: Abstraction has 177 states and 197 transitions. [2018-04-11 10:52:44,204 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 10:52:44,204 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 197 transitions. [2018-04-11 10:52:44,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 10:52:44,204 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:44,204 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:44,204 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 10:52:44,205 INFO L82 PathProgramCache]: Analyzing trace with hash 924970680, now seen corresponding path program 1 times [2018-04-11 10:52:44,205 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:44,205 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:44,205 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:44,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:44,206 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:44,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:44,226 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:44,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:44,349 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:52:44,349 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-11 10:52:44,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 10:52:44,349 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 10:52:44,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-04-11 10:52:44,350 INFO L87 Difference]: Start difference. First operand 177 states and 197 transitions. Second operand 11 states. [2018-04-11 10:52:44,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:44,688 INFO L93 Difference]: Finished difference Result 243 states and 271 transitions. [2018-04-11 10:52:44,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 10:52:44,688 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-04-11 10:52:44,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:44,689 INFO L225 Difference]: With dead ends: 243 [2018-04-11 10:52:44,689 INFO L226 Difference]: Without dead ends: 243 [2018-04-11 10:52:44,689 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2018-04-11 10:52:44,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-04-11 10:52:44,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 192. [2018-04-11 10:52:44,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-04-11 10:52:44,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 214 transitions. [2018-04-11 10:52:44,693 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 214 transitions. Word has length 38 [2018-04-11 10:52:44,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:44,693 INFO L459 AbstractCegarLoop]: Abstraction has 192 states and 214 transitions. [2018-04-11 10:52:44,693 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 10:52:44,693 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 214 transitions. [2018-04-11 10:52:44,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 10:52:44,693 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:44,694 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:44,694 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 10:52:44,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1370466265, now seen corresponding path program 1 times [2018-04-11 10:52:44,694 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:44,694 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:44,696 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:44,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:44,696 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:44,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:44,705 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:44,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:44,955 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:52:44,955 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:52:44,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:44,986 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:52:45,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 10:52:45,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 10:52:45,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:45,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:45,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:52:45,112 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:47 [2018-04-11 10:52:45,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2018-04-11 10:52:45,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 35 [2018-04-11 10:52:45,204 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 10:52:45,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 10:52:45,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 10:52:45,239 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:56 [2018-04-11 10:52:45,443 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~st~0.base Int) (main_~n~0.base Int)) (let ((.cse0 (store |c_old(#valid)| main_~n~0.base 1))) (and (= (store (store .cse0 main_~st~0.base 0) main_~n~0.base 0) |c_#valid|) (= (select |c_old(#valid)| main_~n~0.base) 0) (= 0 (select .cse0 main_~st~0.base))))) is different from true [2018-04-11 10:52:45,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-04-11 10:52:45,514 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:52:45,514 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 24 [2018-04-11 10:52:45,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 10:52:45,515 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 10:52:45,515 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=498, Unknown=6, NotChecked=44, Total=600 [2018-04-11 10:52:45,515 INFO L87 Difference]: Start difference. First operand 192 states and 214 transitions. Second operand 25 states. [2018-04-11 10:52:46,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:46,731 INFO L93 Difference]: Finished difference Result 208 states and 231 transitions. [2018-04-11 10:52:46,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 10:52:46,731 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 38 [2018-04-11 10:52:46,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:46,732 INFO L225 Difference]: With dead ends: 208 [2018-04-11 10:52:46,732 INFO L226 Difference]: Without dead ends: 201 [2018-04-11 10:52:46,732 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=154, Invalid=1101, Unknown=9, NotChecked=68, Total=1332 [2018-04-11 10:52:46,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-04-11 10:52:46,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 194. [2018-04-11 10:52:46,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-04-11 10:52:46,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 216 transitions. [2018-04-11 10:52:46,734 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 216 transitions. Word has length 38 [2018-04-11 10:52:46,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:46,735 INFO L459 AbstractCegarLoop]: Abstraction has 194 states and 216 transitions. [2018-04-11 10:52:46,735 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 10:52:46,735 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 216 transitions. [2018-04-11 10:52:46,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 10:52:46,735 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:46,735 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:46,735 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 10:52:46,735 INFO L82 PathProgramCache]: Analyzing trace with hash 2138852874, now seen corresponding path program 1 times [2018-04-11 10:52:46,735 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:46,735 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:46,736 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:46,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:46,736 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:46,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:46,744 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:46,790 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:46,790 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:52:46,790 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 10:52:46,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 10:52:46,791 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 10:52:46,791 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-11 10:52:46,791 INFO L87 Difference]: Start difference. First operand 194 states and 216 transitions. Second operand 8 states. [2018-04-11 10:52:47,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:47,055 INFO L93 Difference]: Finished difference Result 214 states and 237 transitions. [2018-04-11 10:52:47,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 10:52:47,055 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2018-04-11 10:52:47,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:47,056 INFO L225 Difference]: With dead ends: 214 [2018-04-11 10:52:47,056 INFO L226 Difference]: Without dead ends: 214 [2018-04-11 10:52:47,056 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-04-11 10:52:47,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-04-11 10:52:47,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 203. [2018-04-11 10:52:47,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-04-11 10:52:47,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 229 transitions. [2018-04-11 10:52:47,060 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 229 transitions. Word has length 43 [2018-04-11 10:52:47,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:47,060 INFO L459 AbstractCegarLoop]: Abstraction has 203 states and 229 transitions. [2018-04-11 10:52:47,060 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 10:52:47,060 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 229 transitions. [2018-04-11 10:52:47,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 10:52:47,060 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:47,060 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:47,061 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 10:52:47,061 INFO L82 PathProgramCache]: Analyzing trace with hash 2138852875, now seen corresponding path program 1 times [2018-04-11 10:52:47,061 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:47,061 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:47,061 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:47,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:47,062 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:47,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:47,069 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:47,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:47,138 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:52:47,139 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:52:47,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:47,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:47,171 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:52:47,203 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:47,231 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-11 10:52:47,232 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2018-04-11 10:52:47,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 10:52:47,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 10:52:47,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-04-11 10:52:47,232 INFO L87 Difference]: Start difference. First operand 203 states and 229 transitions. Second operand 10 states. [2018-04-11 10:52:47,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:47,535 INFO L93 Difference]: Finished difference Result 298 states and 325 transitions. [2018-04-11 10:52:47,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 10:52:47,535 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-04-11 10:52:47,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:47,536 INFO L225 Difference]: With dead ends: 298 [2018-04-11 10:52:47,536 INFO L226 Difference]: Without dead ends: 298 [2018-04-11 10:52:47,536 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2018-04-11 10:52:47,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-04-11 10:52:47,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 205. [2018-04-11 10:52:47,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-04-11 10:52:47,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 229 transitions. [2018-04-11 10:52:47,539 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 229 transitions. Word has length 43 [2018-04-11 10:52:47,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:47,540 INFO L459 AbstractCegarLoop]: Abstraction has 205 states and 229 transitions. [2018-04-11 10:52:47,540 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 10:52:47,540 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 229 transitions. [2018-04-11 10:52:47,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-11 10:52:47,540 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:47,540 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:47,540 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 10:52:47,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1879929888, now seen corresponding path program 1 times [2018-04-11 10:52:47,541 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:47,541 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:47,542 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:47,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:47,542 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:47,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:47,549 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:47,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:47,573 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:52:47,573 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 10:52:47,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 10:52:47,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 10:52:47,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:52:47,574 INFO L87 Difference]: Start difference. First operand 205 states and 229 transitions. Second operand 5 states. [2018-04-11 10:52:47,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:47,647 INFO L93 Difference]: Finished difference Result 263 states and 289 transitions. [2018-04-11 10:52:47,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 10:52:47,647 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-04-11 10:52:47,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:47,648 INFO L225 Difference]: With dead ends: 263 [2018-04-11 10:52:47,648 INFO L226 Difference]: Without dead ends: 263 [2018-04-11 10:52:47,649 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 10:52:47,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-04-11 10:52:47,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 205. [2018-04-11 10:52:47,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-04-11 10:52:47,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 228 transitions. [2018-04-11 10:52:47,652 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 228 transitions. Word has length 44 [2018-04-11 10:52:47,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:47,652 INFO L459 AbstractCegarLoop]: Abstraction has 205 states and 228 transitions. [2018-04-11 10:52:47,652 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 10:52:47,652 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 228 transitions. [2018-04-11 10:52:47,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 10:52:47,653 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:47,653 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:47,653 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 10:52:47,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1535411722, now seen corresponding path program 1 times [2018-04-11 10:52:47,653 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:47,653 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:47,654 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:47,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:47,654 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:47,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:47,666 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:48,171 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:48,171 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:52:48,171 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:52:48,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:48,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:48,199 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:52:48,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 10:52:48,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 10:52:48,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:48,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:48,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 10:52:48,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 10:52:48,281 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:48,283 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:48,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:48,292 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2018-04-11 10:52:48,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-04-11 10:52:48,337 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:48,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-11 10:52:48,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:48,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:48,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-04-11 10:52:48,365 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:48,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-11 10:52:48,366 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:48,371 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:48,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:48,382 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:56, output treesize:48 [2018-04-11 10:52:48,425 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:48,426 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:48,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 10:52:48,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:48,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:48,439 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:50 [2018-04-11 10:52:48,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-04-11 10:52:48,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 10:52:48,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:48,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:48,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 30 treesize of output 31 [2018-04-11 10:52:48,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 10:52:48,568 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:48,582 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:48,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:48,595 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:67 [2018-04-11 10:52:48,664 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 39 treesize of output 38 [2018-04-11 10:52:48,667 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:48,668 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:52:48,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 30 [2018-04-11 10:52:48,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:48,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:48,707 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 39 treesize of output 38 [2018-04-11 10:52:48,710 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:48,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 10:52:48,712 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:48,718 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:48,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:52:48,733 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:93, output treesize:139 [2018-04-11 10:52:49,025 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:49,026 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:52:49,028 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 128 treesize of output 118 [2018-04-11 10:52:49,034 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:49,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 34 treesize of output 57 [2018-04-11 10:52:49,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 10:52:49,071 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:49,072 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:49,072 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:52:49,074 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 63 treesize of output 59 [2018-04-11 10:52:49,075 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:52:49,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 10:52:49,132 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 103 treesize of output 81 [2018-04-11 10:52:49,135 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:49,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 46 [2018-04-11 10:52:49,137 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:52:49,157 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:49,157 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:49,158 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:49,160 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 22 treesize of output 25 [2018-04-11 10:52:49,160 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:49,168 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:49,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 60 [2018-04-11 10:52:49,174 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:49,182 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 30 treesize of output 49 [2018-04-11 10:52:49,182 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-11 10:52:49,194 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:49,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 32 [2018-04-11 10:52:49,196 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 3 xjuncts. [2018-04-11 10:52:49,197 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:49,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2018-04-11 10:52:49,198 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:49,209 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 10:52:49,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-11 10:52:49,227 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:168, output treesize:51 [2018-04-11 10:52:49,296 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:49,325 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-11 10:52:49,325 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [22] total 38 [2018-04-11 10:52:49,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-11 10:52:49,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-11 10:52:49,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1267, Unknown=9, NotChecked=0, Total=1406 [2018-04-11 10:52:49,326 INFO L87 Difference]: Start difference. First operand 205 states and 228 transitions. Second operand 38 states. [2018-04-11 10:54:23,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:54:23,179 INFO L93 Difference]: Finished difference Result 228 states and 251 transitions. [2018-04-11 10:54:23,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 10:54:23,179 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 50 [2018-04-11 10:54:23,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:54:23,180 INFO L225 Difference]: With dead ends: 228 [2018-04-11 10:54:23,180 INFO L226 Difference]: Without dead ends: 202 [2018-04-11 10:54:23,181 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=534, Invalid=2992, Unknown=14, NotChecked=0, Total=3540 [2018-04-11 10:54:23,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-04-11 10:54:23,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 187. [2018-04-11 10:54:23,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-04-11 10:54:23,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 209 transitions. [2018-04-11 10:54:23,183 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 209 transitions. Word has length 50 [2018-04-11 10:54:23,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:54:23,183 INFO L459 AbstractCegarLoop]: Abstraction has 187 states and 209 transitions. [2018-04-11 10:54:23,183 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-11 10:54:23,183 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 209 transitions. [2018-04-11 10:54:23,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-11 10:54:23,184 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:54:23,184 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:54:23,184 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 10:54:23,184 INFO L82 PathProgramCache]: Analyzing trace with hash -47844621, now seen corresponding path program 1 times [2018-04-11 10:54:23,184 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:54:23,184 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:54:23,185 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:23,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:54:23,185 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:23,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:54:23,197 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:54:23,490 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:54:23,491 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:54:23,491 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:54:23,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:54:23,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:54:23,538 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:54:23,599 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:54:23,600 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:54:23,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 10:54:23,601 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:54:23,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:54:23,614 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:38 [2018-04-11 10:54:23,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 10:54:23,653 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:54:23,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 10:54:23,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:54:23,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:54:23,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 10:54:23,674 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:54:23,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 10:54:23,674 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:54:23,678 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:54:23,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:54:23,688 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:61, output treesize:56 [2018-04-11 10:54:23,745 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:54:23,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2018-04-11 10:54:23,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 10:54:23,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:54:23,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:54:23,771 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:54:23,777 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 65 treesize of output 72 [2018-04-11 10:54:23,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 10:54:23,779 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:54:23,786 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:54:23,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:54:23,798 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:102, output treesize:82 [2018-04-11 10:54:23,867 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:54:23,875 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 105 treesize of output 94 [2018-04-11 10:54:23,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-11 10:54:23,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:54:23,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:54:23,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2018-04-11 10:54:23,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-11 10:54:23,907 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:54:23,912 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:54:23,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 10:54:23,925 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:132, output treesize:112 [2018-04-11 10:54:29,978 WARN L151 SmtUtils]: Spent 2022ms on a formula simplification. DAG size of input: 46 DAG size of output 39 [2018-04-11 10:54:30,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 50 [2018-04-11 10:54:30,026 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 24 treesize of output 39 [2018-04-11 10:54:30,026 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 10:54:30,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:54:30,070 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 115 treesize of output 101 [2018-04-11 10:54:30,080 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 24 treesize of output 39 [2018-04-11 10:54:30,080 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 10:54:30,102 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:54:30,115 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 107 treesize of output 93 [2018-04-11 10:54:30,117 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:54:30,118 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 23 [2018-04-11 10:54:30,119 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:54:30,129 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:54:30,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 10:54:30,164 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:130, output treesize:191 [2018-04-11 10:54:30,319 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 39 treesize of output 35 [2018-04-11 10:54:30,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 10:54:30,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:54:30,337 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:54:30,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-11 10:54:30,338 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:54:30,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:54:30,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:54:30,353 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:94, output treesize:59 [2018-04-11 10:54:30,451 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:54:30,472 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:54:30,472 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 29 [2018-04-11 10:54:30,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-11 10:54:30,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-11 10:54:30,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=650, Unknown=2, NotChecked=0, Total=812 [2018-04-11 10:54:30,473 INFO L87 Difference]: Start difference. First operand 187 states and 209 transitions. Second operand 29 states. [2018-04-11 10:54:45,230 WARN L151 SmtUtils]: Spent 2042ms on a formula simplification. DAG size of input: 62 DAG size of output 50 [2018-04-11 10:54:52,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:54:52,867 INFO L93 Difference]: Finished difference Result 288 states and 327 transitions. [2018-04-11 10:54:52,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 10:54:52,867 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 52 [2018-04-11 10:54:52,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:54:52,868 INFO L225 Difference]: With dead ends: 288 [2018-04-11 10:54:52,868 INFO L226 Difference]: Without dead ends: 288 [2018-04-11 10:54:52,868 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 22.4s TimeCoverageRelationStatistics Valid=476, Invalid=1677, Unknown=9, NotChecked=0, Total=2162 [2018-04-11 10:54:52,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-04-11 10:54:52,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 213. [2018-04-11 10:54:52,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-04-11 10:54:52,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 240 transitions. [2018-04-11 10:54:52,870 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 240 transitions. Word has length 52 [2018-04-11 10:54:52,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:54:52,870 INFO L459 AbstractCegarLoop]: Abstraction has 213 states and 240 transitions. [2018-04-11 10:54:52,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-11 10:54:52,871 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 240 transitions. [2018-04-11 10:54:52,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-11 10:54:52,871 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:54:52,871 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:54:52,871 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 10:54:52,871 INFO L82 PathProgramCache]: Analyzing trace with hash -212695340, now seen corresponding path program 1 times [2018-04-11 10:54:52,871 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:54:52,871 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:54:52,872 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:52,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:54:52,872 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:54:52,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:54:52,880 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:54:52,998 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:54:52,999 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:54:52,999 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:54:53,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:54:53,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:54:53,035 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:54:53,046 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:54:53,047 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:54:53,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 10:54:53,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:54:53,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:54:53,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-11 10:54:53,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 10:54:53,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 8 treesize of output 7 [2018-04-11 10:54:53,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:54:53,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:54:53,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:54:53,074 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-04-11 10:54:53,098 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:54:53,102 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 28 treesize of output 35 [2018-04-11 10:54:53,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 10:54:53,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:54:53,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:54:53,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:54:53,111 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-04-11 10:54:53,144 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:54:53,145 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:54:53,151 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 41 treesize of output 42 [2018-04-11 10:54:53,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-04-11 10:54:53,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:54:53,159 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:54:53,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 10:54:53,165 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:39 [2018-04-11 10:54:59,196 WARN L151 SmtUtils]: Spent 2014ms on a formula simplification. DAG size of input: 25 DAG size of output 21 [2018-04-11 10:54:59,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2018-04-11 10:54:59,229 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 22 treesize of output 35 [2018-04-11 10:54:59,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 10:54:59,238 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:54:59,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 10:54:59,248 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:76 [2018-04-11 10:55:01,274 WARN L151 SmtUtils]: Spent 2014ms on a formula simplification. DAG size of input: 33 DAG size of output 19 [2018-04-11 10:55:01,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2018-04-11 10:55:01,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-11 10:55:01,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:55:01,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-11 10:55:01,312 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:55:01,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:55:01,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:55:01,317 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:38, output treesize:5 [2018-04-11 10:55:01,330 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:55:01,348 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:55:01,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14] total 18 [2018-04-11 10:55:01,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 10:55:01,349 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 10:55:01,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=287, Unknown=2, NotChecked=0, Total=342 [2018-04-11 10:55:01,349 INFO L87 Difference]: Start difference. First operand 213 states and 240 transitions. Second operand 19 states. [2018-04-11 10:55:17,445 WARN L151 SmtUtils]: Spent 2022ms on a formula simplification. DAG size of input: 46 DAG size of output 36 [2018-04-11 10:55:25,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:55:25,985 INFO L93 Difference]: Finished difference Result 471 states and 554 transitions. [2018-04-11 10:55:25,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 10:55:25,985 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 52 [2018-04-11 10:55:25,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:55:25,986 INFO L225 Difference]: With dead ends: 471 [2018-04-11 10:55:25,986 INFO L226 Difference]: Without dead ends: 471 [2018-04-11 10:55:25,986 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 24.6s TimeCoverageRelationStatistics Valid=270, Invalid=911, Unknown=9, NotChecked=0, Total=1190 [2018-04-11 10:55:25,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2018-04-11 10:55:25,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 275. [2018-04-11 10:55:25,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-04-11 10:55:25,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 325 transitions. [2018-04-11 10:55:25,990 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 325 transitions. Word has length 52 [2018-04-11 10:55:25,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:55:25,990 INFO L459 AbstractCegarLoop]: Abstraction has 275 states and 325 transitions. [2018-04-11 10:55:25,990 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 10:55:25,990 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 325 transitions. [2018-04-11 10:55:25,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-11 10:55:25,991 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:55:25,991 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:55:25,991 INFO L408 AbstractCegarLoop]: === Iteration 42 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 10:55:25,991 INFO L82 PathProgramCache]: Analyzing trace with hash -212695339, now seen corresponding path program 1 times [2018-04-11 10:55:25,991 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:55:25,991 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:55:25,992 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:55:25,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:55:25,992 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:55:26,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:55:26,002 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:55:26,156 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:55:26,156 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:55:26,156 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:55:26,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:55:26,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:55:26,176 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:55:26,189 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:55:26,189 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:55:26,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 10:55:26,190 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:55:26,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 10:55:26,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:55:26,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:55:26,198 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-11 10:55:26,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 10:55:26,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 10:55:26,213 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:55:26,214 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:55:26,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 10:55:26,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 10:55:26,223 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:55:26,224 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:55:26,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:55:26,229 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-04-11 10:55:26,261 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:55:26,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 63 [2018-04-11 10:55:26,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 10:55:26,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:55:26,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:55:26,282 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:55:26,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-04-11 10:55:26,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 10:55:26,287 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:55:26,290 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:55:26,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:55:26,296 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:69, output treesize:53 [2018-04-11 10:55:26,366 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:55:26,367 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:55:26,375 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 82 treesize of output 83 [2018-04-11 10:55:26,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-04-11 10:55:26,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:55:26,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:55:26,401 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:55:26,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-04-11 10:55:26,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-04-11 10:55:26,407 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:55:26,412 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:55:26,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 10:55:26,423 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:95, output treesize:79 [2018-04-11 10:55:30,491 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 86 treesize of output 76 [2018-04-11 10:55:30,501 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 22 treesize of output 35 [2018-04-11 10:55:30,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 10:55:30,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:55:30,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 66 [2018-04-11 10:55:30,545 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:55:30,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-11 10:55:30,546 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:55:30,551 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:55:30,555 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 85 treesize of output 72 [2018-04-11 10:55:30,571 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 22 treesize of output 35 [2018-04-11 10:55:30,571 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-11 10:55:30,583 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:55:30,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 10:55:30,604 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:93, output treesize:129 [2018-04-11 10:55:30,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2018-04-11 10:55:30,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 10:55:30,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:55:30,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2018-04-11 10:55:30,701 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:55:30,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:55:30,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-04-11 10:55:30,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 10:55:30,718 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 10:55:30,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 10:55:30,722 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:55:30,722 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:55:30,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:55:30,725 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:65, output treesize:9 [2018-04-11 10:55:30,756 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:55:30,773 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:55:30,773 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2018-04-11 10:55:30,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 10:55:30,774 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 10:55:30,774 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=540, Unknown=2, NotChecked=0, Total=650 [2018-04-11 10:55:30,774 INFO L87 Difference]: Start difference. First operand 275 states and 325 transitions. Second operand 26 states. [2018-04-11 10:55:31,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:55:31,671 INFO L93 Difference]: Finished difference Result 536 states and 632 transitions. [2018-04-11 10:55:31,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 10:55:31,671 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 52 [2018-04-11 10:55:31,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:55:31,673 INFO L225 Difference]: With dead ends: 536 [2018-04-11 10:55:31,673 INFO L226 Difference]: Without dead ends: 536 [2018-04-11 10:55:31,673 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=343, Invalid=1377, Unknown=2, NotChecked=0, Total=1722 [2018-04-11 10:55:31,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-04-11 10:55:31,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 279. [2018-04-11 10:55:31,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-04-11 10:55:31,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 329 transitions. [2018-04-11 10:55:31,676 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 329 transitions. Word has length 52 [2018-04-11 10:55:31,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:55:31,676 INFO L459 AbstractCegarLoop]: Abstraction has 279 states and 329 transitions. [2018-04-11 10:55:31,676 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 10:55:31,676 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 329 transitions. [2018-04-11 10:55:31,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-11 10:55:31,676 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:55:31,676 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:55:31,676 INFO L408 AbstractCegarLoop]: === Iteration 43 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 10:55:31,676 INFO L82 PathProgramCache]: Analyzing trace with hash -206969702, now seen corresponding path program 1 times [2018-04-11 10:55:31,676 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:55:31,677 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:55:31,677 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:55:31,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:55:31,677 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:55:31,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:55:31,690 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:55:32,227 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:55:32,227 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:55:32,227 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:55:32,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:55:32,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:55:32,255 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:55:32,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 10:55:32,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 10:55:32,415 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:55:32,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:55:32,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 10:55:32,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 10:55:32,420 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:55:32,421 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:55:32,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:55:32,422 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-04-11 10:55:32,452 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:55:32,469 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:55:32,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12] total 28 [2018-04-11 10:55:32,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 10:55:32,469 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 10:55:32,470 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=650, Unknown=0, NotChecked=0, Total=756 [2018-04-11 10:55:32,470 INFO L87 Difference]: Start difference. First operand 279 states and 329 transitions. Second operand 28 states. [2018-04-11 10:55:33,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:55:33,614 INFO L93 Difference]: Finished difference Result 424 states and 503 transitions. [2018-04-11 10:55:33,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-11 10:55:33,615 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 52 [2018-04-11 10:55:33,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:55:33,615 INFO L225 Difference]: With dead ends: 424 [2018-04-11 10:55:33,616 INFO L226 Difference]: Without dead ends: 424 [2018-04-11 10:55:33,616 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 45 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=621, Invalid=2031, Unknown=0, NotChecked=0, Total=2652 [2018-04-11 10:55:33,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2018-04-11 10:55:33,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 330. [2018-04-11 10:55:33,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-04-11 10:55:33,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 390 transitions. [2018-04-11 10:55:33,619 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 390 transitions. Word has length 52 [2018-04-11 10:55:33,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:55:33,619 INFO L459 AbstractCegarLoop]: Abstraction has 330 states and 390 transitions. [2018-04-11 10:55:33,619 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 10:55:33,619 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 390 transitions. [2018-04-11 10:55:33,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-11 10:55:33,620 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:55:33,620 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:55:33,620 INFO L408 AbstractCegarLoop]: === Iteration 44 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 10:55:33,620 INFO L82 PathProgramCache]: Analyzing trace with hash -442633932, now seen corresponding path program 1 times [2018-04-11 10:55:33,620 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:55:33,620 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:55:33,620 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:55:33,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:55:33,620 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:55:33,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:55:33,632 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:55:33,954 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:55:33,954 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:55:33,954 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:55:33,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:55:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:55:33,986 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:55:34,045 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:55:34,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 10:55:34,046 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:55:34,052 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:55:34,052 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:55:34,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 10:55:34,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:55:34,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:55:34,057 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-11 10:55:34,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 10:55:34,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 10:55:34,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:55:34,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:55:34,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 10:55:34,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 10:55:34,115 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:55:34,116 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:55:34,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:55:34,124 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2018-04-11 10:55:34,177 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 31 treesize of output 25 [2018-04-11 10:55:34,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 22 [2018-04-11 10:55:34,185 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 10:55:34,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 10:55:34,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-11 10:55:34,207 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2018-04-11 10:55:34,208 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 10:55:34,210 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:55:34,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-04-11 10:55:34,221 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:60, output treesize:94 [2018-04-11 10:55:34,424 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:55:34,426 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 24 [2018-04-11 10:55:34,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:55:34,440 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:55:34,440 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:55:34,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 10:55:34,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:55:34,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:55:34,450 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-04-11 10:55:34,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:55:34,543 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-11 10:55:34,544 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [17] total 33 [2018-04-11 10:55:34,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-11 10:55:34,544 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-11 10:55:34,544 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1016, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 10:55:34,544 INFO L87 Difference]: Start difference. First operand 330 states and 390 transitions. Second operand 34 states. [2018-04-11 10:55:36,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:55:36,211 INFO L93 Difference]: Finished difference Result 432 states and 497 transitions. [2018-04-11 10:55:36,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 10:55:36,211 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 63 [2018-04-11 10:55:36,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:55:36,212 INFO L225 Difference]: With dead ends: 432 [2018-04-11 10:55:36,212 INFO L226 Difference]: Without dead ends: 432 [2018-04-11 10:55:36,212 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 772 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=521, Invalid=2901, Unknown=0, NotChecked=0, Total=3422 [2018-04-11 10:55:36,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2018-04-11 10:55:36,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 330. [2018-04-11 10:55:36,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-04-11 10:55:36,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 389 transitions. [2018-04-11 10:55:36,215 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 389 transitions. Word has length 63 [2018-04-11 10:55:36,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:55:36,215 INFO L459 AbstractCegarLoop]: Abstraction has 330 states and 389 transitions. [2018-04-11 10:55:36,215 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-11 10:55:36,215 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 389 transitions. [2018-04-11 10:55:36,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-11 10:55:36,215 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:55:36,215 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, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:55:36,215 INFO L408 AbstractCegarLoop]: === Iteration 45 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 10:55:36,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1362468327, now seen corresponding path program 1 times [2018-04-11 10:55:36,216 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:55:36,216 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:55:36,216 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:55:36,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:55:36,216 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:55:36,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:55:36,230 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:55:36,436 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:55:36,436 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:55:36,436 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:55:36,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:55:36,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:55:36,465 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:55:36,476 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:55:36,476 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:55:36,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 10:55:36,477 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:55:36,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:55:36,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-11 10:55:36,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 10:55:36,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 10:55:36,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:55:36,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:55:36,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:55:36,505 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2018-04-11 10:55:36,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-04-11 10:55:36,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 10:55:36,541 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:55:36,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:55:36,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:55:36,551 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2018-04-11 10:55:36,603 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:55:36,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 51 [2018-04-11 10:55:36,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-04-11 10:55:36,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:55:36,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:55:36,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 10:55:36,625 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:53 [2018-04-11 10:55:42,677 WARN L151 SmtUtils]: Spent 2012ms on a formula simplification. DAG size of input: 30 DAG size of output 26 [2018-04-11 10:55:42,706 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:55:42,712 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 52 treesize of output 45 [2018-04-11 10:55:42,720 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 22 treesize of output 35 [2018-04-11 10:55:42,720 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 10:55:42,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:55:42,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 10:55:42,754 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:98 Received shutdown request... [2018-04-11 10:55:58,796 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-11 10:55:58,796 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 10:55:58,800 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 10:55:58,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 10:55:58 BoogieIcfgContainer [2018-04-11 10:55:58,800 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 10:55:58,801 INFO L168 Benchmark]: Toolchain (without parser) took 205702.40 ms. Allocated memory was 391.6 MB in the beginning and 828.9 MB in the end (delta: 437.3 MB). Free memory was 323.8 MB in the beginning and 757.4 MB in the end (delta: -433.7 MB). Peak memory consumption was 3.6 MB. Max. memory is 5.3 GB. [2018-04-11 10:55:58,801 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 391.6 MB. Free memory is still 352.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 10:55:58,801 INFO L168 Benchmark]: CACSL2BoogieTranslator took 245.48 ms. Allocated memory is still 391.6 MB. Free memory was 323.8 MB in the beginning and 298.7 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. [2018-04-11 10:55:58,802 INFO L168 Benchmark]: Boogie Preprocessor took 41.21 ms. Allocated memory is still 391.6 MB. Free memory was 298.7 MB in the beginning and 294.7 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. [2018-04-11 10:55:58,802 INFO L168 Benchmark]: RCFGBuilder took 545.75 ms. Allocated memory was 391.6 MB in the beginning and 593.5 MB in the end (delta: 201.9 MB). Free memory was 294.7 MB in the beginning and 505.1 MB in the end (delta: -210.4 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. [2018-04-11 10:55:58,802 INFO L168 Benchmark]: TraceAbstraction took 204867.63 ms. Allocated memory was 593.5 MB in the beginning and 828.9 MB in the end (delta: 235.4 MB). Free memory was 505.1 MB in the beginning and 757.4 MB in the end (delta: -252.4 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 10:55:58,803 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.10 ms. Allocated memory is still 391.6 MB. Free memory is still 352.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 245.48 ms. Allocated memory is still 391.6 MB. Free memory was 323.8 MB in the beginning and 298.7 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 41.21 ms. Allocated memory is still 391.6 MB. Free memory was 298.7 MB in the beginning and 294.7 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 545.75 ms. Allocated memory was 391.6 MB in the beginning and 593.5 MB in the end (delta: 201.9 MB). Free memory was 294.7 MB in the beginning and 505.1 MB in the end (delta: -210.4 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 204867.63 ms. Allocated memory was 593.5 MB in the beginning and 828.9 MB in the end (delta: 235.4 MB). Free memory was 505.1 MB in the beginning and 757.4 MB in the end (delta: -252.4 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 673]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 673). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 646]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 672]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 644]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 645]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 651]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 631]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 657]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 646]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 632]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 666]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 667]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 658]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 673]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 673). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 650]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 670]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 670). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 673]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 673). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 664]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 664). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 667]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 645]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 676]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 676). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 633]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 633). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 650]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 633]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 633). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 650]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 667]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 666]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 646]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 649]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 644]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 651]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 664]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 664). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 670]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 670). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 658]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 651]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 645]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 632]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 662]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 673]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 673). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 644]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 645]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 620]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 620). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 649]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 646]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 631]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 667]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 672]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 662]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 644]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 650]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 657]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 676]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 676). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 651]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 168 locations, 75 error locations. TIMEOUT Result, 204.8s OverallTime, 45 OverallIterations, 3 TraceHistogramMax, 153.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4748 SDtfs, 11775 SDslu, 17245 SDs, 0 SdLazy, 19114 SolverSat, 1329 SolverUnsat, 86 SolverUnknown, 0 SolverNotchecked, 113.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1140 GetRequests, 446 SyntacticMatches, 25 SemanticMatches, 669 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3662 ImplicationChecksByTransitivity, 61.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=330occurred in iteration=43, 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, 44 MinimizatonAttempts, 2097 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 26.9s InterpolantComputationTime, 1863 NumberOfCodeBlocks, 1863 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 1810 ConstructedInterpolants, 109 QuantifiedInterpolants, 862754 SizeOfPredicates, 111 NumberOfNonLiveVariables, 1845 ConjunctsInSsa, 260 ConjunctsInUnsatCore, 53 InterpolantComputations, 38 PerfectInterpolantSequences, 67/147 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_parent_ptr_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_10-55-58-807.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_parent_ptr_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_10-55-58-807.csv Completed graceful shutdown