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/list-ext-properties/list-ext_flag_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 11:15:50,082 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 11:15:50,083 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 11:15:50,093 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 11:15:50,093 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 11:15:50,094 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 11:15:50,095 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 11:15:50,097 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 11:15:50,098 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 11:15:50,099 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 11:15:50,100 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 11:15:50,100 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 11:15:50,101 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 11:15:50,101 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 11:15:50,102 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 11:15:50,104 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 11:15:50,105 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 11:15:50,107 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 11:15:50,108 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 11:15:50,109 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 11:15:50,111 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 11:15:50,111 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 11:15:50,111 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 11:15:50,112 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 11:15:50,113 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 11:15:50,113 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 11:15:50,114 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 11:15:50,114 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 11:15:50,115 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 11:15:50,115 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 11:15:50,115 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 11:15:50,116 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 11:15:50,135 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 11:15:50,135 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 11:15:50,136 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 11:15:50,136 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 11:15:50,136 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 11:15:50,136 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 11:15:50,137 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 11:15:50,137 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 11:15:50,137 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 11:15:50,137 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 11:15:50,137 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 11:15:50,137 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 11:15:50,138 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 11:15:50,138 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 11:15:50,138 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 11:15:50,138 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 11:15:50,138 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 11:15:50,139 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 11:15:50,139 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 11:15:50,139 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 11:15:50,139 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 11:15:50,139 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 11:15:50,139 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 11:15:50,140 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 11:15:50,168 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 11:15:50,179 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 11:15:50,182 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 11:15:50,184 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 11:15:50,184 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 11:15:50,185 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,473 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGcd85d78d0 [2018-04-11 11:15:50,634 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 11:15:50,634 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 11:15:50,635 INFO L168 CDTParser]: Scanning list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,641 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 11:15:50,641 INFO L215 ultiparseSymbolTable]: [2018-04-11 11:15:50,642 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 11:15:50,642 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__exit ('exit') in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,642 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,642 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 11:15:50,642 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____int32_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,642 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__time_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,642 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____suseconds_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,642 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__caddr_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,642 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__List in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,642 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__u_int in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,643 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__mode_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,643 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____rlim64_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,643 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__pthread_mutex_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,643 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____u_short in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,643 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__fd_set in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,643 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____rlim_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,643 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____time_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,643 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____timer_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,643 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____blksize_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,643 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__int8_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,643 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____caddr_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,643 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____u_char in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,644 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____off64_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,644 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____ssize_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,644 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__pthread_mutexattr_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,644 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____qaddr_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,644 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____fsfilcnt_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,644 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____dev_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,644 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__key_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,644 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__u_int32_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,644 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__fsblkcnt_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,644 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____id_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,644 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____u_long in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,644 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____int8_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,644 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__u_char in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,645 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__blkcnt_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,645 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__off_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,645 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____pthread_list_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,645 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__u_short in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,645 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____fsblkcnt64_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,645 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__pid_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,645 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__clock_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,645 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____fsid_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,645 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__gid_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,645 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__ulong in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,645 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____intptr_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,646 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__pthread_barrier_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,646 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____mode_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,646 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__blksize_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,646 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__pthread_attr_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,646 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__lldiv_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,646 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____socklen_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,646 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____ino_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,646 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__uid_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,646 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__int16_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,646 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____uint32_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,647 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__pthread_cond_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,647 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____int16_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,647 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__u_int16_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,647 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__size_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,647 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__pthread_once_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,647 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__div_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,647 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____daddr_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,647 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__clockid_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,647 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____key_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,647 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____clockid_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,647 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__pthread_spinlock_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,648 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____uint8_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,648 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__quad_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,648 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____sigset_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,648 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__fd_mask in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,648 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__suseconds_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,648 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__wchar_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,648 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____useconds_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,648 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__uint in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,648 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__loff_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,648 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__nlink_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,648 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__ushort in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____int64_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____u_quad_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__u_long in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____gid_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____fd_mask in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____quad_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____pid_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____sig_atomic_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____loff_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__int64_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__pthread_condattr_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__u_int8_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____uint16_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__daddr_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__fsid_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____WAIT_STATUS in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__pthread_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____clock_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__register_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__sigset_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__timer_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__pthread_barrierattr_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____nlink_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,651 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____fsfilcnt64_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,651 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__u_int64_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,651 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__ino_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,651 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____uint64_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,651 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__ssize_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,651 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__int32_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,651 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__u_quad_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,651 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____off_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,651 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____uid_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,651 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____swblk_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,651 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__fsfilcnt_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__pthread_rwlockattr_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____blkcnt64_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__ldiv_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____ino64_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__pthread_key_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____fsblkcnt_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__pthread_rwlock_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__id_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____u_int in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i__dev_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_flag___true_valid_memsafety_i____blkcnt_t in list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:50,665 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGcd85d78d0 [2018-04-11 11:15:50,669 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 11:15:50,669 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 11:15:50,670 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 11:15:50,670 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 11:15:50,674 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 11:15:50,675 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 11:15:50" (1/1) ... [2018-04-11 11:15:50,676 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43bced04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:15:50, skipping insertion in model container [2018-04-11 11:15:50,676 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 11:15:50" (1/1) ... [2018-04-11 11:15:50,687 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 11:15:50,709 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 11:15:50,841 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 11:15:50,877 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 11:15:50,883 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 113 non ball SCCs. Number of states in SCCs 113. [2018-04-11 11:15:50,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:15:50 WrapperNode [2018-04-11 11:15:50,921 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 11:15:50,922 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 11:15:50,922 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 11:15:50,922 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 11:15:50,934 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:15:50" (1/1) ... [2018-04-11 11:15:50,935 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:15:50" (1/1) ... [2018-04-11 11:15:50,947 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:15:50" (1/1) ... [2018-04-11 11:15:50,947 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:15:50" (1/1) ... [2018-04-11 11:15:50,953 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:15:50" (1/1) ... [2018-04-11 11:15:50,956 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:15:50" (1/1) ... [2018-04-11 11:15:50,958 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:15:50" (1/1) ... [2018-04-11 11:15:50,961 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 11:15:50,962 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 11:15:50,962 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 11:15:50,962 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 11:15:50,963 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:15:50" (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 11:15:51,055 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 11:15:51,055 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 11:15:51,055 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_flist_ext_flag___true_valid_memsafety_i__exit [2018-04-11 11:15:51,055 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 11:15:51,055 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-11 11:15:51,055 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 11:15:51,056 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 11:15:51,056 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 11:15:51,056 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 11:15:51,056 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 11:15:51,056 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 11:15:51,056 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 11:15:51,056 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 11:15:51,056 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 11:15:51,056 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 11:15:51,056 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 11:15:51,056 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 11:15:51,057 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 11:15:51,057 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 11:15:51,057 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 11:15:51,057 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 11:15:51,057 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 11:15:51,057 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 11:15:51,057 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 11:15:51,057 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 11:15:51,057 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 11:15:51,057 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 11:15:51,058 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 11:15:51,058 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 11:15:51,058 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 11:15:51,058 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 11:15:51,058 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 11:15:51,058 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 11:15:51,058 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 11:15:51,058 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 11:15:51,058 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 11:15:51,059 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 11:15:51,059 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 11:15:51,059 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 11:15:51,059 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 11:15:51,059 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 11:15:51,059 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 11:15:51,059 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 11:15:51,059 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 11:15:51,059 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 11:15:51,059 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 11:15:51,059 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 11:15:51,060 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 11:15:51,060 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 11:15:51,060 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 11:15:51,060 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 11:15:51,060 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 11:15:51,060 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 11:15:51,060 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 11:15:51,060 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 11:15:51,060 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 11:15:51,061 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 11:15:51,061 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 11:15:51,061 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 11:15:51,061 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 11:15:51,061 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 11:15:51,061 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 11:15:51,061 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 11:15:51,061 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 11:15:51,061 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 11:15:51,061 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 11:15:51,062 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 11:15:51,062 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_flist_ext_flag___true_valid_memsafety_i__exit [2018-04-11 11:15:51,062 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 11:15:51,062 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 11:15:51,062 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-11 11:15:51,062 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 11:15:51,062 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 11:15:51,062 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 11:15:51,062 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 11:15:51,062 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 11:15:51,062 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 11:15:51,062 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 11:15:51,062 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 11:15:51,062 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 11:15:51,062 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 11:15:51,063 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 11:15:51,063 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 11:15:51,063 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 11:15:51,063 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 11:15:51,063 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 11:15:51,063 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 11:15:51,063 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 11:15:51,063 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 11:15:51,063 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 11:15:51,063 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 11:15:51,063 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 11:15:51,063 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 11:15:51,063 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 11:15:51,063 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 11:15:51,064 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 11:15:51,064 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 11:15:51,064 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 11:15:51,064 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 11:15:51,064 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 11:15:51,064 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 11:15:51,064 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 11:15:51,064 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 11:15:51,064 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 11:15:51,065 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 11:15:51,065 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 11:15:51,065 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 11:15:51,065 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 11:15:51,065 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 11:15:51,065 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 11:15:51,065 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 11:15:51,065 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-11 11:15:51,065 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-11 11:15:51,065 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 11:15:51,065 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 11:15:51,065 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 11:15:51,066 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 11:15:51,378 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 11:15:51,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 11:15:51 BoogieIcfgContainer [2018-04-11 11:15:51,378 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 11:15:51,379 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 11:15:51,379 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 11:15:51,381 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 11:15:51,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 11:15:50" (1/3) ... [2018-04-11 11:15:51,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@109c7f1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 11:15:51, skipping insertion in model container [2018-04-11 11:15:51,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:15:50" (2/3) ... [2018-04-11 11:15:51,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@109c7f1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 11:15:51, skipping insertion in model container [2018-04-11 11:15:51,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 11:15:51" (3/3) ... [2018-04-11 11:15:51,383 INFO L107 eAbstractionObserver]: Analyzing ICFG list-ext_flag_1_true-valid-memsafety.i [2018-04-11 11:15:51,388 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 11:15:51,393 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 37 error locations. [2018-04-11 11:15:51,425 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 11:15:51,426 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 11:15:51,426 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 11:15:51,426 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 11:15:51,426 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 11:15:51,426 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 11:15:51,426 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 11:15:51,426 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 11:15:51,427 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 11:15:51,427 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 11:15:51,439 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states. [2018-04-11 11:15:51,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-11 11:15:51,445 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:15:51,446 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:15:51,446 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 11:15:51,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1370019485, now seen corresponding path program 1 times [2018-04-11 11:15:51,449 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:15:51,449 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:15:51,478 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:15:51,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:15:51,479 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:15:51,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:15:51,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:15:51,537 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 11:15:51,539 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:15:51,539 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 11:15:51,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-04-11 11:15:51,551 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-04-11 11:15:51,551 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-11 11:15:51,553 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 2 states. [2018-04-11 11:15:51,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:15:51,576 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2018-04-11 11:15:51,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-04-11 11:15:51,577 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-04-11 11:15:51,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:15:51,584 INFO L225 Difference]: With dead ends: 101 [2018-04-11 11:15:51,585 INFO L226 Difference]: Without dead ends: 93 [2018-04-11 11:15:51,586 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-11 11:15:51,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-04-11 11:15:51,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-04-11 11:15:51,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-04-11 11:15:51,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2018-04-11 11:15:51,618 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 12 [2018-04-11 11:15:51,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:15:51,619 INFO L459 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2018-04-11 11:15:51,619 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-04-11 11:15:51,619 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2018-04-11 11:15:51,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-11 11:15:51,619 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:15:51,619 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:15:51,619 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 11:15:51,619 INFO L82 PathProgramCache]: Analyzing trace with hash -871406561, now seen corresponding path program 1 times [2018-04-11 11:15:51,620 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:15:51,620 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:15:51,620 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:15:51,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:15:51,620 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:15:51,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:15:51,636 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:15:51,685 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 11:15:51,686 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:15:51,686 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 11:15:51,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 11:15:51,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 11:15:51,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 11:15:51,688 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand 5 states. [2018-04-11 11:15:51,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:15:51,819 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2018-04-11 11:15:51,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 11:15:51,820 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-04-11 11:15:51,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:15:51,820 INFO L225 Difference]: With dead ends: 105 [2018-04-11 11:15:51,821 INFO L226 Difference]: Without dead ends: 105 [2018-04-11 11:15:51,821 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 11:15:51,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-04-11 11:15:51,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 89. [2018-04-11 11:15:51,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-04-11 11:15:51,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 100 transitions. [2018-04-11 11:15:51,825 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 100 transitions. Word has length 15 [2018-04-11 11:15:51,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:15:51,825 INFO L459 AbstractCegarLoop]: Abstraction has 89 states and 100 transitions. [2018-04-11 11:15:51,825 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 11:15:51,825 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2018-04-11 11:15:51,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-11 11:15:51,826 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:15:51,826 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:15:51,826 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 11:15:51,826 INFO L82 PathProgramCache]: Analyzing trace with hash -871406560, now seen corresponding path program 1 times [2018-04-11 11:15:51,826 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:15:51,826 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:15:51,827 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:15:51,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:15:51,827 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:15:51,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:15:51,835 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:15:51,886 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 11:15:51,887 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:15:51,887 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 11:15:51,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 11:15:51,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 11:15:51,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 11:15:51,888 INFO L87 Difference]: Start difference. First operand 89 states and 100 transitions. Second operand 5 states. [2018-04-11 11:15:52,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:15:52,084 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2018-04-11 11:15:52,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 11:15:52,084 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-04-11 11:15:52,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:15:52,085 INFO L225 Difference]: With dead ends: 126 [2018-04-11 11:15:52,086 INFO L226 Difference]: Without dead ends: 126 [2018-04-11 11:15:52,086 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 11:15:52,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-04-11 11:15:52,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 114. [2018-04-11 11:15:52,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-04-11 11:15:52,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 125 transitions. [2018-04-11 11:15:52,092 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 125 transitions. Word has length 15 [2018-04-11 11:15:52,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:15:52,093 INFO L459 AbstractCegarLoop]: Abstraction has 114 states and 125 transitions. [2018-04-11 11:15:52,093 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 11:15:52,093 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 125 transitions. [2018-04-11 11:15:52,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 11:15:52,094 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:15:52,094 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] [2018-04-11 11:15:52,094 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 11:15:52,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1171854978, now seen corresponding path program 1 times [2018-04-11 11:15:52,094 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:15:52,094 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:15:52,095 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:15:52,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:15:52,095 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:15:52,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:15:52,107 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:15:52,148 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 11:15:52,148 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:15:52,148 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 11:15:52,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 11:15:52,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 11:15:52,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 11:15:52,149 INFO L87 Difference]: Start difference. First operand 114 states and 125 transitions. Second operand 6 states. [2018-04-11 11:15:52,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:15:52,295 INFO L93 Difference]: Finished difference Result 166 states and 176 transitions. [2018-04-11 11:15:52,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 11:15:52,296 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-04-11 11:15:52,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:15:52,297 INFO L225 Difference]: With dead ends: 166 [2018-04-11 11:15:52,297 INFO L226 Difference]: Without dead ends: 166 [2018-04-11 11:15:52,297 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-04-11 11:15:52,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-04-11 11:15:52,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 118. [2018-04-11 11:15:52,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-11 11:15:52,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 129 transitions. [2018-04-11 11:15:52,303 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 129 transitions. Word has length 28 [2018-04-11 11:15:52,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:15:52,304 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 129 transitions. [2018-04-11 11:15:52,304 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 11:15:52,304 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 129 transitions. [2018-04-11 11:15:52,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 11:15:52,304 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:15:52,305 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:15:52,305 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 11:15:52,305 INFO L82 PathProgramCache]: Analyzing trace with hash -99298509, now seen corresponding path program 1 times [2018-04-11 11:15:52,305 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:15:52,305 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:15:52,306 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:15:52,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:15:52,306 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:15:52,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:15:52,322 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:15:52,374 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:15:52,374 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:15:52,374 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 11:15:52,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 11:15:52,375 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 11:15:52,375 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-11 11:15:52,375 INFO L87 Difference]: Start difference. First operand 118 states and 129 transitions. Second operand 7 states. [2018-04-11 11:15:52,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:15:52,564 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2018-04-11 11:15:52,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 11:15:52,565 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-04-11 11:15:52,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:15:52,565 INFO L225 Difference]: With dead ends: 129 [2018-04-11 11:15:52,565 INFO L226 Difference]: Without dead ends: 129 [2018-04-11 11:15:52,566 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-04-11 11:15:52,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-04-11 11:15:52,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 116. [2018-04-11 11:15:52,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-04-11 11:15:52,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2018-04-11 11:15:52,570 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 127 transitions. Word has length 30 [2018-04-11 11:15:52,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:15:52,570 INFO L459 AbstractCegarLoop]: Abstraction has 116 states and 127 transitions. [2018-04-11 11:15:52,570 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 11:15:52,570 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 127 transitions. [2018-04-11 11:15:52,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 11:15:52,570 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:15:52,570 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:15:52,570 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 11:15:52,571 INFO L82 PathProgramCache]: Analyzing trace with hash -99298508, now seen corresponding path program 1 times [2018-04-11 11:15:52,571 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:15:52,571 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:15:52,571 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:15:52,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:15:52,571 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:15:52,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:15:52,584 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:15:52,645 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:15:52,646 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:15:52,646 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 11:15:52,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 11:15:52,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 11:15:52,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-11 11:15:52,646 INFO L87 Difference]: Start difference. First operand 116 states and 127 transitions. Second operand 7 states. [2018-04-11 11:15:52,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:15:52,870 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2018-04-11 11:15:52,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 11:15:52,870 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-04-11 11:15:52,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:15:52,871 INFO L225 Difference]: With dead ends: 143 [2018-04-11 11:15:52,871 INFO L226 Difference]: Without dead ends: 143 [2018-04-11 11:15:52,871 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-04-11 11:15:52,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-04-11 11:15:52,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 97. [2018-04-11 11:15:52,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-04-11 11:15:52,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2018-04-11 11:15:52,874 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 30 [2018-04-11 11:15:52,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:15:52,874 INFO L459 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2018-04-11 11:15:52,874 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 11:15:52,874 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2018-04-11 11:15:52,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 11:15:52,875 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:15:52,875 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 11:15:52,875 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 11:15:52,875 INFO L82 PathProgramCache]: Analyzing trace with hash 296729036, now seen corresponding path program 1 times [2018-04-11 11:15:52,875 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:15:52,875 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:15:52,876 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:15:52,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:15:52,876 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:15:52,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:15:52,887 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:15:52,970 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 11:15:52,970 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:15:52,970 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 11:15:52,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 11:15:52,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 11:15:52,971 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 11:15:52,971 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand 6 states. [2018-04-11 11:15:53,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:15:53,078 INFO L93 Difference]: Finished difference Result 136 states and 148 transitions. [2018-04-11 11:15:53,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 11:15:53,078 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-04-11 11:15:53,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:15:53,079 INFO L225 Difference]: With dead ends: 136 [2018-04-11 11:15:53,079 INFO L226 Difference]: Without dead ends: 131 [2018-04-11 11:15:53,079 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-04-11 11:15:53,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-04-11 11:15:53,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 102. [2018-04-11 11:15:53,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-04-11 11:15:53,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2018-04-11 11:15:53,083 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 30 [2018-04-11 11:15:53,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:15:53,083 INFO L459 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2018-04-11 11:15:53,083 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 11:15:53,083 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2018-04-11 11:15:53,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 11:15:53,084 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:15:53,084 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] [2018-04-11 11:15:53,084 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 11:15:53,084 INFO L82 PathProgramCache]: Analyzing trace with hash -439023006, now seen corresponding path program 1 times [2018-04-11 11:15:53,084 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:15:53,084 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:15:53,085 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:15:53,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:15:53,085 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:15:53,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:15:53,096 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:15:53,198 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 11:15:53,198 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:15:53,198 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 11:15:53,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 11:15:53,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 11:15:53,199 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-11 11:15:53,199 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand 8 states. [2018-04-11 11:15:53,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:15:53,326 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2018-04-11 11:15:53,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 11:15:53,327 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-04-11 11:15:53,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:15:53,327 INFO L225 Difference]: With dead ends: 124 [2018-04-11 11:15:53,327 INFO L226 Difference]: Without dead ends: 113 [2018-04-11 11:15:53,328 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-04-11 11:15:53,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-04-11 11:15:53,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 91. [2018-04-11 11:15:53,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-04-11 11:15:53,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2018-04-11 11:15:53,330 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 33 [2018-04-11 11:15:53,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:15:53,330 INFO L459 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2018-04-11 11:15:53,330 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 11:15:53,331 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2018-04-11 11:15:53,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 11:15:53,332 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:15:53,332 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:15:53,332 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 11:15:53,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1749825554, now seen corresponding path program 1 times [2018-04-11 11:15:53,332 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:15:53,332 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:15:53,333 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:15:53,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:15:53,333 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:15:53,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:15:53,358 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:15:53,481 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:15:53,482 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:15:53,482 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 11:15:53,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:15:53,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:15:53,526 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:15:53,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 11:15:53,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:15:53,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:15:53,559 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 11:15:53,600 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 11:15:53,601 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 11:15:53,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:15:53,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:15:53,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:15:53,606 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-04-11 11:15:53,624 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:15:53,625 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:15:53,625 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 11:15:53,626 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:15:53,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:15:53,629 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2018-04-11 11:15:53,658 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 11:15:53,660 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 11:15:53,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:15:53,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:15:53,669 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 11:15:53,669 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-04-11 11:15:53,688 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 20 treesize of output 16 [2018-04-11 11:15:53,690 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 16 treesize of output 4 [2018-04-11 11:15:53,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:15:53,691 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:15:53,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:15:53,693 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:12 [2018-04-11 11:15:53,709 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 19 treesize of output 20 [2018-04-11 11:15:53,710 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 11:15:53,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:15:53,713 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:15:53,716 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 11:15:53,716 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-04-11 11:15:53,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-04-11 11:15:53,764 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 11:15:53,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:15:53,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 11:15:53,770 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:15:53,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:15:53,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:15:53,773 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-04-11 11:15:53,781 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:15:53,801 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:15:53,801 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 21 [2018-04-11 11:15:53,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 11:15:53,801 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 11:15:53,801 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2018-04-11 11:15:53,802 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand 21 states. [2018-04-11 11:15:54,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:15:54,483 INFO L93 Difference]: Finished difference Result 224 states and 241 transitions. [2018-04-11 11:15:54,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 11:15:54,484 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 43 [2018-04-11 11:15:54,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:15:54,485 INFO L225 Difference]: With dead ends: 224 [2018-04-11 11:15:54,485 INFO L226 Difference]: Without dead ends: 222 [2018-04-11 11:15:54,486 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=275, Invalid=1057, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 11:15:54,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-04-11 11:15:54,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 114. [2018-04-11 11:15:54,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-04-11 11:15:54,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 127 transitions. [2018-04-11 11:15:54,490 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 127 transitions. Word has length 43 [2018-04-11 11:15:54,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:15:54,490 INFO L459 AbstractCegarLoop]: Abstraction has 114 states and 127 transitions. [2018-04-11 11:15:54,490 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 11:15:54,491 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 127 transitions. [2018-04-11 11:15:54,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 11:15:54,491 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:15:54,492 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:15:54,492 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 11:15:54,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1169196616, now seen corresponding path program 1 times [2018-04-11 11:15:54,492 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:15:54,492 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:15:54,493 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:15:54,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:15:54,493 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:15:54,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:15:54,507 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:15:54,710 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:15:54,711 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:15:54,711 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 11:15:54,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:15:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:15:54,747 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:15:54,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 11:15:54,751 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:15:54,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:15:54,754 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:15:54,793 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:15:54,794 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:15:54,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 11:15:54,795 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:15:54,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:15:54,815 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-11 11:15:54,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 11:15:54,850 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 11:15:54,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:15:54,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:15:54,864 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 11:15:54,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:36 [2018-04-11 11:15:54,930 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 39 treesize of output 35 [2018-04-11 11:15:54,932 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 11:15:54,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:15:54,936 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:15:54,941 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 11:15:54,941 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-04-11 11:15:55,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-04-11 11:15:55,031 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:15:55,032 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 21 treesize of output 15 [2018-04-11 11:15:55,032 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:15:55,045 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 11:15:55,045 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:15:55,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:15:55,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:15:55,051 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:51, output treesize:15 [2018-04-11 11:15:55,082 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:15:55,100 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:15:55,100 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2018-04-11 11:15:55,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-11 11:15:55,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-11 11:15:55,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=690, Unknown=0, NotChecked=0, Total=812 [2018-04-11 11:15:55,101 INFO L87 Difference]: Start difference. First operand 114 states and 127 transitions. Second operand 29 states. [2018-04-11 11:15:56,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:15:56,031 INFO L93 Difference]: Finished difference Result 233 states and 256 transitions. [2018-04-11 11:15:56,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-11 11:15:56,031 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 43 [2018-04-11 11:15:56,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:15:56,032 INFO L225 Difference]: With dead ends: 233 [2018-04-11 11:15:56,032 INFO L226 Difference]: Without dead ends: 233 [2018-04-11 11:15:56,033 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 800 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=552, Invalid=2310, Unknown=0, NotChecked=0, Total=2862 [2018-04-11 11:15:56,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-04-11 11:15:56,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 141. [2018-04-11 11:15:56,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-04-11 11:15:56,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 159 transitions. [2018-04-11 11:15:56,037 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 159 transitions. Word has length 43 [2018-04-11 11:15:56,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:15:56,038 INFO L459 AbstractCegarLoop]: Abstraction has 141 states and 159 transitions. [2018-04-11 11:15:56,038 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-11 11:15:56,038 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 159 transitions. [2018-04-11 11:15:56,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 11:15:56,039 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:15:56,039 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:15:56,039 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 11:15:56,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1169196615, now seen corresponding path program 1 times [2018-04-11 11:15:56,040 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:15:56,040 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:15:56,040 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:15:56,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:15:56,040 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:15:56,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:15:56,056 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:15:56,267 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:15:56,268 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:15:56,268 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 11:15:56,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:15:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:15:56,299 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:15:56,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 11:15:56,316 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:15:56,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:15:56,319 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:15:56,377 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:15:56,377 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:15:56,378 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 11:15:56,378 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:15:56,385 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 11:15:56,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:15:56,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:15:56,391 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-04-11 11:15:56,408 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 11:15:56,410 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 11:15:56,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:15:56,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:15:56,421 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 11:15:56,423 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 11:15:56,423 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:15:56,424 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:15:56,431 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 11:15:56,431 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:40 [2018-04-11 11:15:56,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2018-04-11 11:15:56,509 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 11:15:56,510 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:15:56,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:15:56,532 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 29 treesize of output 30 [2018-04-11 11:15:56,534 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 11:15:56,534 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:15:56,537 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:15:56,543 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 11:15:56,543 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:70, output treesize:54 [2018-04-11 11:15:56,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 44 [2018-04-11 11:15:56,631 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:15:56,632 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 32 treesize of output 24 [2018-04-11 11:15:56,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:15:56,639 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 11:15:56,639 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:15:56,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:15:56,666 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 26 treesize of output 24 [2018-04-11 11:15:56,669 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:15:56,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-04-11 11:15:56,670 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:15:56,676 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 11:15:56,677 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:15:56,679 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:15:56,684 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 11:15:56,684 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:75, output treesize:9 [2018-04-11 11:15:56,705 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:15:56,723 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:15:56,723 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 22 [2018-04-11 11:15:56,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 11:15:56,723 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 11:15:56,723 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2018-04-11 11:15:56,724 INFO L87 Difference]: Start difference. First operand 141 states and 159 transitions. Second operand 23 states. [2018-04-11 11:15:57,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:15:57,646 INFO L93 Difference]: Finished difference Result 247 states and 271 transitions. [2018-04-11 11:15:57,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 11:15:57,646 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 43 [2018-04-11 11:15:57,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:15:57,647 INFO L225 Difference]: With dead ends: 247 [2018-04-11 11:15:57,647 INFO L226 Difference]: Without dead ends: 247 [2018-04-11 11:15:57,648 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 29 SyntacticMatches, 6 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=341, Invalid=1381, Unknown=0, NotChecked=0, Total=1722 [2018-04-11 11:15:57,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-04-11 11:15:57,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 139. [2018-04-11 11:15:57,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-04-11 11:15:57,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 156 transitions. [2018-04-11 11:15:57,650 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 156 transitions. Word has length 43 [2018-04-11 11:15:57,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:15:57,650 INFO L459 AbstractCegarLoop]: Abstraction has 139 states and 156 transitions. [2018-04-11 11:15:57,650 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 11:15:57,650 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 156 transitions. [2018-04-11 11:15:57,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-11 11:15:57,652 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:15:57,652 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:15:57,652 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 11:15:57,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1470349368, now seen corresponding path program 1 times [2018-04-11 11:15:57,652 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:15:57,652 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:15:57,653 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:15:57,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:15:57,653 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:15:57,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:15:57,663 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:15:57,790 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:15:57,790 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:15:57,790 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 11:15:57,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:15:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:15:57,811 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:15:57,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 11:15:57,814 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:15:57,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:15:57,815 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 11:15:57,842 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 11:15:57,844 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 11:15:57,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:15:57,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:15:57,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:15:57,852 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-04-11 11:15:57,873 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:15:57,873 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:15:57,874 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 11:15:57,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:15:57,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:15:57,880 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2018-04-11 11:15:57,907 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 11:15:57,909 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 11:15:57,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:15:57,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:15:57,914 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 11:15:57,914 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-04-11 11:15:57,932 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 20 treesize of output 16 [2018-04-11 11:15:57,934 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 16 treesize of output 4 [2018-04-11 11:15:57,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:15:57,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:15:57,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:15:57,938 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:12 [2018-04-11 11:15:57,952 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 19 treesize of output 20 [2018-04-11 11:15:57,953 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 11:15:57,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:15:57,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:15:57,959 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 11:15:57,960 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-04-11 11:15:57,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-04-11 11:15:57,999 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 11:15:58,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:15:58,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 11:15:58,004 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:15:58,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:15:58,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:15:58,006 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-04-11 11:15:58,017 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:15:58,034 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:15:58,034 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 22 [2018-04-11 11:15:58,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 11:15:58,035 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 11:15:58,035 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2018-04-11 11:15:58,035 INFO L87 Difference]: Start difference. First operand 139 states and 156 transitions. Second operand 22 states. [2018-04-11 11:15:58,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:15:58,546 INFO L93 Difference]: Finished difference Result 260 states and 284 transitions. [2018-04-11 11:15:58,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 11:15:58,546 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 45 [2018-04-11 11:15:58,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:15:58,547 INFO L225 Difference]: With dead ends: 260 [2018-04-11 11:15:58,547 INFO L226 Difference]: Without dead ends: 260 [2018-04-11 11:15:58,547 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=280, Invalid=1126, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 11:15:58,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-04-11 11:15:58,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 139. [2018-04-11 11:15:58,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-04-11 11:15:58,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 155 transitions. [2018-04-11 11:15:58,550 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 155 transitions. Word has length 45 [2018-04-11 11:15:58,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:15:58,550 INFO L459 AbstractCegarLoop]: Abstraction has 139 states and 155 transitions. [2018-04-11 11:15:58,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 11:15:58,550 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 155 transitions. [2018-04-11 11:15:58,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-11 11:15:58,551 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:15:58,551 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:15:58,551 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 11:15:58,551 INFO L82 PathProgramCache]: Analyzing trace with hash -2064037992, now seen corresponding path program 1 times [2018-04-11 11:15:58,552 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:15:58,552 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:15:58,552 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:15:58,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:15:58,552 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:15:58,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:15:58,561 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:15:58,676 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:15:58,676 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:15:58,676 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 11:15:58,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:15:58,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:15:58,696 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:15:58,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 11:15:58,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:15:58,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:15:58,699 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 11:15:58,718 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 11:15:58,719 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 11:15:58,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:15:58,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:15:58,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:15:58,723 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-04-11 11:15:58,736 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:15:58,737 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:15:58,737 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 11:15:58,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:15:58,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:15:58,740 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2018-04-11 11:15:58,765 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 11:15:58,768 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 11:15:58,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:15:58,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:15:58,775 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 11:15:58,775 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-04-11 11:15:58,792 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 20 treesize of output 16 [2018-04-11 11:15:58,793 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 16 treesize of output 4 [2018-04-11 11:15:58,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:15:58,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:15:58,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:15:58,797 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:12 [2018-04-11 11:15:58,810 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 19 treesize of output 20 [2018-04-11 11:15:58,811 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 11:15:58,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:15:58,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:15:58,816 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 11:15:58,817 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-04-11 11:15:58,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-04-11 11:15:58,850 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 11:15:58,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:15:58,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 11:15:58,854 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:15:58,855 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:15:58,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:15:58,857 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-04-11 11:15:58,860 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:15:58,878 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:15:58,878 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 21 [2018-04-11 11:15:58,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 11:15:58,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 11:15:58,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2018-04-11 11:15:58,878 INFO L87 Difference]: Start difference. First operand 139 states and 155 transitions. Second operand 21 states. [2018-04-11 11:15:59,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:15:59,550 INFO L93 Difference]: Finished difference Result 260 states and 283 transitions. [2018-04-11 11:15:59,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 11:15:59,550 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 45 [2018-04-11 11:15:59,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:15:59,551 INFO L225 Difference]: With dead ends: 260 [2018-04-11 11:15:59,551 INFO L226 Difference]: Without dead ends: 260 [2018-04-11 11:15:59,551 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=275, Invalid=1057, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 11:15:59,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-04-11 11:15:59,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 139. [2018-04-11 11:15:59,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-04-11 11:15:59,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 154 transitions. [2018-04-11 11:15:59,553 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 154 transitions. Word has length 45 [2018-04-11 11:15:59,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:15:59,553 INFO L459 AbstractCegarLoop]: Abstraction has 139 states and 154 transitions. [2018-04-11 11:15:59,553 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 11:15:59,553 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 154 transitions. [2018-04-11 11:15:59,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-11 11:15:59,554 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:15:59,554 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:15:59,554 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 11:15:59,554 INFO L82 PathProgramCache]: Analyzing trace with hash -2025973194, now seen corresponding path program 1 times [2018-04-11 11:15:59,554 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:15:59,554 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:15:59,555 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:15:59,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:15:59,555 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:15:59,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:15:59,564 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:15:59,708 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:15:59,709 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:15:59,709 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 11:15:59,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:15:59,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:15:59,733 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:15:59,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 11:15:59,746 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:15:59,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:15:59,748 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:15:59,784 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:15:59,785 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:15:59,785 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 11:15:59,785 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:15:59,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:15:59,789 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-11 11:15:59,806 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 11:15:59,807 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 11:15:59,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:15:59,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:15:59,815 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 11:15:59,816 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 11:15:59,816 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:15:59,817 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:15:59,822 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 11:15:59,822 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:40, output treesize:20 [2018-04-11 11:15:59,835 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 14 [2018-04-11 11:15:59,836 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 19 [2018-04-11 11:15:59,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:15:59,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:15:59,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:15:59,842 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:45 [2018-04-11 11:15:59,862 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 92 treesize of output 86 [2018-04-11 11:15:59,864 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 22 treesize of output 21 [2018-04-11 11:15:59,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:15:59,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:15:59,878 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 72 treesize of output 73 [2018-04-11 11:15:59,880 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 22 treesize of output 21 [2018-04-11 11:15:59,880 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:15:59,885 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:15:59,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:15:59,890 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:95, output treesize:75 [2018-04-11 11:15:59,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 72 [2018-04-11 11:15:59,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-04-11 11:15:59,956 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:15:59,962 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:15:59,962 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 52 treesize of output 40 [2018-04-11 11:15:59,962 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:15:59,966 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:15:59,980 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 34 [2018-04-11 11:15:59,982 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 1 [2018-04-11 11:15:59,982 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:15:59,986 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:15:59,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-11 11:15:59,987 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:15:59,989 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:15:59,993 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 11:15:59,993 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:96, output treesize:7 [2018-04-11 11:16:00,001 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 11:16:00,002 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 11:16:00,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:00,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:00,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:00,004 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-04-11 11:16:00,020 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:16:00,043 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:16:00,043 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 25 [2018-04-11 11:16:00,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 11:16:00,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 11:16:00,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2018-04-11 11:16:00,044 INFO L87 Difference]: Start difference. First operand 139 states and 154 transitions. Second operand 25 states. [2018-04-11 11:16:00,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:16:00,769 INFO L93 Difference]: Finished difference Result 201 states and 216 transitions. [2018-04-11 11:16:00,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 11:16:00,769 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 52 [2018-04-11 11:16:00,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:16:00,770 INFO L225 Difference]: With dead ends: 201 [2018-04-11 11:16:00,770 INFO L226 Difference]: Without dead ends: 201 [2018-04-11 11:16:00,770 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 39 SyntacticMatches, 7 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=333, Invalid=1559, Unknown=0, NotChecked=0, Total=1892 [2018-04-11 11:16:00,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-04-11 11:16:00,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 142. [2018-04-11 11:16:00,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-04-11 11:16:00,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 157 transitions. [2018-04-11 11:16:00,773 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 157 transitions. Word has length 52 [2018-04-11 11:16:00,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:16:00,773 INFO L459 AbstractCegarLoop]: Abstraction has 142 states and 157 transitions. [2018-04-11 11:16:00,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 11:16:00,773 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 157 transitions. [2018-04-11 11:16:00,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 11:16:00,774 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:16:00,774 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-11 11:16:00,774 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 11:16:00,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1914527616, now seen corresponding path program 1 times [2018-04-11 11:16:00,775 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:16:00,775 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:16:00,775 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:16:00,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:16:00,776 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:16:00,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:16:00,789 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:16:00,922 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:16:00,922 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:16:00,922 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 11:16:00,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:16:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:16:00,946 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:16:00,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 11:16:00,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:00,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:00,950 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:16:00,990 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:00,990 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:00,990 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 11:16:00,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:00,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:00,994 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-04-11 11:16:01,025 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 11:16:01,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 11:16:01,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:01,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:01,033 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 11:16:01,033 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-04-11 11:16:01,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-04-11 11:16:01,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 11:16:01,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:01,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:01,090 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 11:16:01,090 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:42 [2018-04-11 11:16:01,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2018-04-11 11:16:01,142 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 11:16:01,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:01,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 21 [2018-04-11 11:16:01,149 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 11:16:01,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:16:01,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-11 11:16:01,157 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:51, output treesize:13 [2018-04-11 11:16:01,190 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 11:16:01,208 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:16:01,208 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 29 [2018-04-11 11:16:01,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-11 11:16:01,208 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-11 11:16:01,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=729, Unknown=0, NotChecked=0, Total=812 [2018-04-11 11:16:01,208 INFO L87 Difference]: Start difference. First operand 142 states and 157 transitions. Second operand 29 states. [2018-04-11 11:16:02,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:16:02,302 INFO L93 Difference]: Finished difference Result 211 states and 229 transitions. [2018-04-11 11:16:02,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 11:16:02,303 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 54 [2018-04-11 11:16:02,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:16:02,304 INFO L225 Difference]: With dead ends: 211 [2018-04-11 11:16:02,304 INFO L226 Difference]: Without dead ends: 211 [2018-04-11 11:16:02,305 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=364, Invalid=1892, Unknown=0, NotChecked=0, Total=2256 [2018-04-11 11:16:02,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-04-11 11:16:02,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 147. [2018-04-11 11:16:02,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-04-11 11:16:02,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 162 transitions. [2018-04-11 11:16:02,309 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 162 transitions. Word has length 54 [2018-04-11 11:16:02,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:16:02,310 INFO L459 AbstractCegarLoop]: Abstraction has 147 states and 162 transitions. [2018-04-11 11:16:02,310 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-11 11:16:02,310 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 162 transitions. [2018-04-11 11:16:02,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-11 11:16:02,310 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:16:02,311 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:16:02,311 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 11:16:02,311 INFO L82 PathProgramCache]: Analyzing trace with hash 222443310, now seen corresponding path program 1 times [2018-04-11 11:16:02,311 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:16:02,311 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:16:02,312 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:16:02,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:16:02,312 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:16:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:16:02,328 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:16:02,674 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:16:02,674 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:16:02,674 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 11:16:02,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:16:02,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:16:02,697 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:16:02,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 11:16:02,702 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:02,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:02,704 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:16:02,747 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:02,748 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:02,748 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 11:16:02,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:02,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:02,754 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-11 11:16:02,785 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 11:16:02,786 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 11:16:02,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:02,787 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:02,792 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 11:16:02,793 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:36 [2018-04-11 11:16:02,850 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 47 treesize of output 41 [2018-04-11 11:16:02,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 11:16:02,852 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:02,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:02,862 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 11:16:02,862 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:48 [2018-04-11 11:16:02,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2018-04-11 11:16:02,938 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 11:16:02,939 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 11:16:02,948 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 11:16:02,948 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:02,955 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 11:16:02,965 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 2 xjuncts. [2018-04-11 11:16:02,965 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:57, output treesize:40 [2018-04-11 11:16:03,105 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:03,105 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 11:16:03,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:03,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:16:03,114 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2018-04-11 11:16:03,205 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 11:16:03,231 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:16:03,232 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 35 [2018-04-11 11:16:03,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-11 11:16:03,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-11 11:16:03,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1138, Unknown=0, NotChecked=0, Total=1260 [2018-04-11 11:16:03,232 INFO L87 Difference]: Start difference. First operand 147 states and 162 transitions. Second operand 36 states. [2018-04-11 11:16:04,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:16:04,412 INFO L93 Difference]: Finished difference Result 206 states and 225 transitions. [2018-04-11 11:16:04,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 11:16:04,413 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 57 [2018-04-11 11:16:04,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:16:04,413 INFO L225 Difference]: With dead ends: 206 [2018-04-11 11:16:04,414 INFO L226 Difference]: Without dead ends: 206 [2018-04-11 11:16:04,414 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 915 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=555, Invalid=2985, Unknown=0, NotChecked=0, Total=3540 [2018-04-11 11:16:04,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-04-11 11:16:04,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 155. [2018-04-11 11:16:04,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-04-11 11:16:04,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 171 transitions. [2018-04-11 11:16:04,417 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 171 transitions. Word has length 57 [2018-04-11 11:16:04,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:16:04,417 INFO L459 AbstractCegarLoop]: Abstraction has 155 states and 171 transitions. [2018-04-11 11:16:04,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-11 11:16:04,418 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 171 transitions. [2018-04-11 11:16:04,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-11 11:16:04,418 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:16:04,418 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:16:04,418 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 11:16:04,419 INFO L82 PathProgramCache]: Analyzing trace with hash 222443311, now seen corresponding path program 1 times [2018-04-11 11:16:04,419 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:16:04,419 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:16:04,419 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:16:04,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:16:04,420 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:16:04,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:16:04,431 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:16:04,697 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:16:04,697 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:16:04,697 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 11:16:04,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:16:04,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:16:04,734 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:16:04,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 11:16:04,741 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:04,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:04,744 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:16:04,802 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:04,802 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:04,803 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 11:16:04,803 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:04,815 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 11:16:04,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:04,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:04,821 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-04-11 11:16:04,865 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 11:16:04,867 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 11:16:04,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:04,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:04,882 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 11:16:04,885 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 11:16:04,885 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:04,887 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:04,893 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 11:16:04,893 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:40 [2018-04-11 11:16:04,967 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 72 treesize of output 66 [2018-04-11 11:16:04,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 11:16:04,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:04,974 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:04,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-04-11 11:16:04,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 11:16:04,987 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:04,991 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:04,998 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 11:16:04,998 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:87, output treesize:67 [2018-04-11 11:16:05,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 52 [2018-04-11 11:16:05,056 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 11:16:05,056 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:05,065 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 38 treesize of output 31 [2018-04-11 11:16:05,065 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 11:16:05,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 11:16:05,090 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 37 treesize of output 31 [2018-04-11 11:16:05,091 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 11:16:05,092 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:05,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 11:16:05,100 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-11 11:16:05,104 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:16:05,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-04-11 11:16:05,108 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:05,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-04-11 11:16:05,109 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:05,114 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 11:16:05,114 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:05,118 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:05,131 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 3 xjuncts. [2018-04-11 11:16:05,131 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:85, output treesize:40 [2018-04-11 11:16:05,227 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 11:16:05,245 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:16:05,245 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 31 [2018-04-11 11:16:05,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-11 11:16:05,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-11 11:16:05,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=893, Unknown=0, NotChecked=0, Total=992 [2018-04-11 11:16:05,246 INFO L87 Difference]: Start difference. First operand 155 states and 171 transitions. Second operand 32 states. [2018-04-11 11:16:06,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:16:06,610 INFO L93 Difference]: Finished difference Result 226 states and 244 transitions. [2018-04-11 11:16:06,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 11:16:06,610 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 57 [2018-04-11 11:16:06,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:16:06,611 INFO L225 Difference]: With dead ends: 226 [2018-04-11 11:16:06,611 INFO L226 Difference]: Without dead ends: 226 [2018-04-11 11:16:06,612 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=462, Invalid=2400, Unknown=0, NotChecked=0, Total=2862 [2018-04-11 11:16:06,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-04-11 11:16:06,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 153. [2018-04-11 11:16:06,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-04-11 11:16:06,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 168 transitions. [2018-04-11 11:16:06,615 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 168 transitions. Word has length 57 [2018-04-11 11:16:06,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:16:06,615 INFO L459 AbstractCegarLoop]: Abstraction has 153 states and 168 transitions. [2018-04-11 11:16:06,615 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-11 11:16:06,616 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 168 transitions. [2018-04-11 11:16:06,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-11 11:16:06,616 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:16:06,616 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:16:06,616 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 11:16:06,616 INFO L82 PathProgramCache]: Analyzing trace with hash 445288706, now seen corresponding path program 2 times [2018-04-11 11:16:06,617 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:16:06,617 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:16:06,617 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:16:06,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:16:06,617 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:16:06,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:16:06,628 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:16:06,829 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:16:06,829 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:16:06,829 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 11:16:06,847 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 11:16:06,871 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 11:16:06,872 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 11:16:06,873 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:16:06,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 11:16:06,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:06,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:06,878 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:16:06,919 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:06,919 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:06,920 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 11:16:06,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:06,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:06,923 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-11 11:16:06,955 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 11:16:06,958 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 11:16:06,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:06,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:06,967 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 11:16:06,968 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2018-04-11 11:16:07,025 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:07,026 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:07,026 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 11:16:07,026 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:07,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:07,030 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:27 [2018-04-11 11:16:07,069 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:07,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-04-11 11:16:07,074 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 11:16:07,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:07,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:07,085 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 11:16:07,085 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:38 [2018-04-11 11:16:07,172 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 73 [2018-04-11 11:16:07,174 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 82 treesize of output 81 [2018-04-11 11:16:07,175 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:07,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 61 [2018-04-11 11:16:07,200 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 11:16:07,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:16:07,226 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 11:16:07,226 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:78, output treesize:103 [2018-04-11 11:16:07,325 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 11:16:07,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 11:16:07,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:07,331 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 11:16:07,331 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:07,333 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:07,349 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 49 [2018-04-11 11:16:07,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2018-04-11 11:16:07,350 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:07,359 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 34 treesize of output 25 [2018-04-11 11:16:07,359 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:07,370 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 26 [2018-04-11 11:16:07,370 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-11 11:16:07,381 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 26 treesize of output 17 [2018-04-11 11:16:07,381 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:07,390 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 17 treesize of output 10 [2018-04-11 11:16:07,390 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:07,394 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:07,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:07,398 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 7 variables, input treesize:97, output treesize:5 [2018-04-11 11:16:07,440 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:16:07,457 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:16:07,457 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 36 [2018-04-11 11:16:07,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-11 11:16:07,458 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-11 11:16:07,458 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1151, Unknown=0, NotChecked=0, Total=1260 [2018-04-11 11:16:07,458 INFO L87 Difference]: Start difference. First operand 153 states and 168 transitions. Second operand 36 states. [2018-04-11 11:16:11,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:16:11,332 INFO L93 Difference]: Finished difference Result 506 states and 545 transitions. [2018-04-11 11:16:11,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-04-11 11:16:11,332 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 58 [2018-04-11 11:16:11,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:16:11,333 INFO L225 Difference]: With dead ends: 506 [2018-04-11 11:16:11,333 INFO L226 Difference]: Without dead ends: 502 [2018-04-11 11:16:11,335 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2853 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1461, Invalid=9251, Unknown=0, NotChecked=0, Total=10712 [2018-04-11 11:16:11,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2018-04-11 11:16:11,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 233. [2018-04-11 11:16:11,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-04-11 11:16:11,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 262 transitions. [2018-04-11 11:16:11,338 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 262 transitions. Word has length 58 [2018-04-11 11:16:11,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:16:11,338 INFO L459 AbstractCegarLoop]: Abstraction has 233 states and 262 transitions. [2018-04-11 11:16:11,338 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-11 11:16:11,338 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 262 transitions. [2018-04-11 11:16:11,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-11 11:16:11,339 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:16:11,339 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:16:11,339 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 11:16:11,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1025917645, now seen corresponding path program 2 times [2018-04-11 11:16:11,339 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:16:11,339 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:16:11,339 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:16:11,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 11:16:11,339 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:16:11,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:16:11,347 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:16:11,600 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:16:11,600 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:16:11,600 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:16:11,605 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 11:16:11,626 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 11:16:11,627 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 11:16:11,629 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:16:11,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 11:16:11,630 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:11,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:11,632 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:16:11,662 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:11,663 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:11,663 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 11:16:11,663 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:11,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:11,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-04-11 11:16:11,676 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 11:16:11,677 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 11:16:11,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:11,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:11,687 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 11:16:11,688 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 11:16:11,688 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:11,689 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:11,695 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 11:16:11,695 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:34 [2018-04-11 11:16:11,737 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:11,738 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:11,738 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 11:16:11,738 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:11,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:11,742 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:30 [2018-04-11 11:16:11,783 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:11,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-11 11:16:11,787 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 11:16:11,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:11,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:11,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2018-04-11 11:16:11,804 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 11:16:11,804 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:11,807 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:11,815 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 11:16:11,815 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:68, output treesize:44 [2018-04-11 11:16:11,921 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 90 [2018-04-11 11:16:11,924 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 105 treesize of output 104 [2018-04-11 11:16:11,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:11,959 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 76 [2018-04-11 11:16:11,960 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 11:16:11,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:16:12,008 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 93 treesize of output 80 [2018-04-11 11:16:12,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 11:16:12,009 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:12,021 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:12,025 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 68 treesize of output 61 [2018-04-11 11:16:12,032 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 11:16:12,032 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:12,039 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:12,057 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 11:16:12,057 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:115, output treesize:149 [2018-04-11 11:16:12,162 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 72 treesize of output 58 [2018-04-11 11:16:12,163 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 32 treesize of output 21 [2018-04-11 11:16:12,163 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:12,170 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 11:16:12,170 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:12,175 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:12,198 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 83 [2018-04-11 11:16:12,199 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 68 treesize of output 59 [2018-04-11 11:16:12,200 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:12,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 64 [2018-04-11 11:16:12,222 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:16:12,242 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 64 treesize of output 57 [2018-04-11 11:16:12,242 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:12,260 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 57 treesize of output 48 [2018-04-11 11:16:12,261 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:12,302 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 59 treesize of output 56 [2018-04-11 11:16:12,302 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 11:16:12,327 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 11:16:12,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-04-11 11:16:12,362 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 11:16:12,362 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:12,367 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 11:16:12,367 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:12,370 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:12,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-04-11 11:16:12,401 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 11:16:12,401 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:12,408 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 11:16:12,408 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:12,413 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:12,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2018-04-11 11:16:12,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 11:16:12,415 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:12,421 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 11:16:12,421 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:12,425 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:12,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 42 [2018-04-11 11:16:12,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 11:16:12,427 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:12,433 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 11:16:12,434 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:12,438 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:12,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:12,460 INFO L202 ElimStorePlain]: Needed 22 recursive calls to eliminate 9 variables, input treesize:171, output treesize:9 [2018-04-11 11:16:12,498 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:16:12,516 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:16:12,516 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 32 [2018-04-11 11:16:12,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-11 11:16:12,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-11 11:16:12,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=946, Unknown=0, NotChecked=0, Total=1056 [2018-04-11 11:16:12,516 INFO L87 Difference]: Start difference. First operand 233 states and 262 transitions. Second operand 33 states. [2018-04-11 11:16:14,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:16:14,335 INFO L93 Difference]: Finished difference Result 378 states and 418 transitions. [2018-04-11 11:16:14,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-11 11:16:14,335 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 58 [2018-04-11 11:16:14,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:16:14,336 INFO L225 Difference]: With dead ends: 378 [2018-04-11 11:16:14,336 INFO L226 Difference]: Without dead ends: 378 [2018-04-11 11:16:14,337 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 704 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=545, Invalid=2995, Unknown=0, NotChecked=0, Total=3540 [2018-04-11 11:16:14,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-04-11 11:16:14,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 231. [2018-04-11 11:16:14,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-04-11 11:16:14,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 259 transitions. [2018-04-11 11:16:14,339 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 259 transitions. Word has length 58 [2018-04-11 11:16:14,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:16:14,339 INFO L459 AbstractCegarLoop]: Abstraction has 231 states and 259 transitions. [2018-04-11 11:16:14,339 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-11 11:16:14,339 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 259 transitions. [2018-04-11 11:16:14,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-11 11:16:14,340 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:16:14,340 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:16:14,340 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 11:16:14,340 INFO L82 PathProgramCache]: Analyzing trace with hash 2146210892, now seen corresponding path program 2 times [2018-04-11 11:16:14,340 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:16:14,340 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:16:14,341 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:16:14,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 11:16:14,341 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:16:14,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:16:14,347 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:16:14,518 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:16:14,518 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:16:14,519 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:16:14,523 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 11:16:14,541 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 11:16:14,541 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 11:16:14,542 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:16:14,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 11:16:14,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:14,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:14,546 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:16:14,590 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:14,591 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:14,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 11:16:14,591 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:14,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:14,594 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-11 11:16:14,634 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 11:16:14,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9 [2018-04-11 11:16:14,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:14,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:14,641 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 11:16:14,642 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:32 [2018-04-11 11:16:14,696 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:14,697 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:14,697 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 11:16:14,697 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:14,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:14,701 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:28 [2018-04-11 11:16:14,743 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:14,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2018-04-11 11:16:14,747 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 11:16:14,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:14,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:14,762 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 11:16:14,762 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2018-04-11 11:16:14,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 66 [2018-04-11 11:16:14,847 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 69 treesize of output 68 [2018-04-11 11:16:14,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:14,863 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:14,867 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 2 case distinctions, treesize of input 42 treesize of output 55 [2018-04-11 11:16:14,867 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 11:16:14,878 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:16:14,888 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 11:16:14,888 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:64, output treesize:81 [2018-04-11 11:16:14,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 55 [2018-04-11 11:16:14,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 42 [2018-04-11 11:16:14,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 11:16:15,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 34 [2018-04-11 11:16:15,007 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 11:16:15,028 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 24 treesize of output 25 [2018-04-11 11:16:15,028 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 11:16:15,031 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 22 treesize of output 23 [2018-04-11 11:16:15,032 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-11 11:16:15,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-11 11:16:15,054 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:15,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2018-04-11 11:16:15,055 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:15,073 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 16 treesize of output 9 [2018-04-11 11:16:15,074 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:15,074 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 14 treesize of output 6 [2018-04-11 11:16:15,075 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:15,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:16:15,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-04-11 11:16:15,092 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 11:16:15,092 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:15,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 11:16:15,098 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-04-11 11:16:15,107 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:16:15,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:16:15,118 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:99, output treesize:11 [2018-04-11 11:16:15,163 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:16:15,180 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:16:15,180 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 37 [2018-04-11 11:16:15,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-11 11:16:15,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-11 11:16:15,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1235, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 11:16:15,181 INFO L87 Difference]: Start difference. First operand 231 states and 259 transitions. Second operand 37 states. [2018-04-11 11:16:18,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:16:18,390 INFO L93 Difference]: Finished difference Result 510 states and 549 transitions. [2018-04-11 11:16:18,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-04-11 11:16:18,390 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 60 [2018-04-11 11:16:18,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:16:18,391 INFO L225 Difference]: With dead ends: 510 [2018-04-11 11:16:18,392 INFO L226 Difference]: Without dead ends: 510 [2018-04-11 11:16:18,393 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2109 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1118, Invalid=8002, Unknown=0, NotChecked=0, Total=9120 [2018-04-11 11:16:18,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2018-04-11 11:16:18,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 258. [2018-04-11 11:16:18,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-04-11 11:16:18,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 295 transitions. [2018-04-11 11:16:18,396 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 295 transitions. Word has length 60 [2018-04-11 11:16:18,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:16:18,396 INFO L459 AbstractCegarLoop]: Abstraction has 258 states and 295 transitions. [2018-04-11 11:16:18,396 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-11 11:16:18,396 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 295 transitions. [2018-04-11 11:16:18,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-11 11:16:18,397 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:16:18,397 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:16:18,397 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 11:16:18,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1381091074, now seen corresponding path program 1 times [2018-04-11 11:16:18,397 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:16:18,397 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:16:18,397 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:16:18,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 11:16:18,397 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:16:18,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:16:18,406 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:16:18,849 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:16:18,849 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:16:18,849 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:16:18,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:16:18,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:16:18,872 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:16:18,973 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 11:16:18,975 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 11:16:18,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:18,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:18,982 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 11:16:18,983 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:44 [2018-04-11 11:16:19,052 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:19,055 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 55 treesize of output 59 [2018-04-11 11:16:19,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 11:16:19,056 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:19,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:19,066 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 11:16:19,066 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:56 [2018-04-11 11:16:19,126 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:19,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 55 [2018-04-11 11:16:19,132 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 41 treesize of output 34 [2018-04-11 11:16:19,132 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 11:16:19,143 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 11:16:19,143 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:19,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 11:16:19,159 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 2 xjuncts. [2018-04-11 11:16:19,159 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:65, output treesize:56 [2018-04-11 11:16:19,262 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~p~0.base Int)) (let ((.cse0 (store |c_old(#valid)| main_~p~0.base 1))) (and (= 0 (select |c_old(#valid)| main_~p~0.base)) (= |c_#valid| (store (store .cse0 c_main_~t~0.base 1) main_~p~0.base 0)) (= (select .cse0 c_main_~t~0.base) 0)))) is different from true [2018-04-11 11:16:19,264 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_subst_10 Int)) (let ((.cse0 (store |c_old(#valid)| v_subst_10 1))) (and (= 0 (select .cse0 c_main_~p~0.base)) (= 0 (select |c_old(#valid)| v_subst_10)) (= |c_#valid| (store (store .cse0 c_main_~p~0.base 1) v_subst_10 0))))) is different from true [2018-04-11 11:16:19,267 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~p~0.base Int) (v_subst_10 Int)) (let ((.cse0 (store |c_old(#valid)| v_subst_10 1))) (and (= |c_#valid| (store (store (store .cse0 main_~p~0.base 1) v_subst_10 0) main_~p~0.base 0)) (= 0 (select .cse0 main_~p~0.base)) (= 0 (select |c_old(#valid)| v_subst_10))))) is different from true [2018-04-11 11:16:19,279 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2018-04-11 11:16:19,297 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:16:19,297 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 35 [2018-04-11 11:16:19,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-11 11:16:19,297 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-11 11:16:19,297 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=972, Unknown=3, NotChecked=192, Total=1260 [2018-04-11 11:16:19,298 INFO L87 Difference]: Start difference. First operand 258 states and 295 transitions. Second operand 36 states. [2018-04-11 11:16:20,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:16:20,886 INFO L93 Difference]: Finished difference Result 288 states and 326 transitions. [2018-04-11 11:16:20,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 11:16:20,886 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 63 [2018-04-11 11:16:20,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:16:20,887 INFO L225 Difference]: With dead ends: 288 [2018-04-11 11:16:20,887 INFO L226 Difference]: Without dead ends: 283 [2018-04-11 11:16:20,888 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=286, Invalid=2574, Unknown=14, NotChecked=318, Total=3192 [2018-04-11 11:16:20,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-04-11 11:16:20,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 258. [2018-04-11 11:16:20,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-04-11 11:16:20,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 295 transitions. [2018-04-11 11:16:20,891 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 295 transitions. Word has length 63 [2018-04-11 11:16:20,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:16:20,891 INFO L459 AbstractCegarLoop]: Abstraction has 258 states and 295 transitions. [2018-04-11 11:16:20,891 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-11 11:16:20,891 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 295 transitions. [2018-04-11 11:16:20,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-11 11:16:20,891 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:16:20,892 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:16:20,892 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 11:16:20,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1124954302, now seen corresponding path program 1 times [2018-04-11 11:16:20,892 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:16:20,892 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:16:20,892 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:16:20,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:16:20,893 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:16:20,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:16:20,904 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:16:21,097 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 11:16:21,098 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:16:21,098 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:16:21,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:16:21,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:16:21,127 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:16:21,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 11:16:21,129 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:21,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:21,130 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 11:16:21,155 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 11:16:21,157 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 11:16:21,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:21,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:21,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:21,163 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-04-11 11:16:21,181 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:21,182 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:21,182 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 11:16:21,182 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:21,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:21,190 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:28 [2018-04-11 11:16:21,249 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 11:16:21,251 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 11:16:21,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:21,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:21,261 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 11:16:21,261 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:40 [2018-04-11 11:16:21,326 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:21,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 28 [2018-04-11 11:16:21,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 11:16:21,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:21,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:21,341 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 11:16:21,341 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:43 [2018-04-11 11:16:21,363 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:21,367 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 19 treesize of output 26 [2018-04-11 11:16:21,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 11:16:21,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:21,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:21,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:21,382 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:54, output treesize:56 [2018-04-11 11:16:21,415 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:21,416 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:21,417 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:21,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-04-11 11:16:21,417 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:21,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:21,423 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:61, output treesize:54 [2018-04-11 11:16:21,474 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:21,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 57 [2018-04-11 11:16:21,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9 [2018-04-11 11:16:21,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:21,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:21,491 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 11:16:21,492 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:66 [2018-04-11 11:16:21,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 54 [2018-04-11 11:16:21,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 13 [2018-04-11 11:16:21,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:21,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2018-04-11 11:16:21,536 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 11:16:21,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:16:21,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 11:16:21,545 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:84, output treesize:27 [2018-04-11 11:16:21,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-04-11 11:16:21,640 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 11:16:21,640 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:21,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:21,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-11 11:16:21,656 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:38, output treesize:34 [2018-04-11 11:16:21,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2018-04-11 11:16:21,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 11:16:21,737 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:21,751 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 11:16:21,751 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:21,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 11:16:21,753 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:21,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:21,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:21,757 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:41, output treesize:3 [2018-04-11 11:16:21,766 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 11:16:21,783 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:16:21,783 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 35 [2018-04-11 11:16:21,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-11 11:16:21,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-11 11:16:21,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1026, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 11:16:21,783 INFO L87 Difference]: Start difference. First operand 258 states and 295 transitions. Second operand 35 states. [2018-04-11 11:16:23,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:16:23,820 INFO L93 Difference]: Finished difference Result 506 states and 561 transitions. [2018-04-11 11:16:23,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-11 11:16:23,820 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 63 [2018-04-11 11:16:23,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:16:23,823 INFO L225 Difference]: With dead ends: 506 [2018-04-11 11:16:23,824 INFO L226 Difference]: Without dead ends: 506 [2018-04-11 11:16:23,825 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1691 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1017, Invalid=5303, Unknown=0, NotChecked=0, Total=6320 [2018-04-11 11:16:23,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2018-04-11 11:16:23,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 257. [2018-04-11 11:16:23,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-04-11 11:16:23,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 292 transitions. [2018-04-11 11:16:23,830 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 292 transitions. Word has length 63 [2018-04-11 11:16:23,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:16:23,831 INFO L459 AbstractCegarLoop]: Abstraction has 257 states and 292 transitions. [2018-04-11 11:16:23,831 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-11 11:16:23,831 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 292 transitions. [2018-04-11 11:16:23,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-11 11:16:23,831 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:16:23,831 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:16:23,831 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 11:16:23,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1341417836, now seen corresponding path program 2 times [2018-04-11 11:16:23,832 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:16:23,832 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:16:23,832 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:16:23,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:16:23,832 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:16:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:16:23,841 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:16:24,132 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:16:24,132 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:16:24,132 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:16:24,138 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 11:16:24,157 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 11:16:24,157 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 11:16:24,159 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:16:24,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 11:16:24,161 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:24,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:24,163 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:16:24,188 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:24,189 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:24,189 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 11:16:24,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:24,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:24,193 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-04-11 11:16:24,203 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 11:16:24,204 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 11:16:24,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:24,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:24,212 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 11:16:24,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 10 treesize of output 9 [2018-04-11 11:16:24,213 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:24,214 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:24,219 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 11:16:24,219 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:29 [2018-04-11 11:16:24,257 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 58 treesize of output 59 [2018-04-11 11:16:24,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-04-11 11:16:24,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:24,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:24,272 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 51 treesize of output 47 [2018-04-11 11:16:24,273 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 18 treesize of output 17 [2018-04-11 11:16:24,273 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:24,276 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:24,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:24,280 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:69, output treesize:53 [2018-04-11 11:16:24,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2018-04-11 11:16:24,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 16 [2018-04-11 11:16:24,387 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 11:16:24,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-04-11 11:16:24,393 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 11:16:24,399 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 11:16:24,411 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 37 treesize of output 29 [2018-04-11 11:16:24,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-04-11 11:16:24,415 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-11 11:16:24,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 9 treesize of output 3 [2018-04-11 11:16:24,421 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:24,422 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 16 treesize of output 6 [2018-04-11 11:16:24,422 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:24,427 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:16:24,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2018-04-11 11:16:24,430 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:24,432 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 17 treesize of output 10 [2018-04-11 11:16:24,432 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:24,437 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 16 treesize of output 6 [2018-04-11 11:16:24,437 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:24,438 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:24,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-11 11:16:24,446 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:76, output treesize:24 [2018-04-11 11:16:24,493 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 11:16:24,512 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:16:24,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 29 [2018-04-11 11:16:24,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-11 11:16:24,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-11 11:16:24,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=724, Unknown=2, NotChecked=0, Total=812 [2018-04-11 11:16:24,513 INFO L87 Difference]: Start difference. First operand 257 states and 292 transitions. Second operand 29 states. [2018-04-11 11:16:25,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:16:25,513 INFO L93 Difference]: Finished difference Result 272 states and 305 transitions. [2018-04-11 11:16:25,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 11:16:25,513 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 66 [2018-04-11 11:16:25,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:16:25,514 INFO L225 Difference]: With dead ends: 272 [2018-04-11 11:16:25,514 INFO L226 Difference]: Without dead ends: 230 [2018-04-11 11:16:25,514 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 55 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=369, Invalid=2078, Unknown=3, NotChecked=0, Total=2450 [2018-04-11 11:16:25,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-04-11 11:16:25,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 221. [2018-04-11 11:16:25,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-04-11 11:16:25,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 253 transitions. [2018-04-11 11:16:25,516 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 253 transitions. Word has length 66 [2018-04-11 11:16:25,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:16:25,516 INFO L459 AbstractCegarLoop]: Abstraction has 221 states and 253 transitions. [2018-04-11 11:16:25,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-11 11:16:25,516 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 253 transitions. [2018-04-11 11:16:25,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-11 11:16:25,517 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:16:25,517 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:16:25,517 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 11:16:25,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1799993438, now seen corresponding path program 2 times [2018-04-11 11:16:25,517 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:16:25,517 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:16:25,518 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:16:25,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 11:16:25,518 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:16:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:16:25,527 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:16:25,898 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:16:25,898 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:16:25,898 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:16:25,904 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 11:16:25,930 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 11:16:25,930 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 11:16:25,933 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:16:25,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 11:16:25,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:25,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:25,938 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:16:25,977 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:25,978 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:25,978 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 11:16:25,978 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:25,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:25,984 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-11 11:16:26,031 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 11:16:26,032 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 11:16:26,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:26,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:26,050 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 11:16:26,051 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 11:16:26,052 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:26,053 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:26,060 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 11:16:26,060 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2018-04-11 11:16:26,117 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 14 [2018-04-11 11:16:26,118 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 19 [2018-04-11 11:16:26,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:26,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:26,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:26,126 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:55 [2018-04-11 11:16:26,153 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:26,154 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:26,155 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:26,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 11:16:26,155 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:26,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:26,162 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:60, output treesize:53 [2018-04-11 11:16:26,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2018-04-11 11:16:26,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9 [2018-04-11 11:16:26,229 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:26,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:26,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 49 [2018-04-11 11:16:26,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 11:16:26,249 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:26,253 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:26,262 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 11:16:26,262 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:79, output treesize:65 [2018-04-11 11:16:26,351 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:26,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 56 [2018-04-11 11:16:26,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-04-11 11:16:26,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:26,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:26,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:26,365 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:115, output treesize:129 [2018-04-11 11:16:26,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 158 [2018-04-11 11:16:26,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-04-11 11:16:26,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:26,410 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:26,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 153 [2018-04-11 11:16:26,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-04-11 11:16:26,426 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:26,433 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:26,441 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 11:16:26,441 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:206, output treesize:162 [2018-04-11 11:16:26,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 126 [2018-04-11 11:16:26,529 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 11:16:26,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:26,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 29 [2018-04-11 11:16:26,537 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 11:16:26,545 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:16:26,545 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 39 treesize of output 27 [2018-04-11 11:16:26,545 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:26,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:16:26,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 30 treesize of output 28 [2018-04-11 11:16:26,562 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 11:16:26,562 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:26,570 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:16:26,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-11 11:16:26,570 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:26,573 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:26,582 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 11:16:26,582 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:173, output treesize:19 [2018-04-11 11:16:26,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-04-11 11:16:26,644 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 11:16:26,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:26,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 11:16:26,648 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:26,649 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:26,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:26,651 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-04-11 11:16:26,666 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:16:26,688 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:16:26,688 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 41 [2018-04-11 11:16:26,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-11 11:16:26,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-11 11:16:26,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1462, Unknown=0, NotChecked=0, Total=1640 [2018-04-11 11:16:26,689 INFO L87 Difference]: Start difference. First operand 221 states and 253 transitions. Second operand 41 states. [2018-04-11 11:16:28,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:16:28,459 INFO L93 Difference]: Finished difference Result 394 states and 439 transitions. [2018-04-11 11:16:28,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-11 11:16:28,460 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 67 [2018-04-11 11:16:28,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:16:28,461 INFO L225 Difference]: With dead ends: 394 [2018-04-11 11:16:28,461 INFO L226 Difference]: Without dead ends: 392 [2018-04-11 11:16:28,461 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1469 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=726, Invalid=4676, Unknown=0, NotChecked=0, Total=5402 [2018-04-11 11:16:28,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-04-11 11:16:28,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 268. [2018-04-11 11:16:28,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-04-11 11:16:28,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 306 transitions. [2018-04-11 11:16:28,464 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 306 transitions. Word has length 67 [2018-04-11 11:16:28,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:16:28,464 INFO L459 AbstractCegarLoop]: Abstraction has 268 states and 306 transitions. [2018-04-11 11:16:28,464 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-11 11:16:28,464 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 306 transitions. [2018-04-11 11:16:28,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-11 11:16:28,465 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:16:28,465 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:16:28,465 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 11:16:28,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1219364500, now seen corresponding path program 2 times [2018-04-11 11:16:28,465 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:16:28,465 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:16:28,466 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:16:28,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 11:16:28,466 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:16:28,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:16:28,475 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:16:28,973 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:16:28,973 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:16:28,973 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:16:28,978 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 11:16:29,000 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 11:16:29,000 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 11:16:29,003 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:16:29,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 11:16:29,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:29,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:29,007 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:16:29,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 11:16:29,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:29,049 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:29,049 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:29,049 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 11:16:29,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:29,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:29,057 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2018-04-11 11:16:29,107 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 11:16:29,109 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 11:16:29,109 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:29,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:29,121 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 11:16:29,122 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 11:16:29,122 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:29,123 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:29,132 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 11:16:29,132 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:58, output treesize:56 [2018-04-11 11:16:29,167 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 11:16:29,168 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 11:16:29,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:29,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:29,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:29,175 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:45 [2018-04-11 11:16:29,253 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:29,253 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 11:16:29,253 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:29,265 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:29,265 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:29,266 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:29,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 50 [2018-04-11 11:16:29,266 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:29,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:29,278 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:70 [2018-04-11 11:16:29,350 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:29,352 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:29,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 67 [2018-04-11 11:16:29,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 22 treesize of output 18 [2018-04-11 11:16:29,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:29,360 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:29,371 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 11:16:29,371 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:83, output treesize:86 [2018-04-11 11:16:29,491 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:29,493 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:29,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 107 [2018-04-11 11:16:29,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 11:16:29,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:29,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:29,516 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 11:16:29,517 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:128, output treesize:114 [2018-04-11 11:16:29,703 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 36 treesize of output 22 [2018-04-11 11:16:29,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:29,715 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:29,717 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:29,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 71 [2018-04-11 11:16:29,722 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2018-04-11 11:16:29,723 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 11:16:29,736 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:16:29,740 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 44 [2018-04-11 11:16:29,741 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 11:16:29,742 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:16:29,742 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 42 treesize of output 30 [2018-04-11 11:16:29,743 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:29,760 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 11:16:29,760 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:29,770 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 11:16:29,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-11 11:16:29,789 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:138, output treesize:57 [2018-04-11 11:16:29,881 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:16:29,900 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:16:29,900 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 42 [2018-04-11 11:16:29,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-11 11:16:29,900 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-11 11:16:29,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1626, Unknown=0, NotChecked=0, Total=1806 [2018-04-11 11:16:29,901 INFO L87 Difference]: Start difference. First operand 268 states and 306 transitions. Second operand 43 states. [2018-04-11 11:16:34,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:16:34,164 INFO L93 Difference]: Finished difference Result 367 states and 406 transitions. [2018-04-11 11:16:34,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 11:16:34,164 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 67 [2018-04-11 11:16:34,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:16:34,165 INFO L225 Difference]: With dead ends: 367 [2018-04-11 11:16:34,165 INFO L226 Difference]: Without dead ends: 367 [2018-04-11 11:16:34,165 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1358 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=689, Invalid=4423, Unknown=0, NotChecked=0, Total=5112 [2018-04-11 11:16:34,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-04-11 11:16:34,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 271. [2018-04-11 11:16:34,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-04-11 11:16:34,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 310 transitions. [2018-04-11 11:16:34,168 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 310 transitions. Word has length 67 [2018-04-11 11:16:34,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:16:34,169 INFO L459 AbstractCegarLoop]: Abstraction has 271 states and 310 transitions. [2018-04-11 11:16:34,169 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-11 11:16:34,169 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 310 transitions. [2018-04-11 11:16:34,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-11 11:16:34,169 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:16:34,169 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:16:34,169 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 11:16:34,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1219364499, now seen corresponding path program 3 times [2018-04-11 11:16:34,169 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:16:34,170 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:16:34,170 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:16:34,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 11:16:34,170 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:16:34,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:16:34,182 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:16:34,639 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:16:34,640 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:16:34,640 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:16:34,644 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 11:16:34,667 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-11 11:16:34,667 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 11:16:34,670 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:16:34,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 11:16:34,672 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:34,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:34,674 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:16:34,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 11:16:34,702 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:34,709 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:34,710 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:34,710 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 11:16:34,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:34,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:34,717 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2018-04-11 11:16:34,763 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 11:16:34,765 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 11:16:34,765 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:34,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:34,776 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 11:16:34,778 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 11:16:34,778 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:34,779 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:34,787 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 11:16:34,787 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:55, output treesize:56 [2018-04-11 11:16:34,880 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 9 treesize of output 7 [2018-04-11 11:16:34,881 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 11:16:34,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:34,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:34,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:34,889 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:56 [2018-04-11 11:16:34,912 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:34,913 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 11:16:34,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:34,927 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:34,927 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:34,928 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:34,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-11 11:16:34,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:34,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:34,936 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:62 [2018-04-11 11:16:34,996 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:34,998 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:34,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 58 [2018-04-11 11:16:35,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-11 11:16:35,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:35,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:35,017 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:35,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 33 [2018-04-11 11:16:35,020 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 11:16:35,020 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:35,024 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:35,033 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 11:16:35,034 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:85, output treesize:82 [2018-04-11 11:16:35,135 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 22 [2018-04-11 11:16:35,137 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 22 treesize of output 35 [2018-04-11 11:16:35,137 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:35,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:35,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:35,149 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:141, output treesize:165 [2018-04-11 11:16:35,191 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:35,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 229 treesize of output 223 [2018-04-11 11:16:35,202 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 38 treesize of output 37 [2018-04-11 11:16:35,203 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:35,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:35,242 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:35,245 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:35,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 213 treesize of output 198 [2018-04-11 11:16:35,249 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 38 treesize of output 37 [2018-04-11 11:16:35,249 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:35,260 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:35,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:35,272 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:241, output treesize:205 [2018-04-11 11:16:35,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 43 [2018-04-11 11:16:35,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 11:16:35,486 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:35,490 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 19 treesize of output 1 [2018-04-11 11:16:35,490 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:35,491 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:35,503 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 11:16:35,504 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:219, output treesize:177 [2018-04-11 11:16:35,551 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:35,553 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:35,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 163 [2018-04-11 11:16:35,556 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:16:35,561 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 68 [2018-04-11 11:16:35,562 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 11:16:35,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 92 [2018-04-11 11:16:35,580 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 11:16:35,592 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 17 treesize of output 1 [2018-04-11 11:16:35,592 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:35,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:16:35,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2018-04-11 11:16:35,616 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 13 treesize of output 1 [2018-04-11 11:16:35,616 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:35,623 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:16:35,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-11 11:16:35,623 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:35,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-11 11:16:35,627 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:35,629 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:35,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:16:35,635 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:207, output treesize:18 [2018-04-11 11:16:35,711 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:16:35,730 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:16:35,730 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 44 [2018-04-11 11:16:35,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-11 11:16:35,730 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-11 11:16:35,730 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1797, Unknown=0, NotChecked=0, Total=1980 [2018-04-11 11:16:35,731 INFO L87 Difference]: Start difference. First operand 271 states and 310 transitions. Second operand 45 states. [2018-04-11 11:16:38,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:16:38,041 INFO L93 Difference]: Finished difference Result 381 states and 421 transitions. [2018-04-11 11:16:38,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 11:16:38,041 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 67 [2018-04-11 11:16:38,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:16:38,042 INFO L225 Difference]: With dead ends: 381 [2018-04-11 11:16:38,042 INFO L226 Difference]: Without dead ends: 381 [2018-04-11 11:16:38,043 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1342 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=595, Invalid=4235, Unknown=0, NotChecked=0, Total=4830 [2018-04-11 11:16:38,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-04-11 11:16:38,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 279. [2018-04-11 11:16:38,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-04-11 11:16:38,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 319 transitions. [2018-04-11 11:16:38,046 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 319 transitions. Word has length 67 [2018-04-11 11:16:38,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:16:38,047 INFO L459 AbstractCegarLoop]: Abstraction has 279 states and 319 transitions. [2018-04-11 11:16:38,047 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-11 11:16:38,047 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 319 transitions. [2018-04-11 11:16:38,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-11 11:16:38,047 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:16:38,047 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:16:38,047 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 11:16:38,047 INFO L82 PathProgramCache]: Analyzing trace with hash 757697858, now seen corresponding path program 3 times [2018-04-11 11:16:38,047 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:16:38,048 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:16:38,048 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:16:38,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 11:16:38,048 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:16:38,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:16:38,061 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:16:38,409 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:16:38,409 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:16:38,409 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:16:38,414 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 11:16:38,437 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-11 11:16:38,437 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 11:16:38,439 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:16:38,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 11:16:38,441 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:38,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:38,444 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:16:38,472 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:38,472 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:38,473 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 11:16:38,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:38,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:38,476 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-11 11:16:38,484 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 11:16:38,485 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 11:16:38,485 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:38,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:38,490 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 11:16:38,490 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-04-11 11:16:38,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 14 [2018-04-11 11:16:38,587 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 11:16:38,587 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:38,588 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:38,594 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:38,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2018-04-11 11:16:38,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 11:16:38,597 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:38,601 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:38,606 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 11:16:38,606 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:28 [2018-04-11 11:16:38,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2018-04-11 11:16:38,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-11 11:16:38,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:38,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:38,631 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 11:16:38,632 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:28 [2018-04-11 11:16:38,677 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 18 [2018-04-11 11:16:38,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-04-11 11:16:38,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:38,680 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:38,685 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 11:16:38,685 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:45 [2018-04-11 11:16:38,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 72 [2018-04-11 11:16:38,733 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 76 treesize of output 75 [2018-04-11 11:16:38,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:38,800 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 51 [2018-04-11 11:16:38,801 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 11:16:38,846 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2018-04-11 11:16:38,847 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:16:38,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-11 11:16:38,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2018-04-11 11:16:38,891 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:60, output treesize:187 [2018-04-11 11:16:39,065 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 61 [2018-04-11 11:16:39,066 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:16:39,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 11:16:39,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:39,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:39,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 59 treesize of output 63 [2018-04-11 11:16:39,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 49 [2018-04-11 11:16:39,102 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:39,118 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:16:39,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2018-04-11 11:16:39,119 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:39,133 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:16:39,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 47 [2018-04-11 11:16:39,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 11:16:39,166 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:39,171 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:39,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-04-11 11:16:39,198 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:169, output treesize:162 [2018-04-11 11:16:39,518 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 47 [2018-04-11 11:16:39,519 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 35 treesize of output 26 [2018-04-11 11:16:39,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:39,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-04-11 11:16:39,529 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:39,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:39,540 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 11:16:39,540 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:93, output treesize:10 [2018-04-11 11:16:39,564 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:39,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-11 11:16:39,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:39,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:16:39,568 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-04-11 11:16:39,625 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:16:39,642 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:16:39,642 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 27] total 45 [2018-04-11 11:16:39,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-04-11 11:16:39,642 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-04-11 11:16:39,642 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1906, Unknown=0, NotChecked=0, Total=2070 [2018-04-11 11:16:39,642 INFO L87 Difference]: Start difference. First operand 279 states and 319 transitions. Second operand 46 states. [2018-04-11 11:16:40,948 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 120 DAG size of output 87 [2018-04-11 11:16:41,376 WARN L151 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 120 DAG size of output 88 [2018-04-11 11:16:41,640 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 120 DAG size of output 88 [2018-04-11 11:16:42,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:16:42,804 INFO L93 Difference]: Finished difference Result 394 states and 435 transitions. [2018-04-11 11:16:42,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-11 11:16:42,805 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 72 [2018-04-11 11:16:42,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:16:42,805 INFO L225 Difference]: With dead ends: 394 [2018-04-11 11:16:42,805 INFO L226 Difference]: Without dead ends: 394 [2018-04-11 11:16:42,806 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1804 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=821, Invalid=5821, Unknown=0, NotChecked=0, Total=6642 [2018-04-11 11:16:42,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-04-11 11:16:42,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 287. [2018-04-11 11:16:42,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-04-11 11:16:42,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 328 transitions. [2018-04-11 11:16:42,809 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 328 transitions. Word has length 72 [2018-04-11 11:16:42,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:16:42,809 INFO L459 AbstractCegarLoop]: Abstraction has 287 states and 328 transitions. [2018-04-11 11:16:42,809 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-04-11 11:16:42,809 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 328 transitions. [2018-04-11 11:16:42,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-11 11:16:42,810 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:16:42,810 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:16:42,810 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 11:16:42,810 INFO L82 PathProgramCache]: Analyzing trace with hash 757697859, now seen corresponding path program 2 times [2018-04-11 11:16:42,810 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:16:42,810 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:16:42,810 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:16:42,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 11:16:42,811 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:16:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:16:42,820 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:16:43,234 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:16:43,235 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:16:43,235 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:16:43,240 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 11:16:43,259 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 11:16:43,260 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 11:16:43,262 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:16:43,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 11:16:43,264 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:43,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:43,266 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:16:43,291 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:43,291 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:43,292 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 11:16:43,292 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:43,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:43,297 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-11 11:16:43,335 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 11:16:43,336 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 11:16:43,337 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:43,338 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:43,347 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 11:16:43,348 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 11:16:43,348 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:43,349 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:43,356 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 11:16:43,356 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2018-04-11 11:16:43,423 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 12 [2018-04-11 11:16:43,424 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 15 [2018-04-11 11:16:43,424 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:43,425 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:43,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:43,431 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:55 [2018-04-11 11:16:43,458 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:43,459 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:43,459 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:43,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-11 11:16:43,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:43,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:43,465 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:60, output treesize:53 [2018-04-11 11:16:43,518 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:43,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 53 [2018-04-11 11:16:43,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9 [2018-04-11 11:16:43,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:43,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:43,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 41 [2018-04-11 11:16:43,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 14 treesize of output 13 [2018-04-11 11:16:43,540 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:43,544 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:43,552 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 11:16:43,553 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:79, output treesize:61 [2018-04-11 11:16:43,640 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:43,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2018-04-11 11:16:43,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-11 11:16:43,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:43,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:43,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:43,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:95, output treesize:105 [2018-04-11 11:16:43,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 136 [2018-04-11 11:16:43,693 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 24 treesize of output 23 [2018-04-11 11:16:43,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:43,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:43,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 127 [2018-04-11 11:16:43,715 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 24 treesize of output 23 [2018-04-11 11:16:43,716 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:43,722 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:43,730 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 11:16:43,730 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:170, output treesize:134 [2018-04-11 11:16:43,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 101 [2018-04-11 11:16:43,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 27 [2018-04-11 11:16:43,827 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:16:43,837 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 11:16:43,837 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:43,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2018-04-11 11:16:43,846 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:43,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:16:43,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 26 [2018-04-11 11:16:43,860 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 11:16:43,860 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:43,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-04-11 11:16:43,863 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:43,864 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:43,868 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 11:16:43,868 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:145, output treesize:19 [2018-04-11 11:16:43,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-04-11 11:16:43,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 11:16:43,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:43,930 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 11:16:43,931 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:43,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:43,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:43,933 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-04-11 11:16:43,970 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 11:16:43,988 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:16:43,989 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 43 [2018-04-11 11:16:43,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-11 11:16:43,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-11 11:16:43,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1652, Unknown=0, NotChecked=0, Total=1806 [2018-04-11 11:16:43,989 INFO L87 Difference]: Start difference. First operand 287 states and 328 transitions. Second operand 43 states. [2018-04-11 11:16:47,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:16:47,268 INFO L93 Difference]: Finished difference Result 495 states and 540 transitions. [2018-04-11 11:16:47,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-11 11:16:47,269 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 72 [2018-04-11 11:16:47,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:16:47,269 INFO L225 Difference]: With dead ends: 495 [2018-04-11 11:16:47,270 INFO L226 Difference]: Without dead ends: 495 [2018-04-11 11:16:47,270 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1854 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=926, Invalid=6384, Unknown=0, NotChecked=0, Total=7310 [2018-04-11 11:16:47,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2018-04-11 11:16:47,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 285. [2018-04-11 11:16:47,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-04-11 11:16:47,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 324 transitions. [2018-04-11 11:16:47,275 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 324 transitions. Word has length 72 [2018-04-11 11:16:47,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:16:47,275 INFO L459 AbstractCegarLoop]: Abstraction has 285 states and 324 transitions. [2018-04-11 11:16:47,275 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-11 11:16:47,275 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 324 transitions. [2018-04-11 11:16:47,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-04-11 11:16:47,276 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:16:47,276 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 11:16:47,276 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 11:16:47,276 INFO L82 PathProgramCache]: Analyzing trace with hash 438939448, now seen corresponding path program 3 times [2018-04-11 11:16:47,276 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:16:47,276 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:16:47,277 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:16:47,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 11:16:47,277 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:16:47,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:16:47,290 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:16:47,852 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:16:47,852 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:16:47,852 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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:16:47,857 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 11:16:47,916 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-11 11:16:47,916 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 11:16:47,919 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:16:47,928 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:47,929 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:47,929 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 11:16:47,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:47,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:47,935 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-11 11:16:47,954 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 11:16:47,955 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 11:16:47,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:47,957 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:47,964 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 11:16:47,964 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-04-11 11:16:48,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 14 [2018-04-11 11:16:48,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 11:16:48,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:48,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:48,088 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:48,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2018-04-11 11:16:48,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 11:16:48,091 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:48,096 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:48,102 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 11:16:48,102 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:33 [2018-04-11 11:16:48,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 15 [2018-04-11 11:16:48,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:48,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:16:48,223 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:58 [2018-04-11 11:16:48,306 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 3 case distinctions, treesize of input 40 treesize of output 54 [2018-04-11 11:16:48,308 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 45 treesize of output 44 [2018-04-11 11:16:48,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:48,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:48,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 63 [2018-04-11 11:16:48,351 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:16:48,352 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2018-04-11 11:16:48,352 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:16:48,377 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 54 treesize of output 53 [2018-04-11 11:16:48,377 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:48,396 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 11:16:48,414 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 11:16:48,415 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:81, output treesize:128 [2018-04-11 11:16:48,476 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 72 treesize of output 64 [2018-04-11 11:16:48,478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-04-11 11:16:48,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:48,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-11 11:16:48,487 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:48,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:48,517 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 1 case distinctions, treesize of input 88 treesize of output 84 [2018-04-11 11:16:48,519 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 80 treesize of output 69 [2018-04-11 11:16:48,519 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:48,545 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 61 [2018-04-11 11:16:48,545 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:48,570 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:16:48,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 53 [2018-04-11 11:16:48,571 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:48,585 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:48,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-11 11:16:48,602 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 8 variables, input treesize:161, output treesize:93 [2018-04-11 11:16:48,723 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 58 treesize of output 61 [2018-04-11 11:16:48,724 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 11:16:48,724 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:48,732 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:48,735 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 66 treesize of output 69 [2018-04-11 11:16:48,736 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 11:16:48,736 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:48,745 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:48,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-11 11:16:48,767 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:125, output treesize:107 [2018-04-11 11:16:48,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 74 treesize of output 92 [2018-04-11 11:16:48,856 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 85 treesize of output 84 [2018-04-11 11:16:48,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:48,920 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 75 [2018-04-11 11:16:48,921 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 11:16:49,015 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:16:49,016 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 66 treesize of output 57 [2018-04-11 11:16:49,016 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:49,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-04-11 11:16:49,101 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 71 [2018-04-11 11:16:49,102 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 67 treesize of output 66 [2018-04-11 11:16:49,103 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:49,133 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:16:49,134 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 54 treesize of output 45 [2018-04-11 11:16:49,134 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:49,151 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:16:49,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 9 dim-0 vars, and 5 xjuncts. [2018-04-11 11:16:49,201 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:141, output treesize:272 [2018-04-11 11:16:49,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-04-11 11:16:49,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 11:16:49,350 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:49,355 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:49,370 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 47 [2018-04-11 11:16:49,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 11:16:49,371 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:49,376 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:49,387 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 2 xjuncts. [2018-04-11 11:16:49,387 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:91, output treesize:66 [2018-04-11 11:16:49,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2018-04-11 11:16:49,458 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 11:16:49,458 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:49,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:49,463 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 11:16:49,463 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:11 [2018-04-11 11:16:49,500 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:16:49,518 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:16:49,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 46 [2018-04-11 11:16:49,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-04-11 11:16:49,519 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-04-11 11:16:49,519 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1952, Unknown=0, NotChecked=0, Total=2162 [2018-04-11 11:16:49,519 INFO L87 Difference]: Start difference. First operand 285 states and 324 transitions. Second operand 47 states. [2018-04-11 11:16:52,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:16:52,994 INFO L93 Difference]: Finished difference Result 478 states and 528 transitions. [2018-04-11 11:16:52,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-04-11 11:16:52,995 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 73 [2018-04-11 11:16:52,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:16:52,996 INFO L225 Difference]: With dead ends: 478 [2018-04-11 11:16:52,996 INFO L226 Difference]: Without dead ends: 478 [2018-04-11 11:16:52,996 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 49 SyntacticMatches, 7 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2645 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1190, Invalid=7928, Unknown=2, NotChecked=0, Total=9120 [2018-04-11 11:16:52,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2018-04-11 11:16:53,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 373. [2018-04-11 11:16:53,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-04-11 11:16:53,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 426 transitions. [2018-04-11 11:16:53,001 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 426 transitions. Word has length 73 [2018-04-11 11:16:53,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:16:53,001 INFO L459 AbstractCegarLoop]: Abstraction has 373 states and 426 transitions. [2018-04-11 11:16:53,001 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-04-11 11:16:53,001 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 426 transitions. [2018-04-11 11:16:53,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-04-11 11:16:53,002 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:16:53,002 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 11:16:53,002 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 11:16:53,002 INFO L82 PathProgramCache]: Analyzing trace with hash 438939449, now seen corresponding path program 4 times [2018-04-11 11:16:53,002 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:16:53,002 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:16:53,003 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:16:53,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 11:16:53,003 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:16:53,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:16:53,017 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:16:53,576 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:16:53,576 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:16:53,576 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:16:53,581 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 11:16:53,614 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 11:16:53,614 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 11:16:53,618 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:16:53,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 11:16:53,620 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:53,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:53,622 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:16:53,652 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:53,652 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:53,653 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 11:16:53,653 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:53,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:53,656 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-04-11 11:16:53,694 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 11:16:53,695 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 11:16:53,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:53,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:53,705 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 11:16:53,706 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 11:16:53,706 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:53,707 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:53,714 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 11:16:53,714 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:48, output treesize:34 [2018-04-11 11:16:53,786 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:53,786 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:53,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 11:16:53,787 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:53,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:53,791 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:37 [2018-04-11 11:16:53,851 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:53,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 33 [2018-04-11 11:16:53,855 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 11:16:53,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:53,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:53,875 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:53,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2018-04-11 11:16:53,878 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 11:16:53,878 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:53,882 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:53,891 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 11:16:53,891 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:75, output treesize:51 [2018-04-11 11:16:54,003 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:54,003 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:54,004 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 15 treesize of output 8 [2018-04-11 11:16:54,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:54,016 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 18 treesize of output 25 [2018-04-11 11:16:54,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:54,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 11:16:54,026 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:87, output treesize:80 [2018-04-11 11:16:54,110 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:54,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 81 [2018-04-11 11:16:54,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 76 [2018-04-11 11:16:54,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:54,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 57 [2018-04-11 11:16:54,161 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 11:16:54,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:16:54,208 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:16:54,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-04-11 11:16:54,212 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 11:16:54,212 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:54,219 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:54,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 11:16:54,241 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:103, output treesize:149 [2018-04-11 11:16:54,514 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 87 treesize of output 84 [2018-04-11 11:16:54,516 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 17 [2018-04-11 11:16:54,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:54,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:54,531 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 113 treesize of output 110 [2018-04-11 11:16:54,532 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 23 [2018-04-11 11:16:54,533 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:54,548 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:16:54,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-11 11:16:54,575 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:201, output treesize:219 [2018-04-11 11:16:54,692 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 164 treesize of output 164 [2018-04-11 11:16:54,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 172 [2018-04-11 11:16:54,697 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:55,642 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:16:55,643 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 134 [2018-04-11 11:16:55,644 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 11:16:56,513 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:16:56,990 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 138 treesize of output 135 [2018-04-11 11:16:56,991 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 11:16:57,588 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 3 dim-0 vars, and 5 xjuncts. [2018-04-11 11:16:58,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 126 treesize of output 126 [2018-04-11 11:16:58,688 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 127 treesize of output 126 [2018-04-11 11:16:58,688 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 11:16:58,746 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:16:58,748 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 100 [2018-04-11 11:16:58,748 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:16:58,783 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 11:17:01,143 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 122 treesize of output 137 [2018-04-11 11:17:01,149 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 94 [2018-04-11 11:17:01,149 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:01,282 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 119 treesize of output 118 [2018-04-11 11:17:01,282 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:01,316 INFO L267 ElimStorePlain]: Start of recursive call 10: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:01,321 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 82 [2018-04-11 11:17:01,322 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:17:01,323 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2018-04-11 11:17:01,323 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:01,335 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:02,236 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:02,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 150 treesize of output 166 [2018-04-11 11:17:02,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 168 [2018-04-11 11:17:02,252 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:02,335 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:02,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 160 treesize of output 169 [2018-04-11 11:17:02,363 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:17:02,364 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 186 [2018-04-11 11:17:02,364 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:02,511 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 157 treesize of output 156 [2018-04-11 11:17:02,511 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:02,551 INFO L267 ElimStorePlain]: Start of recursive call 17: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:02,556 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 122 [2018-04-11 11:17:02,558 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:17:02,558 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 45 [2018-04-11 11:17:02,559 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:02,572 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:02,574 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:02,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 142 [2018-04-11 11:17:02,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 132 [2018-04-11 11:17:02,588 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:02,685 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:02,691 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 180 [2018-04-11 11:17:02,693 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:17:02,694 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 53 [2018-04-11 11:17:02,694 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:02,712 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:02,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 4 dim-2 vars, End of recursive call: 24 dim-0 vars, and 7 xjuncts. [2018-04-11 11:17:02,851 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 11 variables, input treesize:291, output treesize:885 [2018-04-11 11:17:03,170 WARN L151 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 237 DAG size of output 142 [2018-04-11 11:17:03,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 163 treesize of output 167 [2018-04-11 11:17:03,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 158 [2018-04-11 11:17:03,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:03,377 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 158 treesize of output 137 [2018-04-11 11:17:03,377 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:03,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 155 [2018-04-11 11:17:03,415 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:03,450 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:17:03,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 74 [2018-04-11 11:17:03,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-11 11:17:03,547 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:03,556 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:03,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 125 treesize of output 129 [2018-04-11 11:17:03,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 120 [2018-04-11 11:17:03,656 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:03,690 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 120 treesize of output 105 [2018-04-11 11:17:03,690 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:03,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 117 [2018-04-11 11:17:03,723 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:03,754 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:17:03,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 102 [2018-04-11 11:17:03,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-11 11:17:03,880 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:03,892 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:03,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 14 dim-0 vars, 4 dim-2 vars, End of recursive call: 21 dim-0 vars, and 6 xjuncts. [2018-04-11 11:17:03,996 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 18 variables, input treesize:473, output treesize:627 [2018-04-11 11:17:04,280 WARN L151 SmtUtils]: Spent 186ms on a formula simplification. DAG size of input: 192 DAG size of output 136 [2018-04-11 11:17:04,369 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 116 treesize of output 100 [2018-04-11 11:17:04,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 53 [2018-04-11 11:17:04,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:04,382 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 13 treesize of output 1 [2018-04-11 11:17:04,383 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:04,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:04,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 66 [2018-04-11 11:17:04,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 53 [2018-04-11 11:17:04,427 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:04,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 40 [2018-04-11 11:17:04,450 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:04,472 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 40 treesize of output 35 [2018-04-11 11:17:04,473 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:04,494 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 0 case distinctions, treesize of input 58 treesize of output 43 [2018-04-11 11:17:04,495 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:04,521 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 40 treesize of output 31 [2018-04-11 11:17:04,521 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:04,533 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:04,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 122 [2018-04-11 11:17:04,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 102 [2018-04-11 11:17:04,566 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:17:04,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 103 [2018-04-11 11:17:04,601 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:04,634 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 102 treesize of output 89 [2018-04-11 11:17:04,635 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:04,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 78 [2018-04-11 11:17:04,667 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:04,704 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 1 case distinctions, treesize of input 103 treesize of output 95 [2018-04-11 11:17:04,704 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 11:17:04,748 INFO L267 ElimStorePlain]: Start of recursive call 11: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 11:17:04,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 70 [2018-04-11 11:17:04,808 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 66 treesize of output 57 [2018-04-11 11:17:04,808 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:04,835 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 57 treesize of output 46 [2018-04-11 11:17:04,835 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:04,861 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 0 case distinctions, treesize of input 62 treesize of output 47 [2018-04-11 11:17:04,861 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:04,883 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 44 treesize of output 35 [2018-04-11 11:17:04,884 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:04,903 INFO L267 ElimStorePlain]: Start of recursive call 17: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:04,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 74 [2018-04-11 11:17:04,911 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 0 case distinctions, treesize of input 66 treesize of output 47 [2018-04-11 11:17:04,911 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:04,935 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 44 treesize of output 35 [2018-04-11 11:17:04,936 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:04,964 INFO L267 ElimStorePlain]: Start of recursive call 22: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:04,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 74 [2018-04-11 11:17:04,971 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 70 treesize of output 61 [2018-04-11 11:17:04,971 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:05,002 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 61 treesize of output 50 [2018-04-11 11:17:05,002 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:05,032 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 0 case distinctions, treesize of input 66 treesize of output 51 [2018-04-11 11:17:05,032 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:05,056 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 48 treesize of output 39 [2018-04-11 11:17:05,056 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:05,076 INFO L267 ElimStorePlain]: Start of recursive call 25: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:05,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 4 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-04-11 11:17:05,109 INFO L202 ElimStorePlain]: Needed 29 recursive calls to eliminate 13 variables, input treesize:265, output treesize:77 [2018-04-11 11:17:05,244 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:17:05,262 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:17:05,262 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 52 [2018-04-11 11:17:05,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-04-11 11:17:05,262 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-04-11 11:17:05,262 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=2539, Unknown=2, NotChecked=0, Total=2756 [2018-04-11 11:17:05,263 INFO L87 Difference]: Start difference. First operand 373 states and 426 transitions. Second operand 53 states. [2018-04-11 11:17:06,518 WARN L151 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 159 DAG size of output 81 [2018-04-11 11:17:07,113 WARN L151 SmtUtils]: Spent 159ms on a formula simplification. DAG size of input: 218 DAG size of output 137 [2018-04-11 11:17:07,470 WARN L151 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 274 DAG size of output 133 [2018-04-11 11:17:08,290 WARN L151 SmtUtils]: Spent 314ms on a formula simplification. DAG size of input: 323 DAG size of output 165 [2018-04-11 11:17:08,887 WARN L151 SmtUtils]: Spent 228ms on a formula simplification. DAG size of input: 313 DAG size of output 135 [2018-04-11 11:17:09,621 WARN L151 SmtUtils]: Spent 228ms on a formula simplification. DAG size of input: 330 DAG size of output 150 [2018-04-11 11:17:09,969 WARN L151 SmtUtils]: Spent 180ms on a formula simplification. DAG size of input: 291 DAG size of output 148 [2018-04-11 11:17:10,288 WARN L151 SmtUtils]: Spent 195ms on a formula simplification. DAG size of input: 212 DAG size of output 136 [2018-04-11 11:17:10,500 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 98 DAG size of output 86 [2018-04-11 11:17:10,822 WARN L151 SmtUtils]: Spent 187ms on a formula simplification. DAG size of input: 182 DAG size of output 179 [2018-04-11 11:17:11,193 WARN L151 SmtUtils]: Spent 177ms on a formula simplification. DAG size of input: 281 DAG size of output 138 [2018-04-11 11:17:11,516 WARN L151 SmtUtils]: Spent 166ms on a formula simplification. DAG size of input: 249 DAG size of output 162 [2018-04-11 11:17:11,924 WARN L151 SmtUtils]: Spent 166ms on a formula simplification. DAG size of input: 283 DAG size of output 140 [2018-04-11 11:17:12,514 WARN L151 SmtUtils]: Spent 183ms on a formula simplification. DAG size of input: 252 DAG size of output 169 [2018-04-11 11:17:12,955 WARN L151 SmtUtils]: Spent 202ms on a formula simplification. DAG size of input: 242 DAG size of output 165 [2018-04-11 11:17:13,218 WARN L151 SmtUtils]: Spent 156ms on a formula simplification. DAG size of input: 163 DAG size of output 158 [2018-04-11 11:17:13,819 WARN L151 SmtUtils]: Spent 355ms on a formula simplification. DAG size of input: 291 DAG size of output 206 [2018-04-11 11:17:14,365 WARN L151 SmtUtils]: Spent 305ms on a formula simplification. DAG size of input: 273 DAG size of output 132 [2018-04-11 11:17:14,645 WARN L151 SmtUtils]: Spent 163ms on a formula simplification. DAG size of input: 155 DAG size of output 151 [2018-04-11 11:17:15,012 WARN L151 SmtUtils]: Spent 225ms on a formula simplification. DAG size of input: 249 DAG size of output 172 [2018-04-11 11:17:15,297 WARN L151 SmtUtils]: Spent 174ms on a formula simplification. DAG size of input: 173 DAG size of output 168 [2018-04-11 11:17:15,641 WARN L151 SmtUtils]: Spent 186ms on a formula simplification. DAG size of input: 251 DAG size of output 164 [2018-04-11 11:17:15,954 WARN L151 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 165 DAG size of output 161 [2018-04-11 11:17:16,388 WARN L151 SmtUtils]: Spent 170ms on a formula simplification. DAG size of input: 244 DAG size of output 157 [2018-04-11 11:17:16,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:17:16,915 INFO L93 Difference]: Finished difference Result 524 states and 584 transitions. [2018-04-11 11:17:16,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-11 11:17:16,916 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 73 [2018-04-11 11:17:16,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:17:16,917 INFO L225 Difference]: With dead ends: 524 [2018-04-11 11:17:16,917 INFO L226 Difference]: Without dead ends: 524 [2018-04-11 11:17:16,917 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2353 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=1183, Invalid=8127, Unknown=2, NotChecked=0, Total=9312 [2018-04-11 11:17:16,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2018-04-11 11:17:16,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 399. [2018-04-11 11:17:16,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-04-11 11:17:16,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 454 transitions. [2018-04-11 11:17:16,922 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 454 transitions. Word has length 73 [2018-04-11 11:17:16,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:17:16,922 INFO L459 AbstractCegarLoop]: Abstraction has 399 states and 454 transitions. [2018-04-11 11:17:16,922 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-04-11 11:17:16,923 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 454 transitions. [2018-04-11 11:17:16,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-04-11 11:17:16,923 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:17:16,923 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:17:16,924 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 11:17:16,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1061029122, now seen corresponding path program 3 times [2018-04-11 11:17:16,924 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:17:16,924 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:17:16,924 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:17:16,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 11:17:16,925 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:17:16,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:17:16,937 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:17:17,411 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 14 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:17:17,412 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:17:17,412 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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:17:17,418 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 11:17:17,455 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-11 11:17:17,456 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 11:17:17,458 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:17:17,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 11:17:17,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:17,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:17,462 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:17:17,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 11:17:17,494 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:17,502 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:17,503 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:17,503 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 11:17:17,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:17,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:17,510 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2018-04-11 11:17:17,563 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 11:17:17,564 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 11:17:17,564 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:17,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:17,578 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 11:17:17,580 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 11:17:17,580 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:17,581 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:17,591 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 11:17:17,592 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:55, output treesize:56 [2018-04-11 11:17:17,735 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:17,736 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:17,736 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:17,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-11 11:17:17,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:17,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 11:17:17,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:17,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:17,762 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:62 [2018-04-11 11:17:17,836 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:17,838 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:17,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 58 [2018-04-11 11:17:17,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-11 11:17:17,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:17,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:17,861 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:17,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 33 [2018-04-11 11:17:17,865 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 11:17:17,865 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:17,869 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:17,880 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 11:17:17,880 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:85, output treesize:82 [2018-04-11 11:17:17,921 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:17,922 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 118 treesize of output 100 [2018-04-11 11:17:17,923 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 19 treesize of output 3 [2018-04-11 11:17:17,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:17,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 53 [2018-04-11 11:17:17,932 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:17,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:17,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:17,944 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:130, output treesize:68 [2018-04-11 11:17:18,012 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 16 [2018-04-11 11:17:18,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 11:17:18,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:18,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:18,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:18,022 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:79, output treesize:83 [2018-04-11 11:17:18,058 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:18,060 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:18,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 88 [2018-04-11 11:17:18,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 11:17:18,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:18,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:18,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:18,077 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:96, output treesize:84 [2018-04-11 11:17:18,249 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:18,251 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:18,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 79 [2018-04-11 11:17:18,254 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:17:18,257 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 44 [2018-04-11 11:17:18,257 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 11:17:18,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2018-04-11 11:17:18,270 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 11:17:18,276 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:17:18,290 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 11:17:18,291 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:108, output treesize:27 [2018-04-11 11:17:18,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 11:17:18,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 11:17:18,418 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 11:17:18,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:17:18,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 11:17:18,426 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:44 [2018-04-11 11:17:18,526 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:17:18,544 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:17:18,544 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 49 [2018-04-11 11:17:18,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-04-11 11:17:18,544 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-04-11 11:17:18,544 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2188, Unknown=0, NotChecked=0, Total=2352 [2018-04-11 11:17:18,544 INFO L87 Difference]: Start difference. First operand 399 states and 454 transitions. Second operand 49 states. [2018-04-11 11:17:20,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:17:20,795 INFO L93 Difference]: Finished difference Result 425 states and 470 transitions. [2018-04-11 11:17:20,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 11:17:20,795 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 76 [2018-04-11 11:17:20,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:17:20,796 INFO L225 Difference]: With dead ends: 425 [2018-04-11 11:17:20,796 INFO L226 Difference]: Without dead ends: 425 [2018-04-11 11:17:20,796 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1362 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=552, Invalid=4998, Unknown=0, NotChecked=0, Total=5550 [2018-04-11 11:17:20,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2018-04-11 11:17:20,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 380. [2018-04-11 11:17:20,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-04-11 11:17:20,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 424 transitions. [2018-04-11 11:17:20,799 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 424 transitions. Word has length 76 [2018-04-11 11:17:20,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:17:20,799 INFO L459 AbstractCegarLoop]: Abstraction has 380 states and 424 transitions. [2018-04-11 11:17:20,799 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-04-11 11:17:20,799 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 424 transitions. [2018-04-11 11:17:20,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-04-11 11:17:20,800 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:17:20,800 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:17:20,800 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 11:17:20,800 INFO L82 PathProgramCache]: Analyzing trace with hash 2120461686, now seen corresponding path program 1 times [2018-04-11 11:17:20,800 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:17:20,800 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:17:20,801 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:17:20,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 11:17:20,801 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:17:20,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:17:20,811 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:17:21,140 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 11:17:21,140 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:17:21,140 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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:17:21,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:17:21,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:17:21,172 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:17:21,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 11:17:21,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:21,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:21,175 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:17:21,213 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:21,214 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:21,214 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 11:17:21,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:21,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:21,219 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-11 11:17:21,264 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 11:17:21,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, 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 11:17:21,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:21,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:21,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 11:17:21,277 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 11:17:21,277 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:21,278 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:21,285 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 11:17:21,285 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2018-04-11 11:17:21,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 14 [2018-04-11 11:17:21,346 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 19 [2018-04-11 11:17:21,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:21,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:21,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:21,354 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:55 [2018-04-11 11:17:21,382 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:21,383 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:21,383 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:21,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 11:17:21,384 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:21,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:21,390 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:60, output treesize:53 [2018-04-11 11:17:21,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 49 [2018-04-11 11:17:21,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 11:17:21,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:21,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:21,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 58 [2018-04-11 11:17:21,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 11:17:21,473 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:21,478 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:21,493 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 11:17:21,493 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:79, output treesize:65 [2018-04-11 11:17:21,582 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:21,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 56 [2018-04-11 11:17:21,585 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 26 treesize of output 25 [2018-04-11 11:17:21,585 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:21,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:21,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:21,596 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:115, output treesize:129 [2018-04-11 11:17:21,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 193 treesize of output 175 [2018-04-11 11:17:21,633 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 28 treesize of output 27 [2018-04-11 11:17:21,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:21,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:21,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 142 [2018-04-11 11:17:21,657 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 28 treesize of output 27 [2018-04-11 11:17:21,658 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:21,665 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:21,674 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 11:17:21,674 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:206, output treesize:162 [2018-04-11 11:17:21,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 128 [2018-04-11 11:17:21,798 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 11:17:21,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:21,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 29 [2018-04-11 11:17:21,812 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 11:17:21,820 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:17:21,820 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 41 treesize of output 29 [2018-04-11 11:17:21,820 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:21,827 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:17:21,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 32 treesize of output 30 [2018-04-11 11:17:21,845 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:17:21,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-11 11:17:21,845 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:21,849 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 11:17:21,849 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:21,850 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:21,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 11:17:21,856 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:183, output treesize:19 [2018-04-11 11:17:21,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-04-11 11:17:21,908 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 11:17:21,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:21,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 11:17:21,911 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:21,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:21,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:21,914 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-04-11 11:17:21,931 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 11:17:21,948 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:17:21,949 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 43 [2018-04-11 11:17:21,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-11 11:17:21,949 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-11 11:17:21,949 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1619, Unknown=0, NotChecked=0, Total=1806 [2018-04-11 11:17:21,949 INFO L87 Difference]: Start difference. First operand 380 states and 424 transitions. Second operand 43 states. [2018-04-11 11:17:23,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:17:23,971 INFO L93 Difference]: Finished difference Result 532 states and 583 transitions. [2018-04-11 11:17:23,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-11 11:17:23,971 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 78 [2018-04-11 11:17:23,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:17:23,973 INFO L225 Difference]: With dead ends: 532 [2018-04-11 11:17:23,973 INFO L226 Difference]: Without dead ends: 532 [2018-04-11 11:17:23,973 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1520 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=767, Invalid=4933, Unknown=0, NotChecked=0, Total=5700 [2018-04-11 11:17:23,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2018-04-11 11:17:23,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 380. [2018-04-11 11:17:23,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-04-11 11:17:23,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 423 transitions. [2018-04-11 11:17:23,978 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 423 transitions. Word has length 78 [2018-04-11 11:17:23,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:17:23,978 INFO L459 AbstractCegarLoop]: Abstraction has 380 states and 423 transitions. [2018-04-11 11:17:23,978 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-11 11:17:23,978 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 423 transitions. [2018-04-11 11:17:23,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-04-11 11:17:23,980 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:17:23,980 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-04-11 11:17:23,980 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 11:17:23,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1245178698, now seen corresponding path program 4 times [2018-04-11 11:17:23,980 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:17:23,980 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:17:23,981 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:17:23,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:17:23,981 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:17:23,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:17:23,995 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:17:24,847 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 6 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:17:24,847 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:17:24,847 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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:17:24,852 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 11:17:24,881 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 11:17:24,881 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 11:17:24,883 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:17:24,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 11:17:24,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:24,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:24,887 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:17:24,924 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:24,924 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:24,925 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 11:17:24,925 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:24,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:24,930 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-11 11:17:24,988 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 11:17:24,989 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 11:17:24,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:24,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:24,999 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 11:17:25,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 11:17:25,000 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:25,001 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:25,008 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 11:17:25,008 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:45 [2018-04-11 11:17:25,085 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:25,085 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:25,086 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:25,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 46 [2018-04-11 11:17:25,086 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:25,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:25,097 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:64 [2018-04-11 11:17:25,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-04-11 11:17:25,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 11:17:25,186 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:25,190 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:25,206 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:25,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 61 [2018-04-11 11:17:25,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 22 treesize of output 18 [2018-04-11 11:17:25,208 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:25,213 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:25,225 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 11:17:25,225 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:95, output treesize:78 [2018-04-11 11:17:25,340 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:25,341 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:25,341 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:25,342 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:25,344 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:25,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 97 [2018-04-11 11:17:25,344 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:25,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:25,354 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:128, output treesize:120 [2018-04-11 11:17:25,431 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:25,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 117 [2018-04-11 11:17:25,435 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 11:17:25,435 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:25,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:25,461 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:25,462 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:25,462 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:25,464 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:25,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 131 [2018-04-11 11:17:25,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 11:17:25,469 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:25,478 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:25,489 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 11:17:25,489 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:151, output treesize:125 [2018-04-11 11:17:25,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 313 treesize of output 289 [2018-04-11 11:17:25,640 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 34 treesize of output 33 [2018-04-11 11:17:25,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:25,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:25,669 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:25,673 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:25,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 276 treesize of output 180 [2018-04-11 11:17:25,680 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 34 treesize of output 33 [2018-04-11 11:17:25,680 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:25,692 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:25,706 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 11:17:25,706 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:316, output treesize:260 [2018-04-11 11:17:25,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 264 treesize of output 243 [2018-04-11 11:17:25,833 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 11:17:25,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:25,846 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:17:25,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 211 treesize of output 175 [2018-04-11 11:17:25,846 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:25,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:25,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 11:17:25,866 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:271, output treesize:177 [2018-04-11 11:17:25,955 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:25,956 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:25,956 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:25,957 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:25,957 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:17:25,962 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:25,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 128 [2018-04-11 11:17:25,968 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 46 [2018-04-11 11:17:25,969 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 11:17:25,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 11:17:25,988 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:25,994 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:17:25,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-04-11 11:17:25,995 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:26,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2018-04-11 11:17:26,000 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:26,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:26,004 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 11:17:26,004 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:162, output treesize:5 [2018-04-11 11:17:26,081 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:17:26,101 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:17:26,101 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 25] total 54 [2018-04-11 11:17:26,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-04-11 11:17:26,101 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-04-11 11:17:26,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=2635, Unknown=0, NotChecked=0, Total=2862 [2018-04-11 11:17:26,102 INFO L87 Difference]: Start difference. First operand 380 states and 423 transitions. Second operand 54 states. [2018-04-11 11:17:33,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:17:33,745 INFO L93 Difference]: Finished difference Result 757 states and 828 transitions. [2018-04-11 11:17:33,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-04-11 11:17:33,745 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 82 [2018-04-11 11:17:33,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:17:33,746 INFO L225 Difference]: With dead ends: 757 [2018-04-11 11:17:33,746 INFO L226 Difference]: Without dead ends: 754 [2018-04-11 11:17:33,747 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6300 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=2283, Invalid=18887, Unknown=0, NotChecked=0, Total=21170 [2018-04-11 11:17:33,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2018-04-11 11:17:33,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 497. [2018-04-11 11:17:33,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2018-04-11 11:17:33,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 559 transitions. [2018-04-11 11:17:33,750 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 559 transitions. Word has length 82 [2018-04-11 11:17:33,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:17:33,750 INFO L459 AbstractCegarLoop]: Abstraction has 497 states and 559 transitions. [2018-04-11 11:17:33,751 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-04-11 11:17:33,751 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 559 transitions. [2018-04-11 11:17:33,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-04-11 11:17:33,751 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:17:33,751 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:17:33,751 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 11:17:33,751 INFO L82 PathProgramCache]: Analyzing trace with hash -664549759, now seen corresponding path program 5 times [2018-04-11 11:17:33,751 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:17:33,751 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:17:33,752 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:17:33,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 11:17:33,752 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:17:33,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:17:33,767 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:17:34,923 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:17:34,923 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:17:34,923 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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:17:34,928 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 11:17:35,007 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-04-11 11:17:35,007 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 11:17:35,010 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:17:35,074 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:35,075 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:35,075 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 11:17:35,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:35,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:35,081 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-11 11:17:35,127 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 11:17:35,128 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 11:17:35,128 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:35,129 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:35,139 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 11:17:35,140 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 11:17:35,140 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:35,141 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:35,148 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 11:17:35,149 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:45 [2018-04-11 11:17:35,248 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:35,249 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:35,249 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:35,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 58 [2018-04-11 11:17:35,250 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:35,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:35,262 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:71, output treesize:79 [2018-04-11 11:17:35,336 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:35,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 55 [2018-04-11 11:17:35,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9 [2018-04-11 11:17:35,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:35,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:35,359 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:35,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-04-11 11:17:35,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 11:17:35,372 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:35,377 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:35,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:35,390 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:102, output treesize:109 [2018-04-11 11:17:35,549 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:35,550 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:35,550 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:35,550 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:35,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 97 [2018-04-11 11:17:35,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:35,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:35,563 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:165, output treesize:157 [2018-04-11 11:17:35,653 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:35,653 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:35,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 144 [2018-04-11 11:17:35,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 11:17:35,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:35,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:35,689 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:35,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 130 [2018-04-11 11:17:35,694 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 11:17:35,694 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:35,704 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:35,720 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 11:17:35,720 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:187, output treesize:170 [2018-04-11 11:17:35,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 363 treesize of output 352 [2018-04-11 11:17:35,912 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 34 treesize of output 33 [2018-04-11 11:17:35,912 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:35,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:35,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 336 treesize of output 216 [2018-04-11 11:17:35,981 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 34 treesize of output 33 [2018-04-11 11:17:35,982 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:35,997 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:36,030 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 11:17:36,030 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:379, output treesize:323 [2018-04-11 11:17:36,476 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:17:36,479 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:36,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 338 treesize of output 216 [2018-04-11 11:17:36,487 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 11:17:36,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:36,510 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:17:36,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 58 [2018-04-11 11:17:36,511 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 11:17:36,531 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:17:36,531 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 90 treesize of output 46 [2018-04-11 11:17:36,532 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:36,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2018-04-11 11:17:36,552 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 11:17:36,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 11:17:36,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 71 [2018-04-11 11:17:36,598 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:17:36,598 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 0 case distinctions, treesize of input 26 treesize of output 21 [2018-04-11 11:17:36,598 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:17:36,610 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:17:36,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 11:17:36,610 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:36,616 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 11:17:36,616 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:36,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 11:17:36,621 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:36,624 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:36,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:36,635 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:371, output treesize:9 [2018-04-11 11:17:36,738 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:17:36,756 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:17:36,756 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29] total 59 [2018-04-11 11:17:36,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-04-11 11:17:36,756 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-04-11 11:17:36,756 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=3309, Unknown=0, NotChecked=0, Total=3540 [2018-04-11 11:17:36,756 INFO L87 Difference]: Start difference. First operand 497 states and 559 transitions. Second operand 60 states. [2018-04-11 11:17:45,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:17:45,295 INFO L93 Difference]: Finished difference Result 614 states and 681 transitions. [2018-04-11 11:17:45,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-11 11:17:45,295 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 82 [2018-04-11 11:17:45,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:17:45,296 INFO L225 Difference]: With dead ends: 614 [2018-04-11 11:17:45,296 INFO L226 Difference]: Without dead ends: 614 [2018-04-11 11:17:45,297 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2692 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=1002, Invalid=9098, Unknown=0, NotChecked=0, Total=10100 [2018-04-11 11:17:45,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2018-04-11 11:17:45,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 510. [2018-04-11 11:17:45,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2018-04-11 11:17:45,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 574 transitions. [2018-04-11 11:17:45,301 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 574 transitions. Word has length 82 [2018-04-11 11:17:45,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:17:45,301 INFO L459 AbstractCegarLoop]: Abstraction has 510 states and 574 transitions. [2018-04-11 11:17:45,301 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-04-11 11:17:45,302 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 574 transitions. [2018-04-11 11:17:45,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-11 11:17:45,303 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:17:45,303 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 11:17:45,303 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 11:17:45,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1104673536, now seen corresponding path program 2 times [2018-04-11 11:17:45,303 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:17:45,303 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:17:45,304 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:17:45,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 11:17:45,304 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:17:45,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:17:45,317 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:17:45,783 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:17:45,783 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:17:45,783 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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:17:45,789 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 11:17:45,816 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 11:17:45,816 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 11:17:45,819 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:17:45,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 11:17:45,821 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:45,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:45,822 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 11:17:45,830 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:45,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-11 11:17:45,831 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:45,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:45,835 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:14 [2018-04-11 11:17:45,863 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:45,865 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:45,869 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 2 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 11:17:45,869 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 11:17:45,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:17:45,881 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:47 [2018-04-11 11:17:45,964 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:45,966 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:45,970 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 2 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 11:17:45,970 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 11:17:45,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:17:45,980 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:47 [2018-04-11 11:17:45,996 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:45,997 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:46,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 11:17:46,000 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 11:17:46,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:17:46,010 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:47 [2018-04-11 11:17:46,061 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:46,062 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:46,062 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:46,062 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 20 treesize of output 13 [2018-04-11 11:17:46,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:46,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:46,064 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2018-04-11 11:17:46,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-04-11 11:17:46,099 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 14 treesize of output 15 [2018-04-11 11:17:46,100 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 11:17:46,101 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:17:46,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:17:46,104 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:11 [2018-04-11 11:17:46,134 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-04-11 11:17:46,151 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:17:46,151 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 14] total 41 [2018-04-11 11:17:46,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-11 11:17:46,152 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-11 11:17:46,152 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1458, Unknown=0, NotChecked=0, Total=1640 [2018-04-11 11:17:46,152 INFO L87 Difference]: Start difference. First operand 510 states and 574 transitions. Second operand 41 states. [2018-04-11 11:17:47,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:17:47,721 INFO L93 Difference]: Finished difference Result 548 states and 615 transitions. [2018-04-11 11:17:47,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 11:17:47,721 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 84 [2018-04-11 11:17:47,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:17:47,722 INFO L225 Difference]: With dead ends: 548 [2018-04-11 11:17:47,722 INFO L226 Difference]: Without dead ends: 548 [2018-04-11 11:17:47,722 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 70 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1144 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=731, Invalid=3429, Unknown=0, NotChecked=0, Total=4160 [2018-04-11 11:17:47,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2018-04-11 11:17:47,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 513. [2018-04-11 11:17:47,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-04-11 11:17:47,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 577 transitions. [2018-04-11 11:17:47,725 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 577 transitions. Word has length 84 [2018-04-11 11:17:47,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:17:47,725 INFO L459 AbstractCegarLoop]: Abstraction has 513 states and 577 transitions. [2018-04-11 11:17:47,725 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-11 11:17:47,725 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 577 transitions. [2018-04-11 11:17:47,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-04-11 11:17:47,725 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:17:47,726 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-04-11 11:17:47,726 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 11:17:47,726 INFO L82 PathProgramCache]: Analyzing trace with hash 38849710, now seen corresponding path program 4 times [2018-04-11 11:17:47,726 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:17:47,726 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:17:47,726 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:17:47,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 11:17:47,727 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:17:47,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:17:47,735 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:17:48,342 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:17:48,342 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:17:48,342 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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:17:48,347 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 11:17:48,374 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 11:17:48,374 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 11:17:48,376 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:17:48,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 11:17:48,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:48,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:48,379 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:17:48,411 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:48,411 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:48,412 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 11:17:48,412 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:48,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:48,415 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-11 11:17:48,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 11:17:48,431 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 11:17:48,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:48,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:48,437 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 11:17:48,437 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2018-04-11 11:17:48,466 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:48,467 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:48,467 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 11:17:48,467 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:48,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:48,470 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2018-04-11 11:17:48,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-04-11 11:17:48,513 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 11:17:48,514 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:48,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:48,520 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 11:17:48,520 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-04-11 11:17:48,665 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:48,677 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 66 [2018-04-11 11:17:48,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 65 [2018-04-11 11:17:48,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:48,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 40 [2018-04-11 11:17:48,703 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 11:17:48,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:17:48,729 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 11:17:48,730 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 11:17:48,730 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:48,732 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:48,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 11:17:48,744 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:71, output treesize:81 [2018-04-11 11:17:48,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 44 [2018-04-11 11:17:48,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-11 11:17:48,795 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:48,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:48,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2018-04-11 11:17:48,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-11 11:17:48,810 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:48,817 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:48,822 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 11:17:48,822 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:117, output treesize:17 [2018-04-11 11:17:48,855 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 11:17:48,855 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 11:17:48,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:48,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:48,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:48,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-04-11 11:17:48,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 36 [2018-04-11 11:17:48,896 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:17:48,897 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2018-04-11 11:17:48,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:48,909 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 21 treesize of output 20 [2018-04-11 11:17:48,909 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:48,929 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:17:48,937 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 11:17:48,937 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:34, output treesize:51 [2018-04-11 11:17:49,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 40 treesize of output 44 [2018-04-11 11:17:49,028 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 40 treesize of output 35 [2018-04-11 11:17:49,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:49,045 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 36 treesize of output 29 [2018-04-11 11:17:49,045 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:49,058 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 35 treesize of output 30 [2018-04-11 11:17:49,058 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:49,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:17:49,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 30 treesize of output 26 [2018-04-11 11:17:49,086 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 11:17:49,086 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:49,090 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:49,101 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 2 xjuncts. [2018-04-11 11:17:49,101 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:71, output treesize:50 [2018-04-11 11:17:49,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2018-04-11 11:17:49,267 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:17:49,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 27 [2018-04-11 11:17:49,271 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 11:17:49,283 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 11:17:49,290 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 11:17:49,290 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:29 [2018-04-11 11:17:49,356 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:49,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-11 11:17:49,357 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:49,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:17:49,360 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-04-11 11:17:49,438 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:17:49,455 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:17:49,455 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 33] total 60 [2018-04-11 11:17:49,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-04-11 11:17:49,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-04-11 11:17:49,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=3364, Unknown=0, NotChecked=0, Total=3660 [2018-04-11 11:17:49,456 INFO L87 Difference]: Start difference. First operand 513 states and 577 transitions. Second operand 61 states. [2018-04-11 11:17:53,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:17:53,289 INFO L93 Difference]: Finished difference Result 594 states and 661 transitions. [2018-04-11 11:17:53,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-04-11 11:17:53,289 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 87 [2018-04-11 11:17:53,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:17:53,290 INFO L225 Difference]: With dead ends: 594 [2018-04-11 11:17:53,290 INFO L226 Difference]: Without dead ends: 594 [2018-04-11 11:17:53,291 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 55 SyntacticMatches, 8 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3633 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1489, Invalid=10943, Unknown=0, NotChecked=0, Total=12432 [2018-04-11 11:17:53,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2018-04-11 11:17:53,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 475. [2018-04-11 11:17:53,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2018-04-11 11:17:53,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 534 transitions. [2018-04-11 11:17:53,293 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 534 transitions. Word has length 87 [2018-04-11 11:17:53,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:17:53,294 INFO L459 AbstractCegarLoop]: Abstraction has 475 states and 534 transitions. [2018-04-11 11:17:53,294 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-04-11 11:17:53,294 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 534 transitions. [2018-04-11 11:17:53,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-04-11 11:17:53,294 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:17:53,294 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-04-11 11:17:53,294 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 11:17:53,295 INFO L82 PathProgramCache]: Analyzing trace with hash 38849711, now seen corresponding path program 3 times [2018-04-11 11:17:53,295 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:17:53,295 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:17:53,295 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:17:53,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 11:17:53,295 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:17:53,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:17:53,303 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:17:53,965 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:17:53,965 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:17:53,966 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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:17:53,971 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 11:17:54,017 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-11 11:17:54,017 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 11:17:54,020 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:17:54,025 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:54,026 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:54,026 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 11:17:54,026 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:54,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:54,031 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-11 11:17:54,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 11:17:54,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 11:17:54,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:54,081 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:54,092 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 11:17:54,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 11:17:54,093 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:54,094 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:54,101 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 11:17:54,101 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:45 [2018-04-11 11:17:54,187 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 9 treesize of output 7 [2018-04-11 11:17:54,188 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 11:17:54,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:54,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:54,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:54,194 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:40 [2018-04-11 11:17:54,231 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:54,231 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:54,232 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:54,232 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:54,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 42 [2018-04-11 11:17:54,233 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:54,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:54,245 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:59 [2018-04-11 11:17:54,317 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:54,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2018-04-11 11:17:54,321 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 11:17:54,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:54,325 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:54,340 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:54,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 52 [2018-04-11 11:17:54,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9 [2018-04-11 11:17:54,344 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:54,349 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:54,362 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 11:17:54,362 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:89, output treesize:90 [2018-04-11 11:17:54,525 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:54,526 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:54,527 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:54,527 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:54,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 67 [2018-04-11 11:17:54,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:54,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2018-04-11 11:17:54,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:54,560 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 11:17:54,560 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:147, output treesize:138 [2018-04-11 11:17:54,647 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:54,648 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:54,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 74 [2018-04-11 11:17:54,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 11:17:54,655 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:54,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:54,693 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:54,693 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:54,697 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:54,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 152 [2018-04-11 11:17:54,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-11 11:17:54,699 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:54,714 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:54,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:17:54,731 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:161, output treesize:154 [2018-04-11 11:17:54,895 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:54,897 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:54,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 345 treesize of output 271 [2018-04-11 11:17:54,906 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 36 treesize of output 35 [2018-04-11 11:17:54,906 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:54,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:54,943 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:54,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 285 treesize of output 299 [2018-04-11 11:17:54,952 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 36 treesize of output 35 [2018-04-11 11:17:54,952 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:54,965 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:54,983 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 11:17:54,983 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:358, output treesize:298 [2018-04-11 11:17:55,290 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:55,292 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:17:55,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 292 treesize of output 196 [2018-04-11 11:17:55,301 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 57 [2018-04-11 11:17:55,301 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 11:17:55,325 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 11:17:55,325 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:55,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 90 [2018-04-11 11:17:55,350 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 11:17:55,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 78 [2018-04-11 11:17:55,352 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:55,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 70 [2018-04-11 11:17:55,385 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:17:55,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 70 [2018-04-11 11:17:55,387 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:17:55,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-11 11:17:55,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 72 [2018-04-11 11:17:55,455 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 1 [2018-04-11 11:17:55,455 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:55,467 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 11:17:55,467 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:55,477 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 11:17:55,478 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:55,486 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 11:17:55,486 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:55,494 INFO L267 ElimStorePlain]: Start of recursive call 9: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:55,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 72 [2018-04-11 11:17:55,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 5 [2018-04-11 11:17:55,500 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:55,512 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 11:17:55,512 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:55,523 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 11:17:55,524 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:55,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 11:17:55,533 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-11 11:17:55,541 INFO L267 ElimStorePlain]: Start of recursive call 14: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:17:55,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 11:17:55,562 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 5 variables, input treesize:309, output treesize:37 [2018-04-11 11:17:55,712 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:17:55,730 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:17:55,730 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 28] total 55 [2018-04-11 11:17:55,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-04-11 11:17:55,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-04-11 11:17:55,731 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=2787, Unknown=0, NotChecked=0, Total=3080 [2018-04-11 11:17:55,731 INFO L87 Difference]: Start difference. First operand 475 states and 534 transitions. Second operand 56 states. [2018-04-11 11:17:57,388 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 128 DAG size of output 110 [2018-04-11 11:18:00,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:18:00,298 INFO L93 Difference]: Finished difference Result 685 states and 758 transitions. [2018-04-11 11:18:00,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-04-11 11:18:00,298 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 87 [2018-04-11 11:18:00,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:18:00,299 INFO L225 Difference]: With dead ends: 685 [2018-04-11 11:18:00,299 INFO L226 Difference]: Without dead ends: 685 [2018-04-11 11:18:00,300 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 60 SyntacticMatches, 6 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4333 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1753, Invalid=11819, Unknown=0, NotChecked=0, Total=13572 [2018-04-11 11:18:00,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2018-04-11 11:18:00,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 542. [2018-04-11 11:18:00,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2018-04-11 11:18:00,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 618 transitions. [2018-04-11 11:18:00,303 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 618 transitions. Word has length 87 [2018-04-11 11:18:00,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:18:00,303 INFO L459 AbstractCegarLoop]: Abstraction has 542 states and 618 transitions. [2018-04-11 11:18:00,303 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-04-11 11:18:00,303 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 618 transitions. [2018-04-11 11:18:00,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-04-11 11:18:00,304 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:18:00,304 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:18:00,304 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 11:18:00,304 INFO L82 PathProgramCache]: Analyzing trace with hash 2007721142, now seen corresponding path program 2 times [2018-04-11 11:18:00,305 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:18:00,305 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:18:00,305 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:18:00,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 11:18:00,305 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:18:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:18:00,313 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:18:00,899 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:18:00,899 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:18:00,899 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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:18:00,904 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 11:18:00,939 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 11:18:00,939 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 11:18:00,941 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:18:00,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 11:18:00,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:18:00,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:18:00,946 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:18:00,981 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:18:00,981 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:18:00,982 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 11:18:00,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:18:01,004 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 11:18:01,004 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:18:01,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:18:01,013 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-11 11:18:01,101 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 11:18:01,102 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 11:18:01,102 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:18:01,104 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:18:01,112 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 11:18:01,112 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:47 [2018-04-11 11:18:01,268 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:18:01,269 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:18:01,269 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:18:01,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-11 11:18:01,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:18:01,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 11:18:01,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:18:01,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:18:01,302 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:51 [2018-04-11 11:18:01,435 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:18:01,437 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:18:01,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 58 [2018-04-11 11:18:01,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-11 11:18:01,440 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:18:01,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:18:01,459 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 11:18:01,459 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:75 [2018-04-11 11:18:01,743 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:18:01,746 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:18:01,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 108 [2018-04-11 11:18:01,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 20 treesize of output 19 [2018-04-11 11:18:01,750 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:18:01,763 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:18:01,775 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 11:18:01,775 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:121, output treesize:107 [2018-04-11 11:18:02,058 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:18:02,059 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 49 treesize of output 40 [2018-04-11 11:18:02,059 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:18:02,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 11:18:02,072 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:138, output treesize:96 [2018-04-11 11:18:02,300 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:18:02,300 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:18:02,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 63 [2018-04-11 11:18:02,303 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 11:18:02,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:18:02,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 27 [2018-04-11 11:18:02,312 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 11:18:02,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-11 11:18:02,318 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:18:02,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2018-04-11 11:18:02,319 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:18:02,322 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:18:02,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-11 11:18:02,326 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:85, output treesize:13 [2018-04-11 11:18:02,397 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:18:02,414 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:18:02,414 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 30] total 54 [2018-04-11 11:18:02,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-04-11 11:18:02,414 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-04-11 11:18:02,415 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=2636, Unknown=0, NotChecked=0, Total=2862 [2018-04-11 11:18:02,415 INFO L87 Difference]: Start difference. First operand 542 states and 618 transitions. Second operand 54 states. [2018-04-11 11:18:04,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:18:04,588 INFO L93 Difference]: Finished difference Result 583 states and 659 transitions. [2018-04-11 11:18:04,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-11 11:18:04,588 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 87 [2018-04-11 11:18:04,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:18:04,589 INFO L225 Difference]: With dead ends: 583 [2018-04-11 11:18:04,589 INFO L226 Difference]: Without dead ends: 582 [2018-04-11 11:18:04,589 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2027 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=739, Invalid=6401, Unknown=0, NotChecked=0, Total=7140 [2018-04-11 11:18:04,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2018-04-11 11:18:04,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 556. [2018-04-11 11:18:04,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2018-04-11 11:18:04,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 632 transitions. [2018-04-11 11:18:04,592 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 632 transitions. Word has length 87 [2018-04-11 11:18:04,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:18:04,593 INFO L459 AbstractCegarLoop]: Abstraction has 556 states and 632 transitions. [2018-04-11 11:18:04,593 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-04-11 11:18:04,593 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 632 transitions. [2018-04-11 11:18:04,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-04-11 11:18:04,593 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:18:04,593 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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 11:18:04,593 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 11:18:04,593 INFO L82 PathProgramCache]: Analyzing trace with hash -370516659, now seen corresponding path program 6 times [2018-04-11 11:18:04,594 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:18:04,594 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:18:04,594 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:18:04,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 11:18:04,594 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:18:04,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:18:04,606 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:18:05,318 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:18:05,319 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:18:05,319 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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:18:05,323 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 11:18:05,409 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-04-11 11:18:05,410 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 11:18:05,412 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:18:05,418 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:18:05,418 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:18:05,419 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 11:18:05,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:18:05,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 11:18:05,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:18:05,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:18:05,433 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2018-04-11 11:18:05,484 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 11:18:05,485 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 11:18:05,485 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:18:05,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:18:05,496 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 11:18:05,496 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 11:18:05,497 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:18:05,498 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:18:05,505 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 11:18:05,505 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:55, output treesize:56 [2018-04-11 11:18:05,613 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:18:05,613 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 11:18:05,613 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:18:05,624 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:18:05,624 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:18:05,625 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:18:05,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-11 11:18:05,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:18:05,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:18:05,633 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:55 [2018-04-11 11:18:05,698 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:18:05,700 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:18:05,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 58 [2018-04-11 11:18:05,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 22 treesize of output 18 [2018-04-11 11:18:05,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:18:05,713 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:18:05,727 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:18:05,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2018-04-11 11:18:05,730 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 11:18:05,730 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:18:05,734 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:18:05,745 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 11:18:05,745 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:93, output treesize:77 [2018-04-11 11:18:05,866 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:18:05,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 67 [2018-04-11 11:18:05,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:18:05,883 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:18:05,883 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:18:05,884 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 15 treesize of output 8 [2018-04-11 11:18:05,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:18:05,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 11:18:05,895 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:117, output treesize:110 [2018-04-11 11:18:05,982 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:18:05,982 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:18:05,983 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:18:05,985 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:18:05,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 110 [2018-04-11 11:18:05,989 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 11:18:05,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:18:06,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:18:06,014 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:18:06,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 32 [2018-04-11 11:18:06,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 11:18:06,017 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:18:06,020 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:18:06,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:18:06,032 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:120, output treesize:103 [2018-04-11 11:18:06,175 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 42 treesize of output 51 [2018-04-11 11:18:06,175 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:18:06,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 11:18:06,187 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:128, output treesize:119 [2018-04-11 11:18:06,290 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:18:06,293 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:18:06,306 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 108 treesize of output 120 [2018-04-11 11:18:06,311 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:18:06,318 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 123 [2018-04-11 11:18:06,319 INFO L267 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 11:18:06,435 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 105 treesize of output 104 [2018-04-11 11:18:06,435 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:18:06,508 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:18:06,509 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 72 [2018-04-11 11:18:06,509 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:18:06,568 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 5 dim-0 vars, and 5 xjuncts. [2018-04-11 11:18:06,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 88 [2018-04-11 11:18:06,645 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 11:18:06,645 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:18:06,657 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:18:06,660 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:18:06,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 119 [2018-04-11 11:18:06,663 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:18:06,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-11 11:18:06,664 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 11:18:06,676 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:18:06,678 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:18:06,680 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 145 [2018-04-11 11:18:06,681 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:18:06,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-11 11:18:06,682 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 11:18:06,693 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:18:06,712 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 124 treesize of output 155 [2018-04-11 11:18:06,715 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 139 treesize of output 138 [2018-04-11 11:18:06,715 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 11:18:06,754 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:18:06,758 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:18:06,758 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 105 [2018-04-11 11:18:06,759 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:18:06,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-11 11:18:06,760 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 11:18:06,770 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:18:06,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 14 dim-0 vars, and 5 xjuncts. [2018-04-11 11:18:06,843 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:142, output treesize:544 [2018-04-11 11:18:19,598 WARN L151 SmtUtils]: Spent 12639ms on a formula simplification. DAG size of input: 155 DAG size of output 98 [2018-04-11 11:18:19,983 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 107 treesize of output 108 [2018-04-11 11:18:19,985 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 11:18:19,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:18:20,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:18:20,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 227 [2018-04-11 11:18:20,006 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 30 treesize of output 29 [2018-04-11 11:18:20,006 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:18:20,024 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:18:20,027 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 155 treesize of output 168 [2018-04-11 11:18:20,028 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 24 treesize of output 23 [2018-04-11 11:18:20,029 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:18:20,045 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:18:20,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2018-04-11 11:18:20,103 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:471, output treesize:501 [2018-04-11 11:18:20,320 WARN L148 SmtUtils]: Spent 111ms on a formula simplification that was a NOOP. DAG size: 117 [2018-04-11 11:18:20,331 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:18:20,339 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:18:20,364 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 6 new quantified variables, introduced 11 case distinctions, treesize of input 315 treesize of output 279 [2018-04-11 11:18:20,364 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-11 11:18:20,385 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:18:20,394 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 285 treesize of output 284 [2018-04-11 11:18:20,397 INFO L267 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 11:18:45,976 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:18:45,977 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 295 treesize of output 230 [2018-04-11 11:18:45,977 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:18:48,694 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:18:48,695 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 242 treesize of output 204 [2018-04-11 11:18:48,696 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:18:53,489 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 290 treesize of output 289 [2018-04-11 11:18:53,489 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:18:55,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 6 dim-1 vars, End of recursive call: 5 dim-0 vars, and 6 xjuncts. [2018-04-11 11:18:58,973 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:18:58,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 289 treesize of output 309 [2018-04-11 11:18:58,976 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:18:58,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-11 11:18:58,977 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 11:18:59,004 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:18:59,011 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:18:59,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 229 treesize of output 195 [2018-04-11 11:18:59,015 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:18:59,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-11 11:18:59,015 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 11:18:59,036 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:18:59,075 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 5 new quantified variables, introduced 11 case distinctions, treesize of input 289 treesize of output 250 [2018-04-11 11:18:59,082 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 217 treesize of output 192 [2018-04-11 11:18:59,082 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. Received shutdown request... [2018-04-11 11:18:59,170 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-11 11:18:59,170 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 11:18:59,173 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 11:18:59,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 11:18:59 BoogieIcfgContainer [2018-04-11 11:18:59,173 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 11:18:59,174 INFO L168 Benchmark]: Toolchain (without parser) took 188504.94 ms. Allocated memory was 401.1 MB in the beginning and 743.4 MB in the end (delta: 342.4 MB). Free memory was 333.2 MB in the beginning and 488.9 MB in the end (delta: -155.7 MB). Peak memory consumption was 331.9 MB. Max. memory is 5.3 GB. [2018-04-11 11:18:59,175 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 401.1 MB. Free memory is still 359.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 11:18:59,176 INFO L168 Benchmark]: CACSL2BoogieTranslator took 251.37 ms. Allocated memory is still 401.1 MB. Free memory was 333.2 MB in the beginning and 307.8 MB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 5.3 GB. [2018-04-11 11:18:59,176 INFO L168 Benchmark]: Boogie Preprocessor took 39.80 ms. Allocated memory is still 401.1 MB. Free memory was 307.8 MB in the beginning and 305.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-11 11:18:59,176 INFO L168 Benchmark]: RCFGBuilder took 416.58 ms. Allocated memory was 401.1 MB in the beginning and 584.1 MB in the end (delta: 183.0 MB). Free memory was 305.1 MB in the beginning and 511.0 MB in the end (delta: -205.9 MB). Peak memory consumption was 24.7 MB. Max. memory is 5.3 GB. [2018-04-11 11:18:59,176 INFO L168 Benchmark]: TraceAbstraction took 187794.42 ms. Allocated memory was 584.1 MB in the beginning and 743.4 MB in the end (delta: 159.4 MB). Free memory was 509.6 MB in the beginning and 488.9 MB in the end (delta: 20.8 MB). Peak memory consumption was 325.3 MB. Max. memory is 5.3 GB. [2018-04-11 11:18:59,177 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.14 ms. Allocated memory is still 401.1 MB. Free memory is still 359.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 251.37 ms. Allocated memory is still 401.1 MB. Free memory was 333.2 MB in the beginning and 307.8 MB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.80 ms. Allocated memory is still 401.1 MB. Free memory was 307.8 MB in the beginning and 305.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 416.58 ms. Allocated memory was 401.1 MB in the beginning and 584.1 MB in the end (delta: 183.0 MB). Free memory was 305.1 MB in the beginning and 511.0 MB in the end (delta: -205.9 MB). Peak memory consumption was 24.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 187794.42 ms. Allocated memory was 584.1 MB in the beginning and 743.4 MB in the end (delta: 159.4 MB). Free memory was 509.6 MB in the beginning and 488.9 MB in the end (delta: 20.8 MB). Peak memory consumption was 325.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 637]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 137. - TimeoutResultAtElement [Line: 646]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 137. - TimeoutResultAtElement [Line: 664]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 664). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 137. - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 137. - TimeoutResultAtElement [Line: 651]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 137. - TimeoutResultAtElement [Line: 655]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 137. - TimeoutResultAtElement [Line: 635]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 137. - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 137. - TimeoutResultAtElement [Line: 665]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 137. - TimeoutResultAtElement [Line: 664]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 664). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 137. - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 137. - TimeoutResultAtElement [Line: 669]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 669). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 137. - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 137. - TimeoutResultAtElement [Line: 650]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 137. - TimeoutResultAtElement [Line: 658]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 137. - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 137. - TimeoutResultAtElement [Line: 646]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 137. - TimeoutResultAtElement [Line: 639]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 137. - TimeoutResultAtElement [Line: 651]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 137. - TimeoutResultAtElement [Line: 655]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 137. - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 137. - TimeoutResultAtElement [Line: 635]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 137. - TimeoutResultAtElement [Line: 650]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 137. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 137. - TimeoutResultAtElement [Line: 669]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 669). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 137. - TimeoutResultAtElement [Line: 627]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 627). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 137. - TimeoutResultAtElement [Line: 665]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 137. - TimeoutResultAtElement [Line: 639]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 137. - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 137. - TimeoutResultAtElement [Line: 644]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 137. - TimeoutResultAtElement [Line: 658]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 137. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 137. - TimeoutResultAtElement [Line: 644]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 137. - TimeoutResultAtElement [Line: 666]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 137. - TimeoutResultAtElement [Line: 637]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 137. - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 137. - TimeoutResultAtElement [Line: 666]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 137. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 103 locations, 37 error locations. TIMEOUT Result, 187.7s OverallTime, 39 OverallIterations, 5 TraceHistogramMax, 85.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2562 SDtfs, 31283 SDslu, 41208 SDs, 0 SdLazy, 59031 SolverSat, 5256 SolverUnsat, 35 SolverUnknown, 0 SolverNotchecked, 29.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3739 GetRequests, 1435 SyntacticMatches, 94 SemanticMatches, 2210 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 48915 ImplicationChecksByTransitivity, 75.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=556occurred in iteration=38, 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, 38 MinimizatonAttempts, 3684 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 45.1s InterpolantComputationTime, 4115 NumberOfCodeBlocks, 4115 NumberOfCodeBlocksAsserted, 96 NumberOfCheckSat, 4047 ConstructedInterpolants, 592 QuantifiedInterpolants, 9600786 SizeOfPredicates, 642 NumberOfNonLiveVariables, 7817 ConjunctsInSsa, 1603 ConjunctsInUnsatCore, 68 InterpolantComputations, 8 PerfectInterpolantSequences, 172/1846 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/list-ext_flag_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_11-18-59-181.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list-ext_flag_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_11-18-59-181.csv Completed graceful shutdown