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/test-0513_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 11:19:33,750 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 11:19:33,752 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 11:19:33,765 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 11:19:33,766 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 11:19:33,766 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 11:19:33,767 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 11:19:33,769 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 11:19:33,770 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 11:19:33,771 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 11:19:33,772 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 11:19:33,772 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 11:19:33,773 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 11:19:33,774 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 11:19:33,774 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 11:19:33,776 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 11:19:33,777 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 11:19:33,779 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 11:19:33,780 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 11:19:33,781 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 11:19:33,782 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 11:19:33,783 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 11:19:33,783 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 11:19:33,784 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 11:19:33,784 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 11:19:33,785 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 11:19:33,785 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 11:19:33,786 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 11:19:33,786 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 11:19:33,786 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 11:19:33,787 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 11:19:33,787 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:19:33,807 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 11:19:33,808 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 11:19:33,808 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 11:19:33,809 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 11:19:33,809 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 11:19:33,809 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 11:19:33,809 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 11:19:33,809 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 11:19:33,809 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 11:19:33,810 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 11:19:33,810 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 11:19:33,810 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 11:19:33,810 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 11:19:33,810 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 11:19:33,810 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 11:19:33,810 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 11:19:33,811 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 11:19:33,811 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 11:19:33,811 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 11:19:33,811 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 11:19:33,811 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 11:19:33,811 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 11:19:33,811 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 11:19:33,812 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:19:33,841 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 11:19:33,851 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 11:19:33,855 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 11:19:33,856 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 11:19:33,856 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 11:19:33,857 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,148 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG82be9d7b4 [2018-04-11 11:19:34,300 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 11:19:34,300 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 11:19:34,300 INFO L168 CDTParser]: Scanning test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,306 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 11:19:34,307 INFO L215 ultiparseSymbolTable]: [2018-04-11 11:19:34,307 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 11:19:34,307 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,307 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 11:19:34,307 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____rlim_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,307 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__key_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,307 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_mutex_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,307 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__caddr_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,307 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__mode_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,308 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____fsfilcnt_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,308 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_mutexattr_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,308 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____u_short in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,308 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__u_int in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,308 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____suseconds_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,308 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____time_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,308 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__int8_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,308 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_rwlock_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,308 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__lldiv_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,308 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__uid_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,309 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____socklen_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,309 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____uint32_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,309 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__ino_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,309 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____mode_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,309 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____fsblkcnt_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,309 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__blksize_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,309 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__int16_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,309 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____fsfilcnt64_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,309 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__div_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,309 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____intptr_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,310 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__time_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,310 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_key_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,310 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__size_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,310 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__off_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,310 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____swblk_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,310 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__register_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,310 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_barrierattr_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,310 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____caddr_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,310 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__u_short in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,310 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__ldiv_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,311 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__ulong in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,311 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____int64_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,311 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__u_quad_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,311 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__gid_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,311 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pid_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,311 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__daddr_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,311 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__fd_set in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,311 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__u_int64_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,311 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_condattr_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,312 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____dev_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,312 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____rlim64_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,312 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____blksize_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,312 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____uint16_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,312 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____qaddr_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,312 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__clock_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,312 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____clock_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,312 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____int8_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,312 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____loff_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,312 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__fsid_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,313 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____blkcnt_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,313 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____sigset_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,313 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__fd_mask in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,313 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_spinlock_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,313 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____WAIT_STATUS in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,313 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__suseconds_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,313 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____daddr_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,313 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__int64_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,313 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____uint8_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,314 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____u_quad_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,314 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____key_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,314 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____ino_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,314 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____pid_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,314 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____ino64_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,314 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__u_long in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,314 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_barrier_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,314 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____quad_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,314 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__loff_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,314 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____fsid_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,315 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__ushort in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,315 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__uint in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,315 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__wchar_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,315 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____useconds_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,315 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__id_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,315 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____clockid_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,315 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____int16_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,315 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____u_long in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,315 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__dev_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,315 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_once_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,316 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____u_int in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,316 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__quad_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,316 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__blkcnt_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,316 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__u_char in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,316 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__u_int16_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,316 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_cond_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,316 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__u_int32_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,316 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____fsblkcnt64_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,316 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__timer_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,316 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____uint64_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,316 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____pthread_list_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,317 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__sigset_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,317 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____off64_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,317 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_attr_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,317 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____blkcnt64_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,317 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_rwlockattr_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,317 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__nlink_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,317 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____u_char in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,317 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____uid_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,317 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__ssize_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,317 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__int32_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,318 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__fsfilcnt_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,318 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____id_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,318 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____ssize_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,318 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____gid_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,318 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____off_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,318 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____sig_atomic_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,318 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____nlink_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,318 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____timer_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,318 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__clockid_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,319 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__fsblkcnt_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,319 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____fd_mask in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,319 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____int32_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,319 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,319 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__u_int8_t in test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:34,333 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG82be9d7b4 [2018-04-11 11:19:34,336 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 11:19:34,337 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 11:19:34,338 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 11:19:34,338 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 11:19:34,342 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 11:19:34,343 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 11:19:34" (1/1) ... [2018-04-11 11:19:34,344 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4efabe98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:19:34, skipping insertion in model container [2018-04-11 11:19:34,344 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 11:19:34" (1/1) ... [2018-04-11 11:19:34,356 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 11:19:34,380 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 11:19:34,518 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 11:19:34,555 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 11:19:34,561 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 113 non ball SCCs. Number of states in SCCs 113. [2018-04-11 11:19:34,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:19:34 WrapperNode [2018-04-11 11:19:34,597 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 11:19:34,598 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 11:19:34,598 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 11:19:34,598 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 11:19:34,609 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:19:34" (1/1) ... [2018-04-11 11:19:34,610 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:19:34" (1/1) ... [2018-04-11 11:19:34,623 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:19:34" (1/1) ... [2018-04-11 11:19:34,623 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:19:34" (1/1) ... [2018-04-11 11:19:34,634 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:19:34" (1/1) ... [2018-04-11 11:19:34,640 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:19:34" (1/1) ... [2018-04-11 11:19:34,642 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:19:34" (1/1) ... [2018-04-11 11:19:34,646 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 11:19:34,647 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 11:19:34,647 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 11:19:34,647 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 11:19:34,648 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:19:34" (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:19:34,735 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 11:19:34,735 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 11:19:34,735 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 11:19:34,735 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-11 11:19:34,735 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 11:19:34,735 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 11:19:34,735 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 11:19:34,735 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 11:19:34,735 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 11:19:34,735 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 11:19:34,735 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 11:19:34,735 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 11:19:34,736 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 11:19:34,736 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 11:19:34,736 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 11:19:34,736 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 11:19:34,736 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 11:19:34,736 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 11:19:34,736 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 11:19:34,736 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 11:19:34,736 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 11:19:34,736 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 11:19:34,736 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 11:19:34,736 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 11:19:34,737 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 11:19:34,737 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 11:19:34,737 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 11:19:34,737 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 11:19:34,737 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 11:19:34,737 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 11:19:34,737 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 11:19:34,737 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 11:19:34,737 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 11:19:34,737 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 11:19:34,737 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 11:19:34,738 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 11:19:34,738 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 11:19:34,738 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 11:19:34,738 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 11:19:34,738 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 11:19:34,738 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 11:19:34,738 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 11:19:34,738 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 11:19:34,738 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 11:19:34,738 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 11:19:34,739 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 11:19:34,739 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 11:19:34,739 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 11:19:34,739 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 11:19:34,739 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 11:19:34,739 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 11:19:34,739 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 11:19:34,739 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 11:19:34,739 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 11:19:34,740 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 11:19:34,740 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 11:19:34,740 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 11:19:34,740 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 11:19:34,740 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 11:19:34,740 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 11:19:34,740 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 11:19:34,740 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 11:19:34,740 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 11:19:34,740 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 11:19:34,741 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 11:19:34,741 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 11:19:34,741 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 11:19:34,741 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 11:19:34,741 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-11 11:19:34,741 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 11:19:34,741 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 11:19:34,741 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 11:19:34,741 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 11:19:34,741 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 11:19:34,741 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 11:19:34,742 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 11:19:34,742 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 11:19:34,742 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 11:19:34,742 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 11:19:34,742 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 11:19:34,742 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 11:19:34,742 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 11:19:34,742 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 11:19:34,742 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 11:19:34,742 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 11:19:34,742 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 11:19:34,742 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 11:19:34,742 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 11:19:34,742 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 11:19:34,742 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 11:19:34,742 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 11:19:34,742 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 11:19:34,742 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 11:19:34,743 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 11:19:34,743 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 11:19:34,743 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 11:19:34,743 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 11:19:34,743 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 11:19:34,743 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 11:19:34,743 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 11:19:34,743 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 11:19:34,743 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 11:19:34,743 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 11:19:34,743 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 11:19:34,743 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 11:19:34,743 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 11:19:34,744 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 11:19:34,744 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 11:19:34,744 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-11 11:19:34,744 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 11:19:34,744 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-11 11:19:34,744 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 11:19:34,744 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 11:19:34,744 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 11:19:34,744 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 11:19:34,744 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 11:19:35,193 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 11:19:35,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 11:19:35 BoogieIcfgContainer [2018-04-11 11:19:35,194 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 11:19:35,194 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 11:19:35,194 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 11:19:35,196 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 11:19:35,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 11:19:34" (1/3) ... [2018-04-11 11:19:35,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77095abb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 11:19:35, skipping insertion in model container [2018-04-11 11:19:35,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:19:34" (2/3) ... [2018-04-11 11:19:35,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77095abb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 11:19:35, skipping insertion in model container [2018-04-11 11:19:35,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 11:19:35" (3/3) ... [2018-04-11 11:19:35,199 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0513_1_true-valid-memsafety.i [2018-04-11 11:19:35,205 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 11:19:35,211 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 67 error locations. [2018-04-11 11:19:35,235 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 11:19:35,235 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 11:19:35,235 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 11:19:35,236 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 11:19:35,236 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 11:19:35,236 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 11:19:35,236 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 11:19:35,236 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 11:19:35,236 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 11:19:35,236 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 11:19:35,247 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states. [2018-04-11 11:19:35,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-04-11 11:19:35,253 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:19:35,254 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:19:35,254 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 11:19:35,257 INFO L82 PathProgramCache]: Analyzing trace with hash -193452547, now seen corresponding path program 1 times [2018-04-11 11:19:35,257 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:19:35,258 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:19:35,288 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:19:35,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:19:35,288 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:19:35,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:19:35,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:19:35,331 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:19:35,333 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:19:35,333 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 11:19:35,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-04-11 11:19:35,341 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-04-11 11:19:35,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-11 11:19:35,343 INFO L87 Difference]: Start difference. First operand 161 states. Second operand 2 states. [2018-04-11 11:19:35,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:19:35,364 INFO L93 Difference]: Finished difference Result 161 states and 175 transitions. [2018-04-11 11:19:35,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-04-11 11:19:35,365 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-04-11 11:19:35,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:19:35,374 INFO L225 Difference]: With dead ends: 161 [2018-04-11 11:19:35,374 INFO L226 Difference]: Without dead ends: 158 [2018-04-11 11:19:35,376 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:19:35,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-04-11 11:19:35,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-04-11 11:19:35,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-11 11:19:35,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 172 transitions. [2018-04-11 11:19:35,408 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 172 transitions. Word has length 9 [2018-04-11 11:19:35,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:19:35,408 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 172 transitions. [2018-04-11 11:19:35,408 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-04-11 11:19:35,408 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 172 transitions. [2018-04-11 11:19:35,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-11 11:19:35,408 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:19:35,408 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:19:35,409 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 11:19:35,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1642474228, now seen corresponding path program 1 times [2018-04-11 11:19:35,409 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:19:35,409 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:19:35,410 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:19:35,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:19:35,410 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:19:35,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:19:35,421 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:19:35,443 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:19:35,443 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:19:35,443 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 11:19:35,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 11:19:35,445 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 11:19:35,445 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 11:19:35,446 INFO L87 Difference]: Start difference. First operand 158 states and 172 transitions. Second operand 3 states. [2018-04-11 11:19:35,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:19:35,575 INFO L93 Difference]: Finished difference Result 206 states and 223 transitions. [2018-04-11 11:19:35,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 11:19:35,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-04-11 11:19:35,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:19:35,579 INFO L225 Difference]: With dead ends: 206 [2018-04-11 11:19:35,579 INFO L226 Difference]: Without dead ends: 205 [2018-04-11 11:19:35,580 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 11:19:35,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-04-11 11:19:35,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 163. [2018-04-11 11:19:35,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-04-11 11:19:35,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 179 transitions. [2018-04-11 11:19:35,589 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 179 transitions. Word has length 12 [2018-04-11 11:19:35,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:19:35,590 INFO L459 AbstractCegarLoop]: Abstraction has 163 states and 179 transitions. [2018-04-11 11:19:35,590 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 11:19:35,590 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 179 transitions. [2018-04-11 11:19:35,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-11 11:19:35,590 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:19:35,590 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:19:35,591 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 11:19:35,591 INFO L82 PathProgramCache]: Analyzing trace with hash 622902551, now seen corresponding path program 1 times [2018-04-11 11:19:35,591 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:19:35,591 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:19:35,592 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:19:35,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:19:35,592 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:19:35,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:19:35,600 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:19:35,627 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:19:35,627 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:19:35,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 11:19:35,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 11:19:35,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 11:19:35,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 11:19:35,628 INFO L87 Difference]: Start difference. First operand 163 states and 179 transitions. Second operand 3 states. [2018-04-11 11:19:35,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:19:35,678 INFO L93 Difference]: Finished difference Result 186 states and 203 transitions. [2018-04-11 11:19:35,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 11:19:35,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-04-11 11:19:35,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:19:35,679 INFO L225 Difference]: With dead ends: 186 [2018-04-11 11:19:35,680 INFO L226 Difference]: Without dead ends: 185 [2018-04-11 11:19:35,680 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 11:19:35,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-04-11 11:19:35,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 175. [2018-04-11 11:19:35,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-04-11 11:19:35,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 201 transitions. [2018-04-11 11:19:35,688 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 201 transitions. Word has length 13 [2018-04-11 11:19:35,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:19:35,688 INFO L459 AbstractCegarLoop]: Abstraction has 175 states and 201 transitions. [2018-04-11 11:19:35,688 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 11:19:35,688 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 201 transitions. [2018-04-11 11:19:35,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-11 11:19:35,689 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:19:35,689 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:19:35,689 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 11:19:35,689 INFO L82 PathProgramCache]: Analyzing trace with hash 2129799244, now seen corresponding path program 1 times [2018-04-11 11:19:35,689 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:19:35,689 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:19:35,690 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:19:35,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:19:35,690 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:19:35,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:19:35,703 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:19:35,727 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:19:35,728 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:19:35,728 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 11:19:35,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 11:19:35,728 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 11:19:35,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 11:19:35,728 INFO L87 Difference]: Start difference. First operand 175 states and 201 transitions. Second operand 4 states. [2018-04-11 11:19:35,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:19:35,901 INFO L93 Difference]: Finished difference Result 249 states and 275 transitions. [2018-04-11 11:19:35,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 11:19:35,902 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-04-11 11:19:35,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:19:35,903 INFO L225 Difference]: With dead ends: 249 [2018-04-11 11:19:35,903 INFO L226 Difference]: Without dead ends: 249 [2018-04-11 11:19:35,903 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 11:19:35,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-04-11 11:19:35,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 175. [2018-04-11 11:19:35,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-04-11 11:19:35,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 201 transitions. [2018-04-11 11:19:35,910 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 201 transitions. Word has length 14 [2018-04-11 11:19:35,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:19:35,911 INFO L459 AbstractCegarLoop]: Abstraction has 175 states and 201 transitions. [2018-04-11 11:19:35,911 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 11:19:35,911 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 201 transitions. [2018-04-11 11:19:35,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-11 11:19:35,911 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:19:35,911 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:19:35,911 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 11:19:35,912 INFO L82 PathProgramCache]: Analyzing trace with hash 2129799245, now seen corresponding path program 1 times [2018-04-11 11:19:35,912 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:19:35,912 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:19:35,913 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:19:35,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:19:35,913 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:19:35,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:19:35,924 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:19:35,978 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:19:35,978 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:19:35,978 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 11:19:35,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 11:19:35,978 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 11:19:35,979 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 11:19:35,979 INFO L87 Difference]: Start difference. First operand 175 states and 201 transitions. Second operand 4 states. [2018-04-11 11:19:36,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:19:36,085 INFO L93 Difference]: Finished difference Result 171 states and 193 transitions. [2018-04-11 11:19:36,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 11:19:36,086 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-04-11 11:19:36,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:19:36,087 INFO L225 Difference]: With dead ends: 171 [2018-04-11 11:19:36,087 INFO L226 Difference]: Without dead ends: 171 [2018-04-11 11:19:36,087 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 11:19:36,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-04-11 11:19:36,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-04-11 11:19:36,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-04-11 11:19:36,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 193 transitions. [2018-04-11 11:19:36,092 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 193 transitions. Word has length 14 [2018-04-11 11:19:36,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:19:36,092 INFO L459 AbstractCegarLoop]: Abstraction has 171 states and 193 transitions. [2018-04-11 11:19:36,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 11:19:36,092 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 193 transitions. [2018-04-11 11:19:36,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-11 11:19:36,093 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:19:36,093 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:19:36,093 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 11:19:36,093 INFO L82 PathProgramCache]: Analyzing trace with hash -128321881, now seen corresponding path program 1 times [2018-04-11 11:19:36,093 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:19:36,093 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:19:36,093 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:19:36,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:19:36,094 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:19:36,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:19:36,103 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:19:36,131 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:19:36,131 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:19:36,131 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 11:19:36,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 11:19:36,132 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 11:19:36,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 11:19:36,132 INFO L87 Difference]: Start difference. First operand 171 states and 193 transitions. Second operand 5 states. [2018-04-11 11:19:36,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:19:36,160 INFO L93 Difference]: Finished difference Result 318 states and 355 transitions. [2018-04-11 11:19:36,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 11:19:36,163 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-04-11 11:19:36,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:19:36,164 INFO L225 Difference]: With dead ends: 318 [2018-04-11 11:19:36,164 INFO L226 Difference]: Without dead ends: 318 [2018-04-11 11:19:36,165 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-04-11 11:19:36,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-04-11 11:19:36,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 171. [2018-04-11 11:19:36,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-04-11 11:19:36,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 191 transitions. [2018-04-11 11:19:36,170 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 191 transitions. Word has length 21 [2018-04-11 11:19:36,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:19:36,170 INFO L459 AbstractCegarLoop]: Abstraction has 171 states and 191 transitions. [2018-04-11 11:19:36,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 11:19:36,170 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 191 transitions. [2018-04-11 11:19:36,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-11 11:19:36,171 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:19:36,171 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:19:36,171 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 11:19:36,171 INFO L82 PathProgramCache]: Analyzing trace with hash 168257912, now seen corresponding path program 1 times [2018-04-11 11:19:36,171 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:19:36,172 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:19:36,172 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:19:36,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:19:36,172 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:19:36,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:19:36,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:19:36,206 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:19:36,207 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:19:36,207 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 11:19:36,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 11:19:36,207 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 11:19:36,207 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 11:19:36,208 INFO L87 Difference]: Start difference. First operand 171 states and 191 transitions. Second operand 4 states. [2018-04-11 11:19:36,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:19:36,320 INFO L93 Difference]: Finished difference Result 209 states and 229 transitions. [2018-04-11 11:19:36,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 11:19:36,321 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-04-11 11:19:36,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:19:36,321 INFO L225 Difference]: With dead ends: 209 [2018-04-11 11:19:36,321 INFO L226 Difference]: Without dead ends: 209 [2018-04-11 11:19:36,322 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 11:19:36,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-04-11 11:19:36,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 167. [2018-04-11 11:19:36,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-04-11 11:19:36,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 187 transitions. [2018-04-11 11:19:36,324 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 187 transitions. Word has length 22 [2018-04-11 11:19:36,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:19:36,324 INFO L459 AbstractCegarLoop]: Abstraction has 167 states and 187 transitions. [2018-04-11 11:19:36,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 11:19:36,324 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 187 transitions. [2018-04-11 11:19:36,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-11 11:19:36,325 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:19:36,325 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:19:36,325 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 11:19:36,325 INFO L82 PathProgramCache]: Analyzing trace with hash 168257913, now seen corresponding path program 1 times [2018-04-11 11:19:36,325 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:19:36,325 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:19:36,326 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:19:36,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:19:36,326 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:19:36,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:19:36,332 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:19:36,378 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:19:36,379 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:19:36,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 11:19:36,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 11:19:36,379 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 11:19:36,379 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 11:19:36,379 INFO L87 Difference]: Start difference. First operand 167 states and 187 transitions. Second operand 4 states. [2018-04-11 11:19:36,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:19:36,461 INFO L93 Difference]: Finished difference Result 164 states and 184 transitions. [2018-04-11 11:19:36,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 11:19:36,461 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-04-11 11:19:36,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:19:36,462 INFO L225 Difference]: With dead ends: 164 [2018-04-11 11:19:36,462 INFO L226 Difference]: Without dead ends: 164 [2018-04-11 11:19:36,462 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 11:19:36,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-04-11 11:19:36,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-04-11 11:19:36,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-04-11 11:19:36,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 184 transitions. [2018-04-11 11:19:36,466 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 184 transitions. Word has length 22 [2018-04-11 11:19:36,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:19:36,466 INFO L459 AbstractCegarLoop]: Abstraction has 164 states and 184 transitions. [2018-04-11 11:19:36,466 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 11:19:36,466 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 184 transitions. [2018-04-11 11:19:36,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 11:19:36,466 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:19:36,467 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] [2018-04-11 11:19:36,467 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 11:19:36,467 INFO L82 PathProgramCache]: Analyzing trace with hash -806193688, now seen corresponding path program 1 times [2018-04-11 11:19:36,467 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:19:36,467 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:19:36,468 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:19:36,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:19:36,468 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:19:36,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:19:36,479 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:19:36,517 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:19:36,517 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:19:36,517 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 11:19:36,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 11:19:36,518 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 11:19:36,518 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 11:19:36,518 INFO L87 Difference]: Start difference. First operand 164 states and 184 transitions. Second operand 5 states. [2018-04-11 11:19:36,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:19:36,619 INFO L93 Difference]: Finished difference Result 274 states and 304 transitions. [2018-04-11 11:19:36,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 11:19:36,619 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-04-11 11:19:36,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:19:36,620 INFO L225 Difference]: With dead ends: 274 [2018-04-11 11:19:36,620 INFO L226 Difference]: Without dead ends: 274 [2018-04-11 11:19:36,621 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-11 11:19:36,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-04-11 11:19:36,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 164. [2018-04-11 11:19:36,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-04-11 11:19:36,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 182 transitions. [2018-04-11 11:19:36,625 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 182 transitions. Word has length 31 [2018-04-11 11:19:36,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:19:36,625 INFO L459 AbstractCegarLoop]: Abstraction has 164 states and 182 transitions. [2018-04-11 11:19:36,625 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 11:19:36,625 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 182 transitions. [2018-04-11 11:19:36,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 11:19:36,626 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:19:36,626 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] [2018-04-11 11:19:36,626 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 11:19:36,626 INFO L82 PathProgramCache]: Analyzing trace with hash 777795515, now seen corresponding path program 1 times [2018-04-11 11:19:36,626 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:19:36,626 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:19:36,627 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:19:36,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:19:36,627 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:19:36,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:19:36,637 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:19:36,663 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:19:36,663 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:19:36,663 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 11:19:36,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 11:19:36,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 11:19:36,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 11:19:36,664 INFO L87 Difference]: Start difference. First operand 164 states and 182 transitions. Second operand 5 states. [2018-04-11 11:19:36,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:19:36,800 INFO L93 Difference]: Finished difference Result 161 states and 179 transitions. [2018-04-11 11:19:36,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 11:19:36,801 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-04-11 11:19:36,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:19:36,801 INFO L225 Difference]: With dead ends: 161 [2018-04-11 11:19:36,802 INFO L226 Difference]: Without dead ends: 161 [2018-04-11 11:19:36,802 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-04-11 11:19:36,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-04-11 11:19:36,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 158. [2018-04-11 11:19:36,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-11 11:19:36,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 177 transitions. [2018-04-11 11:19:36,805 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 177 transitions. Word has length 32 [2018-04-11 11:19:36,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:19:36,806 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 177 transitions. [2018-04-11 11:19:36,806 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 11:19:36,806 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 177 transitions. [2018-04-11 11:19:36,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 11:19:36,806 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:19:36,806 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] [2018-04-11 11:19:36,807 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 11:19:36,807 INFO L82 PathProgramCache]: Analyzing trace with hash 777795516, now seen corresponding path program 1 times [2018-04-11 11:19:36,807 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:19:36,807 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:19:36,808 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:19:36,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:19:36,808 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:19:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:19:36,818 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:19:36,877 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:19:36,877 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:19:36,877 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 11:19:36,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 11:19:36,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 11:19:36,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 11:19:36,878 INFO L87 Difference]: Start difference. First operand 158 states and 177 transitions. Second operand 5 states. [2018-04-11 11:19:37,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:19:37,039 INFO L93 Difference]: Finished difference Result 250 states and 279 transitions. [2018-04-11 11:19:37,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 11:19:37,039 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-04-11 11:19:37,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:19:37,040 INFO L225 Difference]: With dead ends: 250 [2018-04-11 11:19:37,040 INFO L226 Difference]: Without dead ends: 250 [2018-04-11 11:19:37,041 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-11 11:19:37,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-04-11 11:19:37,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 200. [2018-04-11 11:19:37,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-04-11 11:19:37,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 250 transitions. [2018-04-11 11:19:37,045 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 250 transitions. Word has length 32 [2018-04-11 11:19:37,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:19:37,045 INFO L459 AbstractCegarLoop]: Abstraction has 200 states and 250 transitions. [2018-04-11 11:19:37,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 11:19:37,045 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 250 transitions. [2018-04-11 11:19:37,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-11 11:19:37,046 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:19:37,046 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] [2018-04-11 11:19:37,046 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 11:19:37,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1997543628, now seen corresponding path program 1 times [2018-04-11 11:19:37,046 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:19:37,047 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:19:37,047 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:19:37,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:19:37,047 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:19:37,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:19:37,057 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:19:37,076 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:19:37,076 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:19:37,076 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 11:19:37,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 11:19:37,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 11:19:37,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-11 11:19:37,077 INFO L87 Difference]: Start difference. First operand 200 states and 250 transitions. Second operand 4 states. [2018-04-11 11:19:37,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:19:37,098 INFO L93 Difference]: Finished difference Result 369 states and 462 transitions. [2018-04-11 11:19:37,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 11:19:37,098 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-04-11 11:19:37,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:19:37,100 INFO L225 Difference]: With dead ends: 369 [2018-04-11 11:19:37,100 INFO L226 Difference]: Without dead ends: 369 [2018-04-11 11:19:37,100 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-11 11:19:37,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-04-11 11:19:37,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 201. [2018-04-11 11:19:37,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-04-11 11:19:37,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 249 transitions. [2018-04-11 11:19:37,105 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 249 transitions. Word has length 37 [2018-04-11 11:19:37,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:19:37,105 INFO L459 AbstractCegarLoop]: Abstraction has 201 states and 249 transitions. [2018-04-11 11:19:37,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 11:19:37,105 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 249 transitions. [2018-04-11 11:19:37,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 11:19:37,106 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:19:37,106 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] [2018-04-11 11:19:37,106 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 11:19:37,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1955674309, now seen corresponding path program 1 times [2018-04-11 11:19:37,106 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:19:37,106 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:19:37,107 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:19:37,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:19:37,107 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:19:37,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:19:37,120 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:19:37,198 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:19:37,198 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:19:37,198 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 11:19:37,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 11:19:37,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 11:19:37,199 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 11:19:37,199 INFO L87 Difference]: Start difference. First operand 201 states and 249 transitions. Second operand 6 states. [2018-04-11 11:19:37,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:19:37,303 INFO L93 Difference]: Finished difference Result 244 states and 296 transitions. [2018-04-11 11:19:37,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 11:19:37,304 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-04-11 11:19:37,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:19:37,305 INFO L225 Difference]: With dead ends: 244 [2018-04-11 11:19:37,305 INFO L226 Difference]: Without dead ends: 244 [2018-04-11 11:19:37,305 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-11 11:19:37,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-04-11 11:19:37,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 211. [2018-04-11 11:19:37,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-04-11 11:19:37,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 261 transitions. [2018-04-11 11:19:37,309 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 261 transitions. Word has length 39 [2018-04-11 11:19:37,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:19:37,309 INFO L459 AbstractCegarLoop]: Abstraction has 211 states and 261 transitions. [2018-04-11 11:19:37,309 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 11:19:37,309 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 261 transitions. [2018-04-11 11:19:37,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 11:19:37,310 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:19:37,310 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] [2018-04-11 11:19:37,310 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 11:19:37,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1503063523, now seen corresponding path program 1 times [2018-04-11 11:19:37,311 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:19:37,311 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:19:37,311 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:19:37,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:19:37,311 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:19:37,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:19:37,324 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:19:37,544 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:19:37,544 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:19:37,544 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-11 11:19:37,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 11:19:37,544 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 11:19:37,544 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-04-11 11:19:37,544 INFO L87 Difference]: Start difference. First operand 211 states and 261 transitions. Second operand 12 states. [2018-04-11 11:19:38,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:19:38,092 INFO L93 Difference]: Finished difference Result 287 states and 341 transitions. [2018-04-11 11:19:38,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 11:19:38,092 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 43 [2018-04-11 11:19:38,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:19:38,093 INFO L225 Difference]: With dead ends: 287 [2018-04-11 11:19:38,093 INFO L226 Difference]: Without dead ends: 287 [2018-04-11 11:19:38,094 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=176, Invalid=526, Unknown=0, NotChecked=0, Total=702 [2018-04-11 11:19:38,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-04-11 11:19:38,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 216. [2018-04-11 11:19:38,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-04-11 11:19:38,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 268 transitions. [2018-04-11 11:19:38,098 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 268 transitions. Word has length 43 [2018-04-11 11:19:38,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:19:38,098 INFO L459 AbstractCegarLoop]: Abstraction has 216 states and 268 transitions. [2018-04-11 11:19:38,098 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 11:19:38,098 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 268 transitions. [2018-04-11 11:19:38,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 11:19:38,099 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:19:38,099 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] [2018-04-11 11:19:38,099 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 11:19:38,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1503063522, now seen corresponding path program 1 times [2018-04-11 11:19:38,099 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:19:38,099 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:19:38,100 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:19:38,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:19:38,100 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:19:38,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:19:38,112 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:19:38,346 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:19:38,346 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:19:38,347 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-11 11:19:38,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 11:19:38,347 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 11:19:38,347 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-04-11 11:19:38,347 INFO L87 Difference]: Start difference. First operand 216 states and 268 transitions. Second operand 12 states. [2018-04-11 11:19:38,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:19:38,889 INFO L93 Difference]: Finished difference Result 276 states and 327 transitions. [2018-04-11 11:19:38,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 11:19:38,889 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 43 [2018-04-11 11:19:38,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:19:38,890 INFO L225 Difference]: With dead ends: 276 [2018-04-11 11:19:38,890 INFO L226 Difference]: Without dead ends: 276 [2018-04-11 11:19:38,891 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=189, Invalid=461, Unknown=0, NotChecked=0, Total=650 [2018-04-11 11:19:38,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-04-11 11:19:38,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 216. [2018-04-11 11:19:38,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-04-11 11:19:38,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 267 transitions. [2018-04-11 11:19:38,895 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 267 transitions. Word has length 43 [2018-04-11 11:19:38,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:19:38,895 INFO L459 AbstractCegarLoop]: Abstraction has 216 states and 267 transitions. [2018-04-11 11:19:38,896 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 11:19:38,896 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 267 transitions. [2018-04-11 11:19:38,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-11 11:19:38,896 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:19:38,896 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] [2018-04-11 11:19:38,896 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 11:19:38,896 INFO L82 PathProgramCache]: Analyzing trace with hash 649670337, now seen corresponding path program 1 times [2018-04-11 11:19:38,896 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:19:38,897 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:19:38,897 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:19:38,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:19:38,897 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:19:38,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:19:38,905 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:19:39,012 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:19:39,012 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:19:39,012 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-11 11:19:39,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 11:19:39,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 11:19:39,013 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-04-11 11:19:39,013 INFO L87 Difference]: Start difference. First operand 216 states and 267 transitions. Second operand 10 states. [2018-04-11 11:19:39,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:19:39,236 INFO L93 Difference]: Finished difference Result 253 states and 306 transitions. [2018-04-11 11:19:39,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 11:19:39,237 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2018-04-11 11:19:39,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:19:39,237 INFO L225 Difference]: With dead ends: 253 [2018-04-11 11:19:39,237 INFO L226 Difference]: Without dead ends: 253 [2018-04-11 11:19:39,238 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2018-04-11 11:19:39,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-04-11 11:19:39,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 223. [2018-04-11 11:19:39,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-04-11 11:19:39,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 274 transitions. [2018-04-11 11:19:39,241 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 274 transitions. Word has length 44 [2018-04-11 11:19:39,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:19:39,242 INFO L459 AbstractCegarLoop]: Abstraction has 223 states and 274 transitions. [2018-04-11 11:19:39,242 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 11:19:39,242 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 274 transitions. [2018-04-11 11:19:39,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-11 11:19:39,242 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:19:39,242 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:19:39,242 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 11:19:39,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1335027938, now seen corresponding path program 1 times [2018-04-11 11:19:39,243 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:19:39,243 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:19:39,244 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:19:39,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:19:39,244 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:19:39,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:19:39,254 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:19:39,287 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-11 11:19:39,288 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:19:39,288 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 11:19:39,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 11:19:39,288 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 11:19:39,288 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 11:19:39,289 INFO L87 Difference]: Start difference. First operand 223 states and 274 transitions. Second operand 4 states. [2018-04-11 11:19:39,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:19:39,406 INFO L93 Difference]: Finished difference Result 281 states and 344 transitions. [2018-04-11 11:19:39,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 11:19:39,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-04-11 11:19:39,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:19:39,407 INFO L225 Difference]: With dead ends: 281 [2018-04-11 11:19:39,407 INFO L226 Difference]: Without dead ends: 281 [2018-04-11 11:19:39,408 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 11:19:39,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-04-11 11:19:39,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 227. [2018-04-11 11:19:39,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-04-11 11:19:39,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 285 transitions. [2018-04-11 11:19:39,412 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 285 transitions. Word has length 45 [2018-04-11 11:19:39,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:19:39,412 INFO L459 AbstractCegarLoop]: Abstraction has 227 states and 285 transitions. [2018-04-11 11:19:39,412 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 11:19:39,412 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 285 transitions. [2018-04-11 11:19:39,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-11 11:19:39,413 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:19:39,413 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:19:39,413 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 11:19:39,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1335027937, now seen corresponding path program 1 times [2018-04-11 11:19:39,413 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:19:39,413 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:19:39,414 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:19:39,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:19:39,414 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:19:39,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:19:39,426 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:19:39,794 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:19:39,794 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:19:39,794 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-04-11 11:19:39,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 11:19:39,794 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 11:19:39,795 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-04-11 11:19:39,795 INFO L87 Difference]: Start difference. First operand 227 states and 285 transitions. Second operand 14 states. [2018-04-11 11:19:40,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:19:40,486 INFO L93 Difference]: Finished difference Result 296 states and 353 transitions. [2018-04-11 11:19:40,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 11:19:40,486 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 45 [2018-04-11 11:19:40,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:19:40,487 INFO L225 Difference]: With dead ends: 296 [2018-04-11 11:19:40,487 INFO L226 Difference]: Without dead ends: 296 [2018-04-11 11:19:40,487 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=202, Invalid=668, Unknown=0, NotChecked=0, Total=870 [2018-04-11 11:19:40,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-04-11 11:19:40,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 232. [2018-04-11 11:19:40,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-04-11 11:19:40,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 291 transitions. [2018-04-11 11:19:40,491 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 291 transitions. Word has length 45 [2018-04-11 11:19:40,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:19:40,492 INFO L459 AbstractCegarLoop]: Abstraction has 232 states and 291 transitions. [2018-04-11 11:19:40,492 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 11:19:40,492 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 291 transitions. [2018-04-11 11:19:40,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 11:19:40,492 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:19:40,492 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:19:40,493 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 11:19:40,493 INFO L82 PathProgramCache]: Analyzing trace with hash -133333753, now seen corresponding path program 1 times [2018-04-11 11:19:40,493 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:19:40,493 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:19:40,494 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:19:40,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:19:40,494 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:19:40,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:19:40,502 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:19:40,521 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-11 11:19:40,521 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:19:40,521 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 11:19:40,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 11:19:40,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 11:19:40,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 11:19:40,522 INFO L87 Difference]: Start difference. First operand 232 states and 291 transitions. Second operand 3 states. [2018-04-11 11:19:40,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:19:40,527 INFO L93 Difference]: Finished difference Result 233 states and 292 transitions. [2018-04-11 11:19:40,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 11:19:40,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-04-11 11:19:40,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:19:40,528 INFO L225 Difference]: With dead ends: 233 [2018-04-11 11:19:40,528 INFO L226 Difference]: Without dead ends: 233 [2018-04-11 11:19:40,528 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 11:19:40,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-04-11 11:19:40,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2018-04-11 11:19:40,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-04-11 11:19:40,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 292 transitions. [2018-04-11 11:19:40,532 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 292 transitions. Word has length 49 [2018-04-11 11:19:40,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:19:40,532 INFO L459 AbstractCegarLoop]: Abstraction has 233 states and 292 transitions. [2018-04-11 11:19:40,532 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 11:19:40,532 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 292 transitions. [2018-04-11 11:19:40,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-11 11:19:40,533 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:19:40,533 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:19:40,533 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 11:19:40,533 INFO L82 PathProgramCache]: Analyzing trace with hash 709473988, now seen corresponding path program 1 times [2018-04-11 11:19:40,533 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:19:40,533 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:19:40,534 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:19:40,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:19:40,534 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:19:40,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:19:40,545 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:19:40,713 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:19:40,713 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:19:40,713 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-11 11:19:40,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 11:19:40,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 11:19:40,714 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-04-11 11:19:40,714 INFO L87 Difference]: Start difference. First operand 233 states and 292 transitions. Second operand 12 states. [2018-04-11 11:19:40,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:19:40,976 INFO L93 Difference]: Finished difference Result 334 states and 393 transitions. [2018-04-11 11:19:40,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 11:19:40,977 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2018-04-11 11:19:40,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:19:40,977 INFO L225 Difference]: With dead ends: 334 [2018-04-11 11:19:40,977 INFO L226 Difference]: Without dead ends: 334 [2018-04-11 11:19:40,978 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=209, Invalid=603, Unknown=0, NotChecked=0, Total=812 [2018-04-11 11:19:40,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-04-11 11:19:40,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 236. [2018-04-11 11:19:40,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-04-11 11:19:40,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 296 transitions. [2018-04-11 11:19:40,980 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 296 transitions. Word has length 51 [2018-04-11 11:19:40,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:19:40,981 INFO L459 AbstractCegarLoop]: Abstraction has 236 states and 296 transitions. [2018-04-11 11:19:40,981 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 11:19:40,981 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 296 transitions. [2018-04-11 11:19:40,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-11 11:19:40,981 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:19:40,981 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] [2018-04-11 11:19:40,981 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 11:19:40,981 INFO L82 PathProgramCache]: Analyzing trace with hash 715470918, now seen corresponding path program 1 times [2018-04-11 11:19:40,981 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:19:40,981 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:19:40,982 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:19:40,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:19:40,982 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:19:40,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:19:40,990 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:19:41,255 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:19:41,255 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:19:41,255 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:19:41,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:19:41,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:19:41,299 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:19:41,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2018-04-11 11:19:41,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 14 treesize of output 13 [2018-04-11 11:19:41,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:19:41,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:19:41,418 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:19:41,418 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-04-11 11:19:41,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 11:19:41,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:19:41,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:19:41,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:19:41,539 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:19:41,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:19:41,541 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:19:41,542 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:19:41,550 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:19:41,550 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:47, output treesize:36 [2018-04-11 11:19:41,621 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 27 treesize of output 23 [2018-04-11 11:19:41,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2018-04-11 11:19:41,630 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:19:41,637 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:19:41,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-11 11:19:41,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, 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:19:41,664 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 11:19:41,667 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:19:41,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-04-11 11:19:41,688 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:57, output treesize:106 [2018-04-11 11:19:41,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-11 11:19:41,873 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:19:41,873 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:19:41,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:19:41,878 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:19:41,878 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:11 [2018-04-11 11:19:41,902 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:19:41,919 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:19:41,919 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 33 [2018-04-11 11:19:41,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-11 11:19:41,920 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-11 11:19:41,920 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=922, Unknown=0, NotChecked=0, Total=1056 [2018-04-11 11:19:41,920 INFO L87 Difference]: Start difference. First operand 236 states and 296 transitions. Second operand 33 states. [2018-04-11 11:19:43,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:19:43,575 INFO L93 Difference]: Finished difference Result 395 states and 470 transitions. [2018-04-11 11:19:43,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-11 11:19:43,575 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 51 [2018-04-11 11:19:43,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:19:43,576 INFO L225 Difference]: With dead ends: 395 [2018-04-11 11:19:43,576 INFO L226 Difference]: Without dead ends: 395 [2018-04-11 11:19:43,577 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1136 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=736, Invalid=3424, Unknown=0, NotChecked=0, Total=4160 [2018-04-11 11:19:43,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-04-11 11:19:43,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 273. [2018-04-11 11:19:43,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-04-11 11:19:43,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 339 transitions. [2018-04-11 11:19:43,582 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 339 transitions. Word has length 51 [2018-04-11 11:19:43,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:19:43,583 INFO L459 AbstractCegarLoop]: Abstraction has 273 states and 339 transitions. [2018-04-11 11:19:43,583 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-11 11:19:43,583 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 339 transitions. [2018-04-11 11:19:43,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-11 11:19:43,583 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:19:43,583 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] [2018-04-11 11:19:43,584 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 11:19:43,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1095108925, now seen corresponding path program 1 times [2018-04-11 11:19:43,584 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:19:43,584 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:19:43,585 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:19:43,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:19:43,585 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:19:43,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:19:43,597 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:19:43,905 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:19:43,905 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:19:43,905 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-04-11 11:19:43,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 11:19:43,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 11:19:43,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2018-04-11 11:19:43,905 INFO L87 Difference]: Start difference. First operand 273 states and 339 transitions. Second operand 19 states. [2018-04-11 11:19:44,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:19:44,819 INFO L93 Difference]: Finished difference Result 469 states and 554 transitions. [2018-04-11 11:19:44,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-11 11:19:44,819 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 53 [2018-04-11 11:19:44,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:19:44,821 INFO L225 Difference]: With dead ends: 469 [2018-04-11 11:19:44,821 INFO L226 Difference]: Without dead ends: 469 [2018-04-11 11:19:44,822 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=543, Invalid=2427, Unknown=0, NotChecked=0, Total=2970 [2018-04-11 11:19:44,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2018-04-11 11:19:44,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 325. [2018-04-11 11:19:44,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-04-11 11:19:44,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 398 transitions. [2018-04-11 11:19:44,828 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 398 transitions. Word has length 53 [2018-04-11 11:19:44,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:19:44,828 INFO L459 AbstractCegarLoop]: Abstraction has 325 states and 398 transitions. [2018-04-11 11:19:44,828 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 11:19:44,828 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 398 transitions. [2018-04-11 11:19:44,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-11 11:19:44,829 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:19:44,829 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, 1, 1] [2018-04-11 11:19:44,829 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 11:19:44,829 INFO L82 PathProgramCache]: Analyzing trace with hash -881701646, now seen corresponding path program 1 times [2018-04-11 11:19:44,830 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:19:44,830 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:19:44,830 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:19:44,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:19:44,831 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:19:44,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:19:44,843 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:19:45,172 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:19:45,173 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:19:45,173 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:19:45,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:19:45,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:19:45,210 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:19:45,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, 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:19:45,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, 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:19:45,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:19:45,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:19:45,261 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:19:45,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:19:45,263 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:19:45,265 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:19:45,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:19:45,271 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-04-11 11:19:45,294 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:19:45,295 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:19:45,295 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:19:45,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:19:45,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:19:45,303 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:28 [2018-04-11 11:19:45,358 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:19:45,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 11:19:45,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:19:45,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:19:45,380 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:19:45,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:19:45,383 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:19:45,386 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:19:45,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:19:45,397 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:53, output treesize:45 [2018-04-11 11:19:45,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-04-11 11:19:45,478 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:19:45,479 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:19:45,479 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:19:45,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:19:45,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 33 [2018-04-11 11:19:45,509 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:19:45,510 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:19:45,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 30 [2018-04-11 11:19:45,510 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:19:45,517 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:19:45,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:19:45,531 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:71, output treesize:99 [2018-04-11 11:19:45,773 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:19:45,774 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:19:45,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 84 [2018-04-11 11:19:45,792 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:19:45,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 11:19:45,806 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:19:45,806 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:19:45,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2018-04-11 11:19:45,810 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:19:45,821 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:19:45,852 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 54 [2018-04-11 11:19:45,855 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:19:45,855 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:19:45,864 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:19:45,865 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2018-04-11 11:19:45,866 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-04-11 11:19:45,878 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:19:45,881 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 65 treesize of output 49 [2018-04-11 11:19:45,887 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:19:45,888 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-11 11:19:45,901 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:19:45,901 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2018-04-11 11:19:45,902 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-04-11 11:19:45,905 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:19:45,905 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2018-04-11 11:19:45,906 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-04-11 11:19:45,924 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:19:45,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-11 11:19:45,946 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:137, output treesize:28 [2018-04-11 11:19:46,038 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:19:46,056 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:19:46,057 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 31 [2018-04-11 11:19:46,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-11 11:19:46,057 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-11 11:19:46,057 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=806, Unknown=0, NotChecked=0, Total=930 [2018-04-11 11:19:46,057 INFO L87 Difference]: Start difference. First operand 325 states and 398 transitions. Second operand 31 states. [2018-04-11 11:19:54,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:19:54,938 INFO L93 Difference]: Finished difference Result 380 states and 455 transitions. [2018-04-11 11:19:54,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-11 11:19:54,939 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 56 [2018-04-11 11:19:54,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:19:54,940 INFO L225 Difference]: With dead ends: 380 [2018-04-11 11:19:54,940 INFO L226 Difference]: Without dead ends: 380 [2018-04-11 11:19:54,940 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=487, Invalid=2483, Unknown=0, NotChecked=0, Total=2970 [2018-04-11 11:19:54,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-04-11 11:19:54,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 333. [2018-04-11 11:19:54,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-04-11 11:19:54,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 406 transitions. [2018-04-11 11:19:54,943 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 406 transitions. Word has length 56 [2018-04-11 11:19:54,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:19:54,943 INFO L459 AbstractCegarLoop]: Abstraction has 333 states and 406 transitions. [2018-04-11 11:19:54,943 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-11 11:19:54,943 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 406 transitions. [2018-04-11 11:19:54,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-11 11:19:54,944 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:19:54,944 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:19:54,944 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 11:19:54,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1562947956, now seen corresponding path program 1 times [2018-04-11 11:19:54,944 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:19:54,944 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:19:54,944 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:19:54,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:19:54,945 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:19:54,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:19:54,952 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:19:55,205 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:19:55,205 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:19:55,205 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:19:55,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:19:55,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:19:55,232 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:19:55,350 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:19:55,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 11:19:55,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:19:55,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:19:55,359 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:19:55,360 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:47 [2018-04-11 11:19:55,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2018-04-11 11:19:55,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 35 [2018-04-11 11:19:55,452 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:19:55,463 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:19:55,478 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:19:55,478 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:62 [2018-04-11 11:19:55,710 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~data~0.base Int) (main_~item2~0.base Int)) (let ((.cse0 (store |c_old(#valid)| main_~item2~0.base 1))) (and (= |c_#valid| (store (store .cse0 main_~data~0.base 0) main_~item2~0.base 0)) (= 0 (select |c_old(#valid)| main_~item2~0.base)) (= 0 (select .cse0 main_~data~0.base))))) is different from true [2018-04-11 11:19:55,725 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-04-11 11:19:55,743 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:19:55,743 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17] total 27 [2018-04-11 11:19:55,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 11:19:55,744 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 11:19:55,744 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=627, Unknown=7, NotChecked=50, Total=756 [2018-04-11 11:19:55,744 INFO L87 Difference]: Start difference. First operand 333 states and 406 transitions. Second operand 28 states. [2018-04-11 11:19:57,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:19:57,172 INFO L93 Difference]: Finished difference Result 335 states and 407 transitions. [2018-04-11 11:19:57,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 11:19:57,172 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 57 [2018-04-11 11:19:57,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:19:57,174 INFO L225 Difference]: With dead ends: 335 [2018-04-11 11:19:57,174 INFO L226 Difference]: Without dead ends: 309 [2018-04-11 11:19:57,174 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=181, Invalid=1374, Unknown=9, NotChecked=76, Total=1640 [2018-04-11 11:19:57,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-04-11 11:19:57,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2018-04-11 11:19:57,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-04-11 11:19:57,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 381 transitions. [2018-04-11 11:19:57,179 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 381 transitions. Word has length 57 [2018-04-11 11:19:57,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:19:57,179 INFO L459 AbstractCegarLoop]: Abstraction has 309 states and 381 transitions. [2018-04-11 11:19:57,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 11:19:57,179 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 381 transitions. [2018-04-11 11:19:57,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-11 11:19:57,180 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:19:57,180 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] [2018-04-11 11:19:57,180 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 11:19:57,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1685625286, now seen corresponding path program 1 times [2018-04-11 11:19:57,180 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:19:57,180 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:19:57,181 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:19:57,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:19:57,181 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:19:57,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:19:57,191 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:19:57,229 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:19:57,230 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:19:57,230 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) [2018-04-11 11:19:57,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:19:57,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:19:57,282 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:19:57,300 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:19:57,330 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:19:57,330 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 5 [2018-04-11 11:19:57,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 11:19:57,331 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 11:19:57,331 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-11 11:19:57,331 INFO L87 Difference]: Start difference. First operand 309 states and 381 transitions. Second operand 5 states. [2018-04-11 11:19:57,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:19:57,363 INFO L93 Difference]: Finished difference Result 651 states and 828 transitions. [2018-04-11 11:19:57,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 11:19:57,364 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2018-04-11 11:19:57,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:19:57,365 INFO L225 Difference]: With dead ends: 651 [2018-04-11 11:19:57,366 INFO L226 Difference]: Without dead ends: 651 [2018-04-11 11:19:57,366 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-11 11:19:57,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2018-04-11 11:19:57,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 289. [2018-04-11 11:19:57,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-04-11 11:19:57,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 357 transitions. [2018-04-11 11:19:57,371 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 357 transitions. Word has length 60 [2018-04-11 11:19:57,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:19:57,371 INFO L459 AbstractCegarLoop]: Abstraction has 289 states and 357 transitions. [2018-04-11 11:19:57,371 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 11:19:57,371 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 357 transitions. [2018-04-11 11:19:57,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-11 11:19:57,372 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:19:57,372 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, 1, 1, 1] [2018-04-11 11:19:57,372 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 11:19:57,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1115154180, now seen corresponding path program 1 times [2018-04-11 11:19:57,372 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:19:57,372 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:19:57,373 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:19:57,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:19:57,373 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:19:57,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:19:57,393 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:19:57,678 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:19:57,679 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:19:57,679 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:19:57,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:19:57,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:19:57,718 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:19:57,745 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:19:57,746 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:19:57,746 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:19:57,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:19:57,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:19:57,753 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-11 11:19:57,779 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:19:57,780 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:19:57,780 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:19:57,781 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:19:57,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:19:57,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:19:57,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2018-04-11 11:19:57,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 8 [2018-04-11 11:19:57,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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:19:57,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:19:57,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:19:57,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:19:57,824 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-04-11 11:19:57,841 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 47 treesize of output 43 [2018-04-11 11:19:57,843 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 14 treesize of output 13 [2018-04-11 11:19:57,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:19:57,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:19:57,853 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:19:57,853 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:50 [2018-04-11 11:19:57,878 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 57 treesize of output 37 [2018-04-11 11:19:57,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-04-11 11:19:57,880 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:19:57,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, 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:19:57,883 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:19:57,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:19:57,887 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:19:57,887 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:57, output treesize:5 [2018-04-11 11:19:57,892 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:19:57,909 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:19:57,910 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2018-04-11 11:19:57,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 11:19:57,910 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 11:19:57,910 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2018-04-11 11:19:57,910 INFO L87 Difference]: Start difference. First operand 289 states and 357 transitions. Second operand 22 states. [2018-04-11 11:20:05,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:20:05,150 INFO L93 Difference]: Finished difference Result 361 states and 410 transitions. [2018-04-11 11:20:05,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-11 11:20:05,150 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 61 [2018-04-11 11:20:05,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:20:05,151 INFO L225 Difference]: With dead ends: 361 [2018-04-11 11:20:05,151 INFO L226 Difference]: Without dead ends: 361 [2018-04-11 11:20:05,152 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=586, Invalid=1964, Unknown=0, NotChecked=0, Total=2550 [2018-04-11 11:20:05,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-04-11 11:20:05,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 289. [2018-04-11 11:20:05,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-04-11 11:20:05,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 356 transitions. [2018-04-11 11:20:05,154 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 356 transitions. Word has length 61 [2018-04-11 11:20:05,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:20:05,154 INFO L459 AbstractCegarLoop]: Abstraction has 289 states and 356 transitions. [2018-04-11 11:20:05,154 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 11:20:05,154 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 356 transitions. [2018-04-11 11:20:05,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-11 11:20:05,154 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:20:05,155 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, 1, 1, 1] [2018-04-11 11:20:05,155 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 11:20:05,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1115154181, now seen corresponding path program 1 times [2018-04-11 11:20:05,155 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:20:05,155 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:20:05,155 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:20:05,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:20:05,155 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:20:05,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:20:05,165 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:20:05,361 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:20:05,362 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:20:05,362 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-11 11:20:05,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 11:20:05,362 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 11:20:05,362 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-04-11 11:20:05,362 INFO L87 Difference]: Start difference. First operand 289 states and 356 transitions. Second operand 12 states. [2018-04-11 11:20:05,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:20:05,719 INFO L93 Difference]: Finished difference Result 336 states and 384 transitions. [2018-04-11 11:20:05,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 11:20:05,719 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2018-04-11 11:20:05,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:20:05,720 INFO L225 Difference]: With dead ends: 336 [2018-04-11 11:20:05,720 INFO L226 Difference]: Without dead ends: 336 [2018-04-11 11:20:05,720 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2018-04-11 11:20:05,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-04-11 11:20:05,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 289. [2018-04-11 11:20:05,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-04-11 11:20:05,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 355 transitions. [2018-04-11 11:20:05,723 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 355 transitions. Word has length 61 [2018-04-11 11:20:05,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:20:05,723 INFO L459 AbstractCegarLoop]: Abstraction has 289 states and 355 transitions. [2018-04-11 11:20:05,723 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 11:20:05,723 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 355 transitions. [2018-04-11 11:20:05,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-11 11:20:05,724 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:20:05,724 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, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:20:05,724 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 11:20:05,724 INFO L82 PathProgramCache]: Analyzing trace with hash -427016634, now seen corresponding path program 1 times [2018-04-11 11:20:05,724 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:20:05,724 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:20:05,724 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:20:05,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:20:05,725 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:20:05,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:20:05,730 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:20:05,757 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-04-11 11:20:05,758 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:20:05,758 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 11:20:05,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 11:20:05,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 11:20:05,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 11:20:05,758 INFO L87 Difference]: Start difference. First operand 289 states and 355 transitions. Second operand 6 states. [2018-04-11 11:20:05,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:20:05,888 INFO L93 Difference]: Finished difference Result 288 states and 353 transitions. [2018-04-11 11:20:05,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 11:20:05,888 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-04-11 11:20:05,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:20:05,889 INFO L225 Difference]: With dead ends: 288 [2018-04-11 11:20:05,889 INFO L226 Difference]: Without dead ends: 288 [2018-04-11 11:20:05,889 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-04-11 11:20:05,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-04-11 11:20:05,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2018-04-11 11:20:05,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-04-11 11:20:05,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 353 transitions. [2018-04-11 11:20:05,891 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 353 transitions. Word has length 65 [2018-04-11 11:20:05,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:20:05,891 INFO L459 AbstractCegarLoop]: Abstraction has 288 states and 353 transitions. [2018-04-11 11:20:05,891 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 11:20:05,891 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 353 transitions. [2018-04-11 11:20:05,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-11 11:20:05,892 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:20:05,892 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, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:20:05,892 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 11:20:05,892 INFO L82 PathProgramCache]: Analyzing trace with hash -427016633, now seen corresponding path program 1 times [2018-04-11 11:20:05,892 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:20:05,892 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:20:05,893 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:20:05,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:20:05,893 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:20:05,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:20:05,902 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:20:06,138 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:20:06,138 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:20:06,138 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-04-11 11:20:06,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 11:20:06,139 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 11:20:06,139 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-04-11 11:20:06,139 INFO L87 Difference]: Start difference. First operand 288 states and 353 transitions. Second operand 15 states. [2018-04-11 11:20:06,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:20:06,592 INFO L93 Difference]: Finished difference Result 399 states and 451 transitions. [2018-04-11 11:20:06,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 11:20:06,593 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 65 [2018-04-11 11:20:06,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:20:06,594 INFO L225 Difference]: With dead ends: 399 [2018-04-11 11:20:06,594 INFO L226 Difference]: Without dead ends: 399 [2018-04-11 11:20:06,594 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=565, Unknown=0, NotChecked=0, Total=756 [2018-04-11 11:20:06,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-04-11 11:20:06,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 288. [2018-04-11 11:20:06,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-04-11 11:20:06,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 352 transitions. [2018-04-11 11:20:06,597 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 352 transitions. Word has length 65 [2018-04-11 11:20:06,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:20:06,598 INFO L459 AbstractCegarLoop]: Abstraction has 288 states and 352 transitions. [2018-04-11 11:20:06,598 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 11:20:06,598 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 352 transitions. [2018-04-11 11:20:06,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-11 11:20:06,598 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:20:06,598 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:20:06,598 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 11:20:06,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1433828200, now seen corresponding path program 1 times [2018-04-11 11:20:06,599 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:20:06,599 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:20:06,599 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:20:06,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:20:06,599 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:20:06,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:20:06,608 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:20:06,709 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:20:06,709 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:20:06,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:20:06,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:20:06,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:20:06,748 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:20:06,762 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 12 treesize of output 11 [2018-04-11 11:20:06,762 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:06,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:06,765 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-11 11:20:06,785 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:06,786 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:06,787 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:06,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-04-11 11:20:06,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:06,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:06,791 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:9 [2018-04-11 11:20:06,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 11:20:06,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, 2 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:20:06,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:06,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:06,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:06,818 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-11 11:20:06,832 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 38 treesize of output 34 [2018-04-11 11:20:06,833 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 14 treesize of output 13 [2018-04-11 11:20:06,834 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:06,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:06,840 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:20:06,840 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27 [2018-04-11 11:20:06,860 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 34 treesize of output 22 [2018-04-11 11:20:06,862 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 22 treesize of output 13 [2018-04-11 11:20:06,863 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:06,868 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 8 treesize of output 4 [2018-04-11 11:20:06,868 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:06,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:06,870 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:20:06,870 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:34, output treesize:4 [2018-04-11 11:20:06,873 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:20:06,891 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:20:06,891 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 18 [2018-04-11 11:20:06,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 11:20:06,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 11:20:06,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2018-04-11 11:20:06,891 INFO L87 Difference]: Start difference. First operand 288 states and 352 transitions. Second operand 18 states. [2018-04-11 11:20:09,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:20:09,275 INFO L93 Difference]: Finished difference Result 292 states and 332 transitions. [2018-04-11 11:20:09,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 11:20:09,275 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 66 [2018-04-11 11:20:09,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:20:09,275 INFO L225 Difference]: With dead ends: 292 [2018-04-11 11:20:09,275 INFO L226 Difference]: Without dead ends: 292 [2018-04-11 11:20:09,276 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=289, Invalid=901, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 11:20:09,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-04-11 11:20:09,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 230. [2018-04-11 11:20:09,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-04-11 11:20:09,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 284 transitions. [2018-04-11 11:20:09,278 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 284 transitions. Word has length 66 [2018-04-11 11:20:09,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:20:09,278 INFO L459 AbstractCegarLoop]: Abstraction has 230 states and 284 transitions. [2018-04-11 11:20:09,278 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 11:20:09,278 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 284 transitions. [2018-04-11 11:20:09,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-04-11 11:20:09,279 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:20:09,279 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:20:09,279 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 11:20:09,279 INFO L82 PathProgramCache]: Analyzing trace with hash 440678710, now seen corresponding path program 1 times [2018-04-11 11:20:09,279 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:20:09,279 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:20:09,280 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:20:09,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:20:09,280 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:20:09,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:20:09,291 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:20:09,464 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:20:09,465 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:20:09,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-04-11 11:20:09,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 11:20:09,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 11:20:09,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-04-11 11:20:09,465 INFO L87 Difference]: Start difference. First operand 230 states and 284 transitions. Second operand 15 states. [2018-04-11 11:20:09,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:20:09,669 INFO L93 Difference]: Finished difference Result 272 states and 309 transitions. [2018-04-11 11:20:09,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 11:20:09,670 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 68 [2018-04-11 11:20:09,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:20:09,670 INFO L225 Difference]: With dead ends: 272 [2018-04-11 11:20:09,670 INFO L226 Difference]: Without dead ends: 272 [2018-04-11 11:20:09,671 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2018-04-11 11:20:09,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-04-11 11:20:09,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 230. [2018-04-11 11:20:09,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-04-11 11:20:09,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 283 transitions. [2018-04-11 11:20:09,673 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 283 transitions. Word has length 68 [2018-04-11 11:20:09,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:20:09,673 INFO L459 AbstractCegarLoop]: Abstraction has 230 states and 283 transitions. [2018-04-11 11:20:09,673 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 11:20:09,673 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 283 transitions. [2018-04-11 11:20:09,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-11 11:20:09,673 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:20:09,673 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:20:09,674 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 11:20:09,674 INFO L82 PathProgramCache]: Analyzing trace with hash -613227361, now seen corresponding path program 1 times [2018-04-11 11:20:09,674 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:20:09,674 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:20:09,674 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:20:09,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:20:09,674 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:20:09,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:20:09,687 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:20:10,465 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:20:10,465 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:20:10,465 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:20:10,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:20:10,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:20:10,501 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:20:10,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 6 treesize of output 5 [2018-04-11 11:20:10,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:10,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:10,517 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:20:10,553 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:10,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 11:20:10,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:10,561 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:10,562 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:10,562 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:20:10,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:10,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:10,567 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-11 11:20:10,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:20:10,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:20:10,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:10,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:10,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 11:20:10,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:20:10,674 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:10,682 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:10,690 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:20:10,690 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:49, output treesize:44 [2018-04-11 11:20:10,718 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:10,719 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 23 treesize of output 36 [2018-04-11 11:20:10,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:10,729 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:10,730 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:10,730 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:20:10,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:10,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:10,737 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:48 [2018-04-11 11:20:10,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-04-11 11:20:10,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:20:10,790 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:10,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:10,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-04-11 11:20:10,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:20:10,809 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:10,812 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:10,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:10,821 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:70, output treesize:62 [2018-04-11 11:20:10,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 41 [2018-04-11 11:20:10,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:10,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:10,868 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:68, output treesize:67 [2018-04-11 11:20:10,984 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 28 treesize of output 59 [2018-04-11 11:20:10,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 41 [2018-04-11 11:20:10,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 11:20:11,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-04-11 11:20:11,136 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:11,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 31 [2018-04-11 11:20:11,184 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 11:20:11,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 11:20:11,274 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 40 treesize of output 69 [2018-04-11 11:20:11,308 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 44 treesize of output 50 [2018-04-11 11:20:11,309 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 11:20:11,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 37 treesize of output 36 [2018-04-11 11:20:11,424 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:11,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 43 [2018-04-11 11:20:11,480 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-11 11:20:11,585 INFO L267 ElimStorePlain]: Start of recursive call 6: 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-04-11 11:20:11,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 12 xjuncts. [2018-04-11 11:20:11,674 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:92, output treesize:840 [2018-04-11 11:20:11,866 WARN L151 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 94 DAG size of output 46 [2018-04-11 11:20:11,900 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 62 treesize of output 59 [2018-04-11 11:20:11,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 11:20:11,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:11,914 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:12,014 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 55 [2018-04-11 11:20:12,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:20:12,016 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:12,025 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:12,096 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 92 treesize of output 87 [2018-04-11 11:20:12,098 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:12,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 11:20:12,099 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:12,114 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:12,181 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 88 treesize of output 81 [2018-04-11 11:20:12,184 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:12,185 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 26 treesize of output 35 [2018-04-11 11:20:12,185 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:12,207 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:12,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 74 [2018-04-11 11:20:12,264 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:12,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 11:20:12,265 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:12,279 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:12,329 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 75 treesize of output 68 [2018-04-11 11:20:12,330 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:12,331 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 26 treesize of output 35 [2018-04-11 11:20:12,331 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:12,343 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:12,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-11 11:20:12,387 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:234, output treesize:210 [2018-04-11 11:20:12,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 128 treesize of output 161 [2018-04-11 11:20:12,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 136 [2018-04-11 11:20:12,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:12,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 132 [2018-04-11 11:20:12,938 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 11:20:13,069 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:13,070 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:13,079 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 111 treesize of output 163 [2018-04-11 11:20:13,080 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 11:20:13,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 11:20:13,441 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 121 treesize of output 114 [2018-04-11 11:20:13,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:20:13,443 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:13,455 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:13,649 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 120 treesize of output 138 [2018-04-11 11:20:13,668 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 129 treesize of output 128 [2018-04-11 11:20:13,668 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:13,805 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:13,810 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 115 [2018-04-11 11:20:13,813 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 20 treesize of output 31 [2018-04-11 11:20:13,813 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:13,831 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:13,836 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 102 [2018-04-11 11:20:13,838 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:13,839 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:20:13,840 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 95 [2018-04-11 11:20:13,840 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:20:13,854 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:20:13,981 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 81 [2018-04-11 11:20:14,002 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:14,003 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 41 treesize of output 56 [2018-04-11 11:20:14,003 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:14,016 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:14,122 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 113 treesize of output 109 [2018-04-11 11:20:14,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, 1 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:20:14,124 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:14,136 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:14,259 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 73 [2018-04-11 11:20:14,261 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:14,262 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 35 treesize of output 69 [2018-04-11 11:20:14,262 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:14,272 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:14,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 6 dim-2 vars, End of recursive call: 1 dim-0 vars, and 5 xjuncts. [2018-04-11 11:20:14,347 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 10 variables, input treesize:348, output treesize:646 [2018-04-11 11:20:14,534 WARN L151 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 83 DAG size of output 76 [2018-04-11 11:20:14,838 WARN L151 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 80 DAG size of output 72 [2018-04-11 11:20:15,072 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 188 treesize of output 164 [2018-04-11 11:20: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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 122 [2018-04-11 11:20:15,074 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:20:15,118 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:15,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, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 103 [2018-04-11 11:20:15,120 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:20:15,157 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 97 treesize of output 82 [2018-04-11 11:20:15,157 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:15,190 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:15,191 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 140 treesize of output 123 [2018-04-11 11:20:15,192 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:20:15,229 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 117 treesize of output 102 [2018-04-11 11:20:15,230 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 11:20:15,276 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-04-11 11:20:15,446 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 123 treesize of output 108 [2018-04-11 11:20:15,448 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:15,449 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 70 treesize of output 66 [2018-04-11 11:20:15,449 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:15,460 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 51 treesize of output 27 [2018-04-11 11:20:15,460 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:20:15,469 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:20:15,626 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 133 treesize of output 116 [2018-04-11 11:20:15,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:15,628 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 78 treesize of output 59 [2018-04-11 11:20:15,628 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:20:15,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2018-04-11 11:20:15,641 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:15,650 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:20:15,824 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 131 treesize of output 116 [2018-04-11 11:20:15,825 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:20:15,825 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:15,839 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:15,840 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 57 treesize of output 42 [2018-04-11 11:20:15,840 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:20:15,852 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:20:16,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 188 treesize of output 174 [2018-04-11 11:20:16,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 148 treesize of output 133 [2018-04-11 11:20:16,028 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 11:20:16,158 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:16,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 143 [2018-04-11 11:20:16,160 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:20:16,267 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:16,268 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:16,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, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 129 [2018-04-11 11:20:16,270 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 11:20:16,378 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 137 treesize of output 122 [2018-04-11 11:20:16,378 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:16,479 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 105 treesize of output 90 [2018-04-11 11:20:16,479 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:16,573 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:16,574 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 129 treesize of output 112 [2018-04-11 11:20:16,574 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:20:16,576 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:16,577 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 107 treesize of output 92 [2018-04-11 11:20:16,577 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:20:16,671 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:16,671 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:16,702 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:16,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 155 [2018-04-11 11:20:16,720 INFO L267 ElimStorePlain]: Start of recursive call 25: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 8 xjuncts. [2018-04-11 11:20:16,995 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 122 treesize of output 90 [2018-04-11 11:20:16,996 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:20:17,236 INFO L267 ElimStorePlain]: Start of recursive call 17: 8 dim-1 vars, End of recursive call: 15 dim-0 vars, and 12 xjuncts. [2018-04-11 11:20:17,696 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 162 treesize of output 133 [2018-04-11 11:20:17,698 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:20:17,698 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:17,711 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:17,712 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:17,714 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 73 [2018-04-11 11:20:17,714 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:20:17,723 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:20:18,155 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 141 treesize of output 124 [2018-04-11 11:20:18,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2018-04-11 11:20:18,160 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:18,190 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:18,191 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 59 treesize of output 44 [2018-04-11 11:20:18,192 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:20:18,203 INFO L267 ElimStorePlain]: Start of recursive call 30: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:20:18,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-2 vars, End of recursive call: 25 dim-0 vars, and 20 xjuncts. [2018-04-11 11:20:18,622 INFO L202 ElimStorePlain]: Needed 32 recursive calls to eliminate 7 variables, input treesize:1075, output treesize:1847 [2018-04-11 11:20:19,347 WARN L151 SmtUtils]: Spent 547ms on a formula simplification. DAG size of input: 316 DAG size of output 100 [2018-04-11 11:20:19,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, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 57 [2018-04-11 11:20:19,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, 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:20:19,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:19,381 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 7 [2018-04-11 11:20:19,382 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:19,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:19,455 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 69 treesize of output 55 [2018-04-11 11:20:19,457 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 14 [2018-04-11 11:20:19,458 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:19,465 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:20:19,465 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:19,471 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:19,535 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 98 treesize of output 86 [2018-04-11 11:20:19,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 71 [2018-04-11 11:20:19,537 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:19,582 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 71 treesize of output 53 [2018-04-11 11:20:19,582 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:19,612 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 53 treesize of output 49 [2018-04-11 11:20:19,613 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:19,636 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 64 treesize of output 48 [2018-04-11 11:20:19,637 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:19,658 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:19,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 48 [2018-04-11 11:20:19,660 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:19,674 INFO L267 ElimStorePlain]: Start of recursive call 8: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:19,720 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 53 treesize of output 41 [2018-04-11 11:20:19,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-04-11 11:20:19,721 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:19,726 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 16 treesize of output 3 [2018-04-11 11:20:19,727 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:19,730 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:19,777 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 86 treesize of output 78 [2018-04-11 11:20:19,779 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:19,780 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:19,781 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 65 [2018-04-11 11:20:19,781 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:20:19,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, 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 43 [2018-04-11 11:20:19,812 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:19,849 INFO L267 ElimStorePlain]: Start of recursive call 17: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:19,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 5 dim-2 vars, End of recursive call: 12 dim-0 vars, and 5 xjuncts. [2018-04-11 11:20:19,886 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 17 variables, input treesize:378, output treesize:161 [2018-04-11 11:20:20,178 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:20:20,204 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:20:20,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 25] total 43 [2018-04-11 11:20:20,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-11 11:20:20,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-11 11:20:20,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1704, Unknown=0, NotChecked=0, Total=1892 [2018-04-11 11:20:20,205 INFO L87 Difference]: Start difference. First operand 230 states and 283 transitions. Second operand 44 states. [2018-04-11 11:20:21,636 WARN L151 SmtUtils]: Spent 168ms on a formula simplification. DAG size of input: 146 DAG size of output 93 [2018-04-11 11:20:21,978 WARN L151 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 133 DAG size of output 75 [2018-04-11 11:20:22,115 WARN L151 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 102 DAG size of output 72 [2018-04-11 11:20:22,273 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 93 DAG size of output 71 [2018-04-11 11:20:22,465 WARN L151 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 141 DAG size of output 83 [2018-04-11 11:20:22,612 WARN L151 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 101 DAG size of output 75 [2018-04-11 11:20:22,809 WARN L151 SmtUtils]: Spent 150ms on a formula simplification. DAG size of input: 130 DAG size of output 75 [2018-04-11 11:20:23,058 WARN L151 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 147 DAG size of output 88 [2018-04-11 11:20:23,227 WARN L151 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 136 DAG size of output 77 [2018-04-11 11:20:23,456 WARN L151 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 133 DAG size of output 94 [2018-04-11 11:20:23,670 WARN L151 SmtUtils]: Spent 170ms on a formula simplification. DAG size of input: 124 DAG size of output 75 [2018-04-11 11:20:25,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:20:25,169 INFO L93 Difference]: Finished difference Result 373 states and 438 transitions. [2018-04-11 11:20:25,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-11 11:20:25,169 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 74 [2018-04-11 11:20:25,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:20:25,170 INFO L225 Difference]: With dead ends: 373 [2018-04-11 11:20:25,170 INFO L226 Difference]: Without dead ends: 373 [2018-04-11 11:20:25,171 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 50 SyntacticMatches, 9 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1650 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=1205, Invalid=5115, Unknown=0, NotChecked=0, Total=6320 [2018-04-11 11:20:25,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-04-11 11:20:25,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 242. [2018-04-11 11:20:25,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-04-11 11:20:25,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 305 transitions. [2018-04-11 11:20:25,173 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 305 transitions. Word has length 74 [2018-04-11 11:20:25,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:20:25,174 INFO L459 AbstractCegarLoop]: Abstraction has 242 states and 305 transitions. [2018-04-11 11:20:25,174 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-11 11:20:25,174 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 305 transitions. [2018-04-11 11:20:25,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-11 11:20:25,174 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:20:25,174 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:20:25,174 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 11:20:25,174 INFO L82 PathProgramCache]: Analyzing trace with hash -613227362, now seen corresponding path program 1 times [2018-04-11 11:20:25,174 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:20:25,174 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:20:25,175 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:20:25,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:20:25,175 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:20:25,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:20:25,208 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:20:25,803 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:20:25,803 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:20:25,803 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:20:25,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:20:25,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:20:25,833 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:20:25,846 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:25,846 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:25,847 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:20:25,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:25,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:25,851 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-04-11 11:20:25,924 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:20:25,925 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:20:25,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:25,926 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:25,931 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:20:25,931 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-04-11 11:20:25,953 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:25,954 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:25,954 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:25,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 52 [2018-04-11 11:20:25,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:25,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:25,962 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:49 [2018-04-11 11:20:26,018 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 43 treesize of output 44 [2018-04-11 11:20:26,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:20:26,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:26,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:26,031 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:20:26,031 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:56 [2018-04-11 11:20:26,065 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:26,066 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:26,066 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:26,067 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:26,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 33 treesize of output 75 [2018-04-11 11:20:26,068 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:26,080 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:20:26,080 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:67, output treesize:79 [2018-04-11 11:20:26,217 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 60 treesize of output 69 [2018-04-11 11:20:26,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:20:26,219 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:26,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:26,244 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:20:26,244 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:93, output treesize:82 [2018-04-11 11:20:26,295 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 60 treesize of output 53 [2018-04-11 11:20:26,297 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:26,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 55 [2018-04-11 11:20:26,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:26,306 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:26,322 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:20:26,322 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:93, output treesize:89 [2018-04-11 11:20:26,378 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 99 treesize of output 99 [2018-04-11 11:20:26,380 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 14 treesize of output 13 [2018-04-11 11:20:26,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:26,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:26,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 11:20:26,410 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:148 [2018-04-11 11:20:26,631 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 94 [2018-04-11 11:20:26,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 39 [2018-04-11 11:20:26,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:26,643 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 34 treesize of output 18 [2018-04-11 11:20:26,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:20:26,655 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:20:26,655 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:26,667 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:20:26,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 treesize of output 5 [2018-04-11 11:20:26,683 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:20:26,683 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:26,684 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:26,693 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:20:26,693 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:158, output treesize:45 [2018-04-11 11:20:26,861 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:26,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 27 treesize of output 51 [2018-04-11 11:20:26,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:26,872 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:20:26,872 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:33 [2018-04-11 11:20:26,959 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:20:26,976 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:20:26,976 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21] total 44 [2018-04-11 11:20:26,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-11 11:20:26,977 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-11 11:20:26,977 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=1741, Unknown=0, NotChecked=0, Total=1980 [2018-04-11 11:20:26,977 INFO L87 Difference]: Start difference. First operand 242 states and 305 transitions. Second operand 45 states. [2018-04-11 11:20:29,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:20:29,997 INFO L93 Difference]: Finished difference Result 342 states and 406 transitions. [2018-04-11 11:20:29,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-11 11:20:29,997 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 74 [2018-04-11 11:20:29,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:20:29,998 INFO L225 Difference]: With dead ends: 342 [2018-04-11 11:20:29,998 INFO L226 Difference]: Without dead ends: 342 [2018-04-11 11:20:29,999 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 56 SyntacticMatches, 7 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1428 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1002, Invalid=5004, Unknown=0, NotChecked=0, Total=6006 [2018-04-11 11:20:30,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-04-11 11:20:30,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 239. [2018-04-11 11:20:30,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-04-11 11:20:30,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 300 transitions. [2018-04-11 11:20:30,002 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 300 transitions. Word has length 74 [2018-04-11 11:20:30,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:20:30,002 INFO L459 AbstractCegarLoop]: Abstraction has 239 states and 300 transitions. [2018-04-11 11:20:30,002 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-11 11:20:30,002 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 300 transitions. [2018-04-11 11:20:30,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-04-11 11:20:30,002 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:20:30,002 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:20:30,002 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 11:20:30,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1830179727, now seen corresponding path program 1 times [2018-04-11 11:20:30,003 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:20:30,003 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:20:30,003 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:20:30,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:20:30,003 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:20:30,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:20:30,012 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:20:30,278 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:20:30,278 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:20:30,278 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:20:30,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:20:30,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:20:30,315 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:20:30,362 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 28 treesize of output 24 [2018-04-11 11:20:30,363 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 12 treesize of output 4 [2018-04-11 11:20:30,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:30,367 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:30,376 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 28 treesize of output 24 [2018-04-11 11:20:30,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-04-11 11:20:30,377 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:30,380 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:30,388 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 17 treesize of output 15 [2018-04-11 11:20:30,389 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:20:30,389 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:30,391 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:30,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-04-11 11:20:30,399 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:20:30,400 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:30,402 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:30,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:20:30,407 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:57, output treesize:21 [2018-04-11 11:20:30,454 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:30,454 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:20:30,454 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:30,457 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:20:30,457 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-04-11 11:20:30,485 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:20:30,502 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:20:30,502 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 23 [2018-04-11 11:20:30,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 11:20:30,503 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 11:20:30,503 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2018-04-11 11:20:30,503 INFO L87 Difference]: Start difference. First operand 239 states and 300 transitions. Second operand 24 states. [2018-04-11 11:20:31,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:20:31,171 INFO L93 Difference]: Finished difference Result 297 states and 343 transitions. [2018-04-11 11:20:31,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 11:20:31,171 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 75 [2018-04-11 11:20:31,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:20:31,172 INFO L225 Difference]: With dead ends: 297 [2018-04-11 11:20:31,172 INFO L226 Difference]: Without dead ends: 297 [2018-04-11 11:20:31,172 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 67 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=314, Invalid=1326, Unknown=0, NotChecked=0, Total=1640 [2018-04-11 11:20:31,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-04-11 11:20:31,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 249. [2018-04-11 11:20:31,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-04-11 11:20:31,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 315 transitions. [2018-04-11 11:20:31,174 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 315 transitions. Word has length 75 [2018-04-11 11:20:31,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:20:31,174 INFO L459 AbstractCegarLoop]: Abstraction has 249 states and 315 transitions. [2018-04-11 11:20:31,174 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 11:20:31,174 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 315 transitions. [2018-04-11 11:20:31,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-04-11 11:20:31,175 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:20:31,175 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:20:31,175 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 11:20:31,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1830179726, now seen corresponding path program 1 times [2018-04-11 11:20:31,175 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:20:31,175 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:20:31,175 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:20:31,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:20:31,175 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:20:31,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:20:31,185 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:20:31,232 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-04-11 11:20:31,232 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:20:31,232 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:20:31,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:20:31,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:20:31,277 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:20:31,306 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-04-11 11:20:31,333 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-11 11:20:31,334 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2018-04-11 11:20:31,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 11:20:31,334 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 11:20:31,334 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-04-11 11:20:31,334 INFO L87 Difference]: Start difference. First operand 249 states and 315 transitions. Second operand 9 states. [2018-04-11 11:20:31,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:20:31,573 INFO L93 Difference]: Finished difference Result 295 states and 338 transitions. [2018-04-11 11:20:31,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 11:20:31,573 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2018-04-11 11:20:31,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:20:31,574 INFO L225 Difference]: With dead ends: 295 [2018-04-11 11:20:31,574 INFO L226 Difference]: Without dead ends: 295 [2018-04-11 11:20:31,574 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2018-04-11 11:20:31,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-04-11 11:20:31,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 256. [2018-04-11 11:20:31,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-04-11 11:20:31,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 323 transitions. [2018-04-11 11:20:31,577 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 323 transitions. Word has length 75 [2018-04-11 11:20:31,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:20:31,577 INFO L459 AbstractCegarLoop]: Abstraction has 256 states and 323 transitions. [2018-04-11 11:20:31,577 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 11:20:31,577 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 323 transitions. [2018-04-11 11:20:31,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-04-11 11:20:31,578 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:20:31,578 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:20:31,578 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 11:20:31,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1830178923, now seen corresponding path program 1 times [2018-04-11 11:20:31,578 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:20:31,578 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:20:31,579 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:20:31,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:20:31,579 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:20:31,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:20:31,596 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:20:32,073 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:20:32,073 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:20:32,073 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:20:32,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:20:32,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:20:32,106 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:20:32,150 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:32,150 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:32,151 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:20:32,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:32,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:32,155 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-04-11 11:20:32,190 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:32,191 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:32,191 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:32,191 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 34 [2018-04-11 11:20:32,192 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:32,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:32,199 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:34 [2018-04-11 11:20:32,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 8 [2018-04-11 11:20:32,289 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 8 treesize of output 7 [2018-04-11 11:20:32,289 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:32,290 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:32,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:32,299 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:48, output treesize:44 [2018-04-11 11:20:32,334 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 47 treesize of output 43 [2018-04-11 11:20:32,335 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 14 treesize of output 13 [2018-04-11 11:20:32,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:32,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:32,347 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:20:32,347 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:79 [2018-04-11 11:20:32,501 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 89 treesize of output 57 [2018-04-11 11:20:32,506 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 39 treesize of output 32 [2018-04-11 11:20:32,506 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:20:32,517 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 46 treesize of output 35 [2018-04-11 11:20:32,517 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:32,518 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 34 treesize of output 23 [2018-04-11 11:20:32,519 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:32,530 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:20:32,547 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 42 treesize of output 38 [2018-04-11 11:20:32,548 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 8 [2018-04-11 11:20:32,548 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:32,553 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:32,554 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 30 treesize of output 28 [2018-04-11 11:20:32,555 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:20:32,556 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:32,560 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:32,574 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:20:32,574 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:107, output treesize:66 [2018-04-11 11:20:32,762 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:32,762 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 34 [2018-04-11 11:20:32,762 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:32,767 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:20:32,767 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:20 [2018-04-11 11:20:32,820 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:20:32,837 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:20:32,837 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 39 [2018-04-11 11:20:32,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-11 11:20:32,838 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-11 11:20:32,838 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1415, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 11:20:32,838 INFO L87 Difference]: Start difference. First operand 256 states and 323 transitions. Second operand 40 states. [2018-04-11 11:20:35,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:20:35,463 INFO L93 Difference]: Finished difference Result 420 states and 479 transitions. [2018-04-11 11:20:35,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-04-11 11:20:35,463 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 75 [2018-04-11 11:20:35,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:20:35,464 INFO L225 Difference]: With dead ends: 420 [2018-04-11 11:20:35,464 INFO L226 Difference]: Without dead ends: 420 [2018-04-11 11:20:35,465 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2148 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1145, Invalid=6511, Unknown=0, NotChecked=0, Total=7656 [2018-04-11 11:20:35,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2018-04-11 11:20:35,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 256. [2018-04-11 11:20:35,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-04-11 11:20:35,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 322 transitions. [2018-04-11 11:20:35,468 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 322 transitions. Word has length 75 [2018-04-11 11:20:35,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:20:35,469 INFO L459 AbstractCegarLoop]: Abstraction has 256 states and 322 transitions. [2018-04-11 11:20:35,469 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-11 11:20:35,469 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 322 transitions. [2018-04-11 11:20:35,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-04-11 11:20:35,469 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:20:35,469 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:20:35,470 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 11:20:35,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1830178922, now seen corresponding path program 1 times [2018-04-11 11:20:35,470 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:20:35,470 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:20:35,470 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:20:35,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:20:35,470 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:20:35,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:20:35,483 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:20:35,959 WARN L151 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 55 DAG size of output 35 [2018-04-11 11:20:36,146 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:20:36,146 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:20:36,146 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:20:36,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:20:36,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:20:36,182 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:20:36,234 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:36,234 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:36,234 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:20:36,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:36,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:36,240 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-11 11:20:36,323 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:36,324 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:36,325 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:36,325 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:20:36,325 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:36,335 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 14 treesize of output 17 [2018-04-11 11:20:36,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:36,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:36,344 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:37 [2018-04-11 11:20:36,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 8 [2018-04-11 11:20:36,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, 2 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:20:36,461 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:36,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:36,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:36,473 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-04-11 11:20:36,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 14 [2018-04-11 11:20:36,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 14 treesize of output 13 [2018-04-11 11:20:36,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:36,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:36,530 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 60 treesize of output 56 [2018-04-11 11:20:36,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, 2 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:20:36,532 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:36,537 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:36,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:20:36,551 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:94, output treesize:112 [2018-04-11 11:20:36,632 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 137 treesize of output 104 [2018-04-11 11:20:36,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 66 [2018-04-11 11:20:36,634 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:20:36,649 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 45 treesize of output 38 [2018-04-11 11:20:36,650 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:20:36,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 11:20:36,692 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 2 xjuncts. [2018-04-11 11:20:36,692 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:146, output treesize:155 [2018-04-11 11:20:36,828 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 75 treesize of output 63 [2018-04-11 11:20:36,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-04-11 11:20:36,830 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:36,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 26 [2018-04-11 11:20:36,845 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 11:20:36,857 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:20:36,898 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 83 treesize of output 69 [2018-04-11 11:20:36,899 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 21 treesize of output 12 [2018-04-11 11:20:36,899 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:36,912 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:36,913 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 33 treesize of output 22 [2018-04-11 11:20:36,914 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:36,922 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:36,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 11:20:36,953 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:159, output treesize:72 [2018-04-11 11:20:37,193 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:20:37,210 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:20:37,210 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21] total 38 [2018-04-11 11:20:37,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-11 11:20:37,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-11 11:20:37,211 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1338, Unknown=0, NotChecked=0, Total=1482 [2018-04-11 11:20:37,211 INFO L87 Difference]: Start difference. First operand 256 states and 322 transitions. Second operand 39 states. [2018-04-11 11:20:40,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:20:40,326 INFO L93 Difference]: Finished difference Result 361 states and 418 transitions. [2018-04-11 11:20:40,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-11 11:20:40,326 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 75 [2018-04-11 11:20:40,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:20:40,327 INFO L225 Difference]: With dead ends: 361 [2018-04-11 11:20:40,327 INFO L226 Difference]: Without dead ends: 361 [2018-04-11 11:20:40,328 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1664 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1114, Invalid=5206, Unknown=0, NotChecked=0, Total=6320 [2018-04-11 11:20:40,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-04-11 11:20:40,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 270. [2018-04-11 11:20:40,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-04-11 11:20:40,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 344 transitions. [2018-04-11 11:20:40,330 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 344 transitions. Word has length 75 [2018-04-11 11:20:40,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:20:40,330 INFO L459 AbstractCegarLoop]: Abstraction has 270 states and 344 transitions. [2018-04-11 11:20:40,330 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-11 11:20:40,331 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 344 transitions. [2018-04-11 11:20:40,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-04-11 11:20:40,331 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:20:40,331 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, 1, 1] [2018-04-11 11:20:40,331 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 11:20:40,331 INFO L82 PathProgramCache]: Analyzing trace with hash 2008235248, now seen corresponding path program 1 times [2018-04-11 11:20:40,331 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:20:40,331 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:20:40,332 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:20:40,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:20:40,332 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:20:40,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:20:40,341 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:20:40,812 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:20:40,812 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:20:40,812 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:20:40,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:20:40,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:20:40,841 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:20:40,845 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:20:40,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 8 treesize of output 7 [2018-04-11 11:20:40,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:40,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:40,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:40,852 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2018-04-11 11:20:40,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 11:20:40,864 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:40,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 11:20:40,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:40,867 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:40,874 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:20:40,874 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 [2018-04-11 11:20:40,876 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:40,876 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:40,878 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:20:40,878 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:40,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:40,881 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2018-04-11 11:20:40,889 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:20:40,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:20:40,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:40,893 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:40,897 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:20:40,898 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:22 [2018-04-11 11:20:41,013 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 30 treesize of output 59 [2018-04-11 11:20:41,015 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-11 11:20:41,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:41,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 36 [2018-04-11 11:20:41,049 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 11:20:41,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-04-11 11:20:41,069 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:41,087 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:20:41,099 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:20:41,099 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:43, output treesize:69 [2018-04-11 11:20:41,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 47 [2018-04-11 11:20:41,143 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 23 treesize of output 15 [2018-04-11 11:20:41,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:41,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:41,165 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:41,165 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:41,166 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 43 treesize of output 55 [2018-04-11 11:20:41,167 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 38 treesize of output 31 [2018-04-11 11:20:41,167 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:41,174 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:41,186 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:20:41,187 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:91, output treesize:65 [2018-04-11 11:20:41,238 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 69 [2018-04-11 11:20:41,246 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 3 case distinctions, treesize of input 49 treesize of output 64 [2018-04-11 11:20:41,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 11:20:41,316 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 32 treesize of output 37 [2018-04-11 11:20:41,316 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:41,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:20:41,362 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:41,363 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:41,363 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:41,364 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 54 treesize of output 65 [2018-04-11 11:20:41,372 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 78 [2018-04-11 11:20:41,372 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:20:41,382 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:41,394 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:20:41,394 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:100, output treesize:81 [2018-04-11 11:20:41,530 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 64 treesize of output 62 [2018-04-11 11:20:41,532 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:20:41,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:41,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:41,558 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 52 treesize of output 50 [2018-04-11 11:20:41,560 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:20:41,560 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:41,564 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:41,585 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 64 treesize of output 60 [2018-04-11 11:20:41,586 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 12 treesize of output 4 [2018-04-11 11:20:41,586 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:41,591 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:41,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 11:20:41,609 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:181, output treesize:156 [2018-04-11 11:20:41,781 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 68 treesize of output 66 [2018-04-11 11:20:41,784 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 63 treesize of output 52 [2018-04-11 11:20:41,784 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:20:41,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 45 [2018-04-11 11:20:41,814 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:41,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 11:20:41,879 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:41,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2018-04-11 11:20:41,889 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 49 treesize of output 57 [2018-04-11 11:20:41,890 INFO L267 ElimStorePlain]: Start of recursive call 6: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 11:20:41,908 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 11:20:41,957 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:41,961 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 1 case distinctions, treesize of input 72 treesize of output 65 [2018-04-11 11:20:41,970 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 61 treesize of output 69 [2018-04-11 11:20:41,971 INFO L267 ElimStorePlain]: Start of recursive call 8: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 11:20:41,997 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 11:20:42,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 14 dim-0 vars, and 8 xjuncts. [2018-04-11 11:20:42,063 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:201, output treesize:422 [2018-04-11 11:20:42,280 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 57 treesize of output 42 [2018-04-11 11:20:42,281 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:42,282 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:20:42,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-04-11 11:20:42,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:42,291 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:20:42,291 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:42,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:42,313 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 63 [2018-04-11 11:20:42,315 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 51 treesize of output 46 [2018-04-11 11:20:42,315 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:42,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2018-04-11 11:20:42,330 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:42,344 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:42,345 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:20:42,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-04-11 11:20:42,345 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:42,355 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:42,361 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:20:42,361 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:131, output treesize:5 [2018-04-11 11:20:42,393 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:20:42,411 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:20:42,411 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 37 [2018-04-11 11:20:42,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-11 11:20:42,411 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-11 11:20:42,411 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1268, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 11:20:42,412 INFO L87 Difference]: Start difference. First operand 270 states and 344 transitions. Second operand 38 states. [2018-04-11 11:20:43,075 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 63 DAG size of output 56 [2018-04-11 11:20:43,811 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 83 DAG size of output 79 [2018-04-11 11:20:43,989 WARN L151 SmtUtils]: Spent 149ms on a formula simplification. DAG size of input: 81 DAG size of output 77 [2018-04-11 11:20:44,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:20:44,718 INFO L93 Difference]: Finished difference Result 353 states and 436 transitions. [2018-04-11 11:20:44,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 11:20:44,719 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 80 [2018-04-11 11:20:44,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:20:44,719 INFO L225 Difference]: With dead ends: 353 [2018-04-11 11:20:44,720 INFO L226 Difference]: Without dead ends: 353 [2018-04-11 11:20:44,720 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 67 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 954 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=504, Invalid=3402, Unknown=0, NotChecked=0, Total=3906 [2018-04-11 11:20:44,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-04-11 11:20:44,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 337. [2018-04-11 11:20:44,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-04-11 11:20:44,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 420 transitions. [2018-04-11 11:20:44,722 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 420 transitions. Word has length 80 [2018-04-11 11:20:44,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:20:44,722 INFO L459 AbstractCegarLoop]: Abstraction has 337 states and 420 transitions. [2018-04-11 11:20:44,722 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-11 11:20:44,722 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 420 transitions. [2018-04-11 11:20:44,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-04-11 11:20:44,723 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:20:44,723 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, 1, 1] [2018-04-11 11:20:44,723 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 11:20:44,723 INFO L82 PathProgramCache]: Analyzing trace with hash 2008235249, now seen corresponding path program 1 times [2018-04-11 11:20:44,723 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:20:44,723 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:20:44,723 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:20:44,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:20:44,723 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:20:44,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:20:44,732 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:20:45,375 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:20:45,375 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:20:45,375 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:20:45,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:20:45,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:20:45,404 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:20:45,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, 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:20:45,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 8 treesize of output 7 [2018-04-11 11:20:45,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:45,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:45,417 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:20:45,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:20:45,419 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:45,420 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:45,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:45,424 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2018-04-11 11:20:45,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 11:20:45,433 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:45,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 11:20:45,434 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:45,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:45,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 11:20:45,447 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:45,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 11:20:45,448 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:45,451 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:45,457 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:20:45,457 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:49, output treesize:23 [2018-04-11 11:20:45,459 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:45,460 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:45,460 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:20:45,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:45,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:45,466 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:32 [2018-04-11 11:20:45,503 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:20:45,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 11:20:45,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:45,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:45,517 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:20:45,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:20:45,519 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:45,521 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:45,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:45,528 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:54, output treesize:46 [2018-04-11 11:20:45,552 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:45,553 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:45,553 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:45,554 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:20:45,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:45,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:45,561 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:47 [2018-04-11 11:20:45,644 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 30 treesize of output 39 [2018-04-11 11:20:45,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:20:45,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:45,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:45,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2018-04-11 11:20:45,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 11:20:45,669 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:45,674 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:45,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:45,684 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:80, output treesize:73 [2018-04-11 11:20:45,720 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:45,722 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:45,724 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 37 treesize of output 57 [2018-04-11 11:20:45,725 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 38 treesize of output 31 [2018-04-11 11:20:45,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:45,733 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:45,747 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:20:45,750 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 41 treesize of output 57 [2018-04-11 11:20:45,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, 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 29 [2018-04-11 11:20:45,752 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:45,765 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:45,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:45,776 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:95, output treesize:69 [2018-04-11 11:20:45,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 76 [2018-04-11 11:20:45,820 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:45,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-11 11:20:45,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:45,829 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:45,842 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:45,844 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:45,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, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 94 [2018-04-11 11:20:45,854 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 73 [2018-04-11 11:20:45,855 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 11:20:45,870 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:45,881 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:20:45,882 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:113, output treesize:123 [2018-04-11 11:20:46,090 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 0 case distinctions, treesize of input 92 treesize of output 150 [2018-04-11 11:20:46,093 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 30 treesize of output 27 [2018-04-11 11:20:46,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:46,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:46,119 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:46,123 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 147 treesize of output 118 [2018-04-11 11:20:46,134 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 126 treesize of output 118 [2018-04-11 11:20:46,137 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 11:20:46,182 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 11:20:46,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 11:20:46,242 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:171, output treesize:385 [2018-04-11 11:20:46,374 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 120 treesize of output 94 [2018-04-11 11:20:46,375 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:46,376 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:20:46,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 64 [2018-04-11 11:20:46,376 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:20:46,386 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 47 treesize of output 32 [2018-04-11 11:20:46,387 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:46,396 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 1 [2018-04-11 11:20:46,396 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:46,403 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:20:46,415 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 37 treesize of output 37 [2018-04-11 11:20:46,416 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:20:46,416 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:46,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, 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 5 [2018-04-11 11:20:46,422 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:46,425 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:20:46,425 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:20:46,425 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:46,427 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:46,432 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:20:46,432 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:133, output treesize:12 [2018-04-11 11:20:46,478 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:20:46,496 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:20:46,496 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 39 [2018-04-11 11:20:46,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-11 11:20:46,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-11 11:20:46,497 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1360, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 11:20:46,497 INFO L87 Difference]: Start difference. First operand 337 states and 420 transitions. Second operand 40 states. [2018-04-11 11:20:48,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:20:48,737 INFO L93 Difference]: Finished difference Result 452 states and 557 transitions. [2018-04-11 11:20:48,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-11 11:20:48,737 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 80 [2018-04-11 11:20:48,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:20:48,738 INFO L225 Difference]: With dead ends: 452 [2018-04-11 11:20:48,738 INFO L226 Difference]: Without dead ends: 452 [2018-04-11 11:20:48,739 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 65 SyntacticMatches, 6 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1262 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=703, Invalid=3716, Unknown=3, NotChecked=0, Total=4422 [2018-04-11 11:20:48,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2018-04-11 11:20:48,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 393. [2018-04-11 11:20:48,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-04-11 11:20:48,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 514 transitions. [2018-04-11 11:20:48,742 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 514 transitions. Word has length 80 [2018-04-11 11:20:48,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:20:48,742 INFO L459 AbstractCegarLoop]: Abstraction has 393 states and 514 transitions. [2018-04-11 11:20:48,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-11 11:20:48,742 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 514 transitions. [2018-04-11 11:20:48,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-04-11 11:20:48,742 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:20:48,742 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, 1, 1, 1] [2018-04-11 11:20:48,742 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 11:20:48,743 INFO L82 PathProgramCache]: Analyzing trace with hash 345581571, now seen corresponding path program 1 times [2018-04-11 11:20:48,743 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:20:48,743 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:20:48,743 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:20:48,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:20:48,743 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:20:48,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:20:48,751 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:20:49,202 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:20:49,202 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:20:49,202 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:20:49,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:20:49,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:20:49,233 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:20:49,236 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:20:49,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:20:49,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:49,238 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:49,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:49,241 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2018-04-11 11:20:49,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 11:20:49,247 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:49,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 11:20:49,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:49,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:49,263 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:20:49,263 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 [2018-04-11 11:20:49,265 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:49,265 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:49,265 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:20:49,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:49,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:49,268 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2018-04-11 11:20:49,274 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:20:49,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:20:49,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:49,278 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:49,281 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:20:49,281 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:22 [2018-04-11 11:20:49,373 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 30 treesize of output 59 [2018-04-11 11:20:49,375 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 34 treesize of output 29 [2018-04-11 11:20:49,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:49,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-04-11 11:20:49,411 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:49,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 36 [2018-04-11 11:20:49,427 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 11:20:49,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:20:49,456 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:20:49,456 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:43, output treesize:69 [2018-04-11 11:20:49,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 55 [2018-04-11 11:20:49,505 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 48 treesize of output 40 [2018-04-11 11:20:49,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:49,529 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:20:49,547 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:49,548 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:49,548 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 43 treesize of output 55 [2018-04-11 11:20:49,550 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 38 treesize of output 31 [2018-04-11 11:20:49,550 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:49,557 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:49,570 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:20:49,570 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:91, output treesize:65 [2018-04-11 11:20:49,621 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 69 [2018-04-11 11:20:49,623 WARN L288 Elim1Store]: Array PQE input equivalent to false [2018-04-11 11:20:49,623 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:49,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 37 [2018-04-11 11:20:49,669 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:49,687 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:49,691 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 3 case distinctions, treesize of input 41 treesize of output 68 [2018-04-11 11:20:49,691 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 11:20:49,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:20:49,739 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:49,739 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:49,740 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:49,741 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 54 treesize of output 65 [2018-04-11 11:20:49,749 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 78 [2018-04-11 11:20:49,749 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 11:20:49,759 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:49,771 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:20:49,771 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:100, output treesize:85 [2018-04-11 11:20:49,939 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 52 treesize of output 50 [2018-04-11 11:20:49,940 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:20:49,940 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:49,944 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:49,966 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 64 treesize of output 62 [2018-04-11 11:20:49,968 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:20:49,968 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:49,973 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:49,995 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 64 treesize of output 60 [2018-04-11 11:20:49,996 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 12 treesize of output 4 [2018-04-11 11:20:49,996 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:50,002 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:50,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 11:20:50,022 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:181, output treesize:156 [2018-04-11 11:20:50,202 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 68 treesize of output 66 [2018-04-11 11:20:50,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 52 [2018-04-11 11:20:50,206 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:20:50,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 48 [2018-04-11 11:20:50,237 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:50,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 11:20:50,290 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:50,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2018-04-11 11:20:50,301 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 49 treesize of output 57 [2018-04-11 11:20:50,302 INFO L267 ElimStorePlain]: Start of recursive call 6: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 11:20:50,323 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 11:20:50,375 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:50,379 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 1 case distinctions, treesize of input 72 treesize of output 65 [2018-04-11 11:20:50,389 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 61 treesize of output 69 [2018-04-11 11:20:50,390 INFO L267 ElimStorePlain]: Start of recursive call 8: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 11:20:50,414 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 11:20:50,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 14 dim-0 vars, and 8 xjuncts. [2018-04-11 11:20:50,482 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:201, output treesize:430 [2018-04-11 11:20:50,781 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:50,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 63 [2018-04-11 11:20:50,790 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:50,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 23 [2018-04-11 11:20:50,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:50,802 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:50,831 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:50,837 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 1 case distinctions, treesize of input 76 treesize of output 78 [2018-04-11 11:20:50,843 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:50,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 23 [2018-04-11 11:20:50,844 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:50,858 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:50,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-11 11:20:50,884 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:141, output treesize:109 [2018-04-11 11:20:50,960 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 57 treesize of output 42 [2018-04-11 11:20:50,961 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 5 [2018-04-11 11:20:50,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:50,968 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:50,969 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:20:50,969 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 24 treesize of output 17 [2018-04-11 11:20:50,969 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:50,974 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:50,994 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 63 [2018-04-11 11:20:50,996 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 45 treesize of output 38 [2018-04-11 11:20:50,996 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:51,016 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:51,016 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:20:51,017 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2018-04-11 11:20:51,017 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:51,034 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 27 treesize of output 18 [2018-04-11 11:20:51,034 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:51,049 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:51,049 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:20:51,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 43 [2018-04-11 11:20:51,056 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 3 xjuncts. [2018-04-11 11:20:51,080 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 18 treesize of output 13 [2018-04-11 11:20:51,080 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:51,088 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:51,096 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:20:51,096 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 7 variables, input treesize:131, output treesize:5 [2018-04-11 11:20:51,135 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:20:51,153 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:20:51,153 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26] total 40 [2018-04-11 11:20:51,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-11 11:20:51,154 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-11 11:20:51,154 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1486, Unknown=0, NotChecked=0, Total=1640 [2018-04-11 11:20:51,154 INFO L87 Difference]: Start difference. First operand 393 states and 514 transitions. Second operand 41 states. [2018-04-11 11:20:52,636 WARN L151 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 90 DAG size of output 86 [2018-04-11 11:20:52,790 WARN L151 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 88 DAG size of output 84 [2018-04-11 11:20:53,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:20:53,983 INFO L93 Difference]: Finished difference Result 520 states and 677 transitions. [2018-04-11 11:20:53,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-11 11:20:53,984 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 81 [2018-04-11 11:20:53,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:20:53,985 INFO L225 Difference]: With dead ends: 520 [2018-04-11 11:20:53,985 INFO L226 Difference]: Without dead ends: 520 [2018-04-11 11:20:53,985 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 67 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1193 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=588, Invalid=4104, Unknown=0, NotChecked=0, Total=4692 [2018-04-11 11:20:53,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2018-04-11 11:20:53,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 421. [2018-04-11 11:20:53,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-04-11 11:20:53,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 548 transitions. [2018-04-11 11:20:53,988 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 548 transitions. Word has length 81 [2018-04-11 11:20:53,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:20:53,988 INFO L459 AbstractCegarLoop]: Abstraction has 421 states and 548 transitions. [2018-04-11 11:20:53,988 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-11 11:20:53,988 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 548 transitions. [2018-04-11 11:20:53,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-04-11 11:20:53,989 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:20:53,989 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, 1, 1, 1] [2018-04-11 11:20:53,989 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 11:20:53,989 INFO L82 PathProgramCache]: Analyzing trace with hash 345581572, now seen corresponding path program 1 times [2018-04-11 11:20:53,989 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:20:53,989 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:20:53,989 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:20:53,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:20:53,990 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:20:53,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:20:53,999 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:20:55,030 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:20:55,030 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:20:55,030 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:20:55,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:20:55,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:20:55,081 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:20:55,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, 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:20:55,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 8 treesize of output 7 [2018-04-11 11:20:55,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:55,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:55,125 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:20:55,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:20:55,126 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:55,127 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:55,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:55,130 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2018-04-11 11:20:55,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 11:20:55,176 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:55,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 11:20:55,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:55,180 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:55,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 11:20:55,190 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:55,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 11:20:55,190 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:55,193 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:55,199 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:20:55,199 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:49, output treesize:23 [2018-04-11 11:20:55,309 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:55,309 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:55,310 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:20:55,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:55,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:55,316 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:32 [2018-04-11 11:20:55,368 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:20:55,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 8 treesize of output 7 [2018-04-11 11:20:55,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:55,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:55,382 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:20:55,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:20:55,384 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:55,386 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:55,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:55,393 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:54, output treesize:46 [2018-04-11 11:20:55,420 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:55,420 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:55,420 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:55,421 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:20:55,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:55,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:55,428 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:47 [2018-04-11 11:20:55,518 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 30 treesize of output 39 [2018-04-11 11:20:55,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:20:55,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:55,525 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:55,540 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 30 treesize of output 39 [2018-04-11 11:20:55,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:20:55,542 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:55,546 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:55,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:55,556 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:80, output treesize:69 [2018-04-11 11:20:55,596 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:20:55,598 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 37 treesize of output 47 [2018-04-11 11:20:55,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-04-11 11:20:55,600 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:55,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:55,630 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:55,632 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:55,633 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 37 treesize of output 57 [2018-04-11 11:20:55,634 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 38 treesize of output 35 [2018-04-11 11:20:55,634 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:55,640 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:55,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:55,651 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:91, output treesize:69 [2018-04-11 11:20:55,689 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:55,690 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:55,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 37 treesize of output 59 [2018-04-11 11:20:55,701 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 42 [2018-04-11 11:20:55,702 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:20:55,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:55,732 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 48 treesize of output 59 [2018-04-11 11:20:55,734 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 36 treesize of output 41 [2018-04-11 11:20:55,734 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:55,741 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:55,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:20:55,753 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:88, output treesize:94 [2018-04-11 11:20:55,950 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:55,950 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:20:55,954 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:55,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 135 [2018-04-11 11:20:55,970 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 60 treesize of output 81 [2018-04-11 11:20:55,971 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 11:20:55,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:56,011 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 0 case distinctions, treesize of input 83 treesize of output 105 [2018-04-11 11:20:56,013 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 26 treesize of output 34 [2018-04-11 11:20:56,013 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:56,021 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:56,033 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:20:56,033 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:135, output treesize:105 [2018-04-11 11:20:56,207 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 99 treesize of output 101 [2018-04-11 11:20:56,210 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:56,210 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 22 treesize of output 31 [2018-04-11 11:20:56,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:56,222 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:56,249 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 0 case distinctions, treesize of input 83 treesize of output 105 [2018-04-11 11:20:56,252 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:56,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, 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 39 [2018-04-11 11:20:56,253 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:56,263 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:56,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 11:20:56,281 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:142, output treesize:115 [2018-04-11 11:20:56,336 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 128 treesize of output 102 [2018-04-11 11:20:56,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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:20:56,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:56,349 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:56,349 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:20:56,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 58 [2018-04-11 11:20:56,350 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:20:56,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, 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 1 [2018-04-11 11:20:56,359 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:56,366 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:20:56,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2018-04-11 11:20:56,381 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:20:56,381 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:56,395 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:20:56,396 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:20:56,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-04-11 11:20:56,397 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:20:56,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 5 treesize of output 1 [2018-04-11 11:20:56,401 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 11:20:56,402 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:20:56,407 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:20:56,407 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:141, output treesize:12 [2018-04-11 11:20:56,490 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:20:56,508 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:20:56,508 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 47 [2018-04-11 11:20:56,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-04-11 11:20:56,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-04-11 11:20:56,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=2073, Unknown=1, NotChecked=0, Total=2256 [2018-04-11 11:20:56,509 INFO L87 Difference]: Start difference. First operand 421 states and 548 transitions. Second operand 48 states. [2018-04-11 11:20:59,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:20:59,941 INFO L93 Difference]: Finished difference Result 554 states and 708 transitions. [2018-04-11 11:20:59,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-11 11:20:59,941 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 81 [2018-04-11 11:20:59,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:20:59,943 INFO L225 Difference]: With dead ends: 554 [2018-04-11 11:20:59,943 INFO L226 Difference]: Without dead ends: 554 [2018-04-11 11:20:59,943 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1503 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=836, Invalid=5322, Unknown=4, NotChecked=0, Total=6162 [2018-04-11 11:20:59,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-04-11 11:20:59,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 416. [2018-04-11 11:20:59,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-04-11 11:20:59,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 542 transitions. [2018-04-11 11:20:59,946 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 542 transitions. Word has length 81 [2018-04-11 11:20:59,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:20:59,946 INFO L459 AbstractCegarLoop]: Abstraction has 416 states and 542 transitions. [2018-04-11 11:20:59,947 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-04-11 11:20:59,947 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 542 transitions. [2018-04-11 11:20:59,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-11 11:20:59,947 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:20:59,947 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:20:59,947 INFO L408 AbstractCegarLoop]: === Iteration 42 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 11:20:59,947 INFO L82 PathProgramCache]: Analyzing trace with hash 534957103, now seen corresponding path program 1 times [2018-04-11 11:20:59,947 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:20:59,947 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:20:59,948 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:20:59,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:20:59,948 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:20:59,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:20:59,967 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:21:01,138 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:21:01,138 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:21:01,138 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:21:01,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:21:01,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:21:01,171 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:21:01,254 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 17 treesize of output 14 [2018-04-11 11:21:01,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:21:01,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:01,256 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:01,261 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:21:01,261 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-04-11 11:21:01,304 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 12 treesize of output 11 [2018-04-11 11:21:01,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:01,311 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:21:01,311 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:36 [2018-04-11 11:21:01,458 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:21:01,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:21:01,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:01,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:01,472 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:21:01,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 11:21:01,473 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:01,475 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:01,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:21:01,484 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:62, output treesize:66 [2018-04-11 11:21:01,528 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:01,528 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:01,529 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:01,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 28 treesize of output 42 [2018-04-11 11:21:01,530 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:01,542 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:21:01,542 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:80, output treesize:88 [2018-04-11 11:21:01,655 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 58 treesize of output 59 [2018-04-11 11:21:01,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 8 treesize of output 7 [2018-04-11 11:21:01,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:01,663 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:01,684 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 55 treesize of output 56 [2018-04-11 11:21:01,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:21:01,686 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:01,693 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:01,711 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:21:01,712 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:113, output treesize:105 [2018-04-11 11:21:01,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 48 [2018-04-11 11:21:01,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:21:01,887 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:01,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:01,915 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:21:01,915 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:123, output treesize:119 [2018-04-11 11:21:02,113 WARN L148 SmtUtils]: Spent 108ms on a formula simplification that was a NOOP. DAG size: 56 [2018-04-11 11:21:02,119 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:02,119 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:02,120 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 56 treesize of output 96 [2018-04-11 11:21:02,127 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:02,127 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 61 treesize of output 35 [2018-04-11 11:21:02,128 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:21:02,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:21:02,189 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:21:02,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:135, output treesize:109 [2018-04-11 11:21:02,280 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:02,280 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:02,281 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:02,281 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:02,282 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:02,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2018-04-11 11:21:02,283 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:02,307 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:21:02,308 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:117, output treesize:109 [2018-04-11 11:21:02,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 71 [2018-04-11 11:21:02,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:21:02,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:02,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:02,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 63 [2018-04-11 11:21:02,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 11:21:02,582 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:02,590 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:02,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 11:21:02,613 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:134, output treesize:112 [2018-04-11 11:21:02,691 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 54 treesize of output 51 [2018-04-11 11:21:02,693 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:02,693 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 40 treesize of output 49 [2018-04-11 11:21:02,694 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:02,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:02,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 57 [2018-04-11 11:21:02,731 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:02,732 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:21:02,732 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 46 treesize of output 66 [2018-04-11 11:21:02,733 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:02,750 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:02,776 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:21:02,776 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:134, output treesize:117 [2018-04-11 11:21:02,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 131 [2018-04-11 11:21:02,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:21:02,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:02,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:02,917 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:02,920 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 109 treesize of output 126 [2018-04-11 11:21:02,922 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 38 treesize of output 32 [2018-04-11 11:21:02,922 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:02,933 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:02,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 11:21:02,955 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:185, output treesize:283 [2018-04-11 11:21:03,353 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:03,355 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:03,357 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 286 treesize of output 244 [2018-04-11 11:21:03,360 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:21:03,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:03,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 153 [2018-04-11 11:21:03,382 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:21:03,397 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:21:03,398 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 102 treesize of output 68 [2018-04-11 11:21:03,398 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:03,410 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:21:03,433 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 1 xjuncts. [2018-04-11 11:21:03,433 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:335, output treesize:170 [2018-04-11 11:21:03,599 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 0 case distinctions, treesize of input 134 treesize of output 110 [2018-04-11 11:21:03,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-04-11 11:21:03,605 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:03,624 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 87 treesize of output 59 [2018-04-11 11:21:03,624 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:03,633 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 37 treesize of output 18 [2018-04-11 11:21:03,633 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:03,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:03,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 11:21:03,652 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:156, output treesize:46 [2018-04-11 11:21:03,987 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:03,988 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:03,988 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:21:03,993 INFO L477 Elim1Store]: Elim1 applied some 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 23 treesize of output 28 [2018-04-11 11:21:03,993 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:21:04,001 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 5 [2018-04-11 11:21:04,001 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:04,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:04,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 11:21:04,012 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:61, output treesize:25 [2018-04-11 11:21:04,126 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:21:04,145 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:21:04,145 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 33] total 61 [2018-04-11 11:21:04,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-04-11 11:21:04,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-04-11 11:21:04,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=3382, Unknown=0, NotChecked=0, Total=3660 [2018-04-11 11:21:04,146 INFO L87 Difference]: Start difference. First operand 416 states and 542 transitions. Second operand 61 states. [2018-04-11 11:21:07,350 WARN L151 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 144 DAG size of output 94 [2018-04-11 11:21:07,549 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 109 DAG size of output 87 [2018-04-11 11:21:07,887 WARN L151 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 146 DAG size of output 96 [2018-04-11 11:21:08,115 WARN L151 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 100 DAG size of output 93 [2018-04-11 11:21:08,390 WARN L151 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 150 DAG size of output 101 [2018-04-11 11:21:08,650 WARN L151 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 117 DAG size of output 106 [2018-04-11 11:21:09,023 WARN L151 SmtUtils]: Spent 230ms on a formula simplification. DAG size of input: 175 DAG size of output 120 [2018-04-11 11:21:09,274 WARN L151 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 122 DAG size of output 96 [2018-04-11 11:21:09,465 WARN L151 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 126 DAG size of output 100 [2018-04-11 11:21:10,043 WARN L151 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 121 DAG size of output 95 [2018-04-11 11:21:10,473 WARN L151 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 127 DAG size of output 102 [2018-04-11 11:21:10,811 WARN L151 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 142 DAG size of output 104 [2018-04-11 11:21:11,036 WARN L151 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 127 DAG size of output 102 [2018-04-11 11:21:11,271 WARN L151 SmtUtils]: Spent 143ms on a formula simplification. DAG size of input: 128 DAG size of output 103 [2018-04-11 11:21:11,873 WARN L151 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 144 DAG size of output 92 [2018-04-11 11:21:12,486 WARN L151 SmtUtils]: Spent 140ms on a formula simplification. DAG size of input: 148 DAG size of output 96 [2018-04-11 11:21:12,975 WARN L151 SmtUtils]: Spent 169ms on a formula simplification. DAG size of input: 179 DAG size of output 123 [2018-04-11 11:21:17,359 WARN L151 SmtUtils]: Spent 178ms on a formula simplification. DAG size of input: 186 DAG size of output 119 [2018-04-11 11:21:17,960 WARN L151 SmtUtils]: Spent 194ms on a formula simplification. DAG size of input: 188 DAG size of output 121 [2018-04-11 11:21:19,037 WARN L151 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 133 DAG size of output 97 [2018-04-11 11:21:19,363 WARN L151 SmtUtils]: Spent 191ms on a formula simplification. DAG size of input: 189 DAG size of output 122 [2018-04-11 11:21:19,562 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 98 DAG size of output 91 [2018-04-11 11:21:19,793 WARN L151 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 130 DAG size of output 92 [2018-04-11 11:21:20,327 WARN L151 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 135 DAG size of output 99 [2018-04-11 11:21:20,578 WARN L151 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 117 DAG size of output 99 [2018-04-11 11:21:21,697 WARN L151 SmtUtils]: Spent 168ms on a formula simplification. DAG size of input: 133 DAG size of output 109 [2018-04-11 11:21:25,494 WARN L151 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 104 DAG size of output 90 [2018-04-11 11:21:25,690 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 96 DAG size of output 88 [2018-04-11 11:21:25,889 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 97 DAG size of output 89 [2018-04-11 11:21:27,412 WARN L151 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 129 DAG size of output 109 [2018-04-11 11:21:32,140 WARN L151 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 125 DAG size of output 105 [2018-04-11 11:21:32,987 WARN L151 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 137 DAG size of output 107 [2018-04-11 11:21:33,892 WARN L151 SmtUtils]: Spent 150ms on a formula simplification. DAG size of input: 137 DAG size of output 107 [2018-04-11 11:21:34,735 WARN L151 SmtUtils]: Spent 157ms on a formula simplification. DAG size of input: 141 DAG size of output 110 [2018-04-11 11:21:37,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:21:37,684 INFO L93 Difference]: Finished difference Result 1304 states and 1601 transitions. [2018-04-11 11:21:37,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-04-11 11:21:37,685 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 84 [2018-04-11 11:21:37,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:21:37,688 INFO L225 Difference]: With dead ends: 1304 [2018-04-11 11:21:37,688 INFO L226 Difference]: Without dead ends: 1304 [2018-04-11 11:21:37,690 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 61 SyntacticMatches, 7 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18688 ImplicationChecksByTransitivity, 21.6s TimeCoverageRelationStatistics Valid=5153, Invalid=46149, Unknown=0, NotChecked=0, Total=51302 [2018-04-11 11:21:37,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2018-04-11 11:21:37,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 599. [2018-04-11 11:21:37,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2018-04-11 11:21:37,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 745 transitions. [2018-04-11 11:21:37,696 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 745 transitions. Word has length 84 [2018-04-11 11:21:37,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:21:37,696 INFO L459 AbstractCegarLoop]: Abstraction has 599 states and 745 transitions. [2018-04-11 11:21:37,696 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-04-11 11:21:37,696 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 745 transitions. [2018-04-11 11:21:37,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-04-11 11:21:37,696 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:21:37,696 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, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:21:37,696 INFO L408 AbstractCegarLoop]: === Iteration 43 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 11:21:37,697 INFO L82 PathProgramCache]: Analyzing trace with hash 745947425, now seen corresponding path program 1 times [2018-04-11 11:21:37,697 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:21:37,697 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:21:37,697 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:21:37,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:21:37,697 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:21:37,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:21:37,704 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:21:37,742 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-04-11 11:21:37,743 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:21:37,743 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 11:21:37,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 11:21:37,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 11:21:37,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-04-11 11:21:37,743 INFO L87 Difference]: Start difference. First operand 599 states and 745 transitions. Second operand 7 states. [2018-04-11 11:21:37,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:21:37,923 INFO L93 Difference]: Finished difference Result 698 states and 857 transitions. [2018-04-11 11:21:37,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 11:21:37,944 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2018-04-11 11:21:37,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:21:37,945 INFO L225 Difference]: With dead ends: 698 [2018-04-11 11:21:37,945 INFO L226 Difference]: Without dead ends: 698 [2018-04-11 11:21:37,946 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-04-11 11:21:37,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2018-04-11 11:21:37,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 621. [2018-04-11 11:21:37,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2018-04-11 11:21:37,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 787 transitions. [2018-04-11 11:21:37,951 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 787 transitions. Word has length 85 [2018-04-11 11:21:37,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:21:37,951 INFO L459 AbstractCegarLoop]: Abstraction has 621 states and 787 transitions. [2018-04-11 11:21:37,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 11:21:37,951 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 787 transitions. [2018-04-11 11:21:37,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-04-11 11:21:37,952 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:21:37,952 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, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:21:37,952 INFO L408 AbstractCegarLoop]: === Iteration 44 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 11:21:37,952 INFO L82 PathProgramCache]: Analyzing trace with hash 745947426, now seen corresponding path program 1 times [2018-04-11 11:21:37,952 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:21:37,952 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:21:37,952 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:21:37,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:21:37,952 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:21:37,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:21:37,961 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:21:38,004 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-04-11 11:21:38,004 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:21:38,004 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 11:21:38,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 11:21:38,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 11:21:38,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-11 11:21:38,004 INFO L87 Difference]: Start difference. First operand 621 states and 787 transitions. Second operand 7 states. [2018-04-11 11:21:38,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:21:38,253 INFO L93 Difference]: Finished difference Result 723 states and 876 transitions. [2018-04-11 11:21:38,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 11:21:38,253 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2018-04-11 11:21:38,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:21:38,255 INFO L225 Difference]: With dead ends: 723 [2018-04-11 11:21:38,255 INFO L226 Difference]: Without dead ends: 723 [2018-04-11 11:21:38,255 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-04-11 11:21:38,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2018-04-11 11:21:38,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 617. [2018-04-11 11:21:38,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2018-04-11 11:21:38,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 767 transitions. [2018-04-11 11:21:38,259 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 767 transitions. Word has length 85 [2018-04-11 11:21:38,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:21:38,259 INFO L459 AbstractCegarLoop]: Abstraction has 617 states and 767 transitions. [2018-04-11 11:21:38,259 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 11:21:38,259 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 767 transitions. [2018-04-11 11:21:38,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-04-11 11:21:38,260 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:21:38,260 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:21:38,260 INFO L408 AbstractCegarLoop]: === Iteration 45 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 11:21:38,260 INFO L82 PathProgramCache]: Analyzing trace with hash 745948229, now seen corresponding path program 1 times [2018-04-11 11:21:38,260 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:21:38,260 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:21:38,260 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:21:38,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:21:38,261 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:21:38,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:21:38,270 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:21:39,190 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:21:39,190 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:21:39,191 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:21:39,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:21:39,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:21:39,226 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:21:39,273 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:39,273 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:39,273 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:21:39,274 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:39,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:39,278 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-11 11:21:39,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 11:21:39,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 11:21:39,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:39,324 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:39,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 11:21:39,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 11:21:39,333 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:39,334 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:39,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:39,340 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:46, output treesize:38 [2018-04-11 11:21:39,373 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:39,373 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:39,374 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:39,374 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:21:39,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:39,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:39,381 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:39 [2018-04-11 11:21:39,476 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 19 treesize of output 20 [2018-04-11 11:21:39,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:21:39,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:39,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:39,494 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 19 treesize of output 20 [2018-04-11 11:21:39,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 8 treesize of output 7 [2018-04-11 11:21:39,496 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:39,499 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:39,510 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:21:39,510 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:64, output treesize:42 [2018-04-11 11:21:39,549 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 19 treesize of output 20 [2018-04-11 11:21:39,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:21:39,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:39,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:39,569 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 19 treesize of output 20 [2018-04-11 11:21:39,570 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 8 treesize of output 7 [2018-04-11 11:21:39,570 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:39,573 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:39,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:39,584 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:64, output treesize:56 [2018-04-11 11:21:39,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 74 [2018-04-11 11:21:39,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 17 [2018-04-11 11:21:39,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:39,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:39,663 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 64 treesize of output 77 [2018-04-11 11:21:39,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-04-11 11:21:39,664 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:39,671 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:39,684 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:21:39,684 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:108, output treesize:170 [2018-04-11 11:21:40,038 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 198 treesize of output 156 [2018-04-11 11:21:40,040 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 159 treesize of output 136 [2018-04-11 11:21:40,040 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:21:40,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:21:40,076 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 157 treesize of output 126 [2018-04-11 11:21:40,078 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 122 treesize of output 96 [2018-04-11 11:21:40,078 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:40,091 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:40,104 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:21:40,105 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:230, output treesize:93 [2018-04-11 11:21:40,252 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:40,257 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 54 treesize of output 63 [2018-04-11 11:21:40,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, 2 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:21:40,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:40,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:40,282 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:40,286 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 65 treesize of output 80 [2018-04-11 11:21:40,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:21:40,288 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:40,296 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:40,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-11 11:21:40,310 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:115, output treesize:107 [2018-04-11 11:21:40,414 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 106 treesize of output 87 [2018-04-11 11:21:40,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 41 [2018-04-11 11:21:40,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:40,423 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 21 treesize of output 17 [2018-04-11 11:21:40,423 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:40,430 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 41 treesize of output 33 [2018-04-11 11:21:40,430 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:21:40,435 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:21:40,448 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 56 treesize of output 52 [2018-04-11 11:21:40,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 17 treesize of output 9 [2018-04-11 11:21:40,450 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:40,456 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 33 treesize of output 17 [2018-04-11 11:21:40,456 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:21:40,461 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:21:40,461 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:40,463 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:40,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:40,469 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:147, output treesize:7 [2018-04-11 11:21:40,523 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:21:40,553 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:21:40,553 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 25] total 51 [2018-04-11 11:21:40,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-04-11 11:21:40,554 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-04-11 11:21:40,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=2311, Unknown=18, NotChecked=0, Total=2550 [2018-04-11 11:21:40,554 INFO L87 Difference]: Start difference. First operand 617 states and 767 transitions. Second operand 51 states. [2018-04-11 11:21:47,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:21:47,465 INFO L93 Difference]: Finished difference Result 792 states and 938 transitions. [2018-04-11 11:21:47,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-04-11 11:21:47,465 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 85 [2018-04-11 11:21:47,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:21:47,466 INFO L225 Difference]: With dead ends: 792 [2018-04-11 11:21:47,467 INFO L226 Difference]: Without dead ends: 792 [2018-04-11 11:21:47,468 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 67 SyntacticMatches, 6 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3976 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1695, Invalid=10941, Unknown=20, NotChecked=0, Total=12656 [2018-04-11 11:21:47,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2018-04-11 11:21:47,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 612. [2018-04-11 11:21:47,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-04-11 11:21:47,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 756 transitions. [2018-04-11 11:21:47,475 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 756 transitions. Word has length 85 [2018-04-11 11:21:47,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:21:47,475 INFO L459 AbstractCegarLoop]: Abstraction has 612 states and 756 transitions. [2018-04-11 11:21:47,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-04-11 11:21:47,475 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 756 transitions. [2018-04-11 11:21:47,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-04-11 11:21:47,476 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:21:47,476 INFO L355 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2018-04-11 11:21:47,476 INFO L408 AbstractCegarLoop]: === Iteration 46 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 11:21:47,476 INFO L82 PathProgramCache]: Analyzing trace with hash -548802072, now seen corresponding path program 1 times [2018-04-11 11:21:47,476 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:21:47,476 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:21:47,477 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:21:47,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:21:47,477 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:21:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:21:47,485 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:21:47,502 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-04-11 11:21:47,502 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:21:47,502 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:21:47,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:21:47,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:21:47,539 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:21:47,551 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-04-11 11:21:47,580 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-11 11:21:47,581 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2018-04-11 11:21:47,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 11:21:47,581 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 11:21:47,581 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-11 11:21:47,581 INFO L87 Difference]: Start difference. First operand 612 states and 756 transitions. Second operand 6 states. [2018-04-11 11:21:47,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:21:47,602 INFO L93 Difference]: Finished difference Result 472 states and 594 transitions. [2018-04-11 11:21:47,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 11:21:47,602 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2018-04-11 11:21:47,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:21:47,603 INFO L225 Difference]: With dead ends: 472 [2018-04-11 11:21:47,603 INFO L226 Difference]: Without dead ends: 472 [2018-04-11 11:21:47,603 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-11 11:21:47,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2018-04-11 11:21:47,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2018-04-11 11:21:47,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2018-04-11 11:21:47,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 594 transitions. [2018-04-11 11:21:47,608 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 594 transitions. Word has length 86 [2018-04-11 11:21:47,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:21:47,608 INFO L459 AbstractCegarLoop]: Abstraction has 472 states and 594 transitions. [2018-04-11 11:21:47,608 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 11:21:47,608 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 594 transitions. [2018-04-11 11:21:47,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-04-11 11:21:47,609 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:21:47,609 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:21:47,609 INFO L408 AbstractCegarLoop]: === Iteration 47 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 11:21:47,609 INFO L82 PathProgramCache]: Analyzing trace with hash 774235116, now seen corresponding path program 1 times [2018-04-11 11:21:47,609 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:21:47,609 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:21:47,610 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:21:47,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:21:47,610 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:21:47,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:21:47,623 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:21:48,309 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:21:48,309 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:21:48,309 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:21:48,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:21:48,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:21:48,340 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:21:48,344 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:21:48,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:21:48,345 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:48,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:48,354 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:21:48,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 8 treesize of output 7 [2018-04-11 11:21:48,355 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:48,356 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:48,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:48,369 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2018-04-11 11:21:48,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 11:21:48,379 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:48,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 11:21:48,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:48,383 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:48,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 11:21:48,392 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:48,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 11:21:48,393 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:48,396 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:48,401 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:21:48,401 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:49, output treesize:23 [2018-04-11 11:21:48,407 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:48,407 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:48,408 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:21:48,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:48,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:48,414 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:32 [2018-04-11 11:21:48,452 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:21:48,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:21:48,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:48,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:48,468 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:21:48,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 11:21:48,469 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:48,473 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:48,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:48,480 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:54, output treesize:46 [2018-04-11 11:21:48,505 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:48,505 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:48,506 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:48,506 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:21:48,506 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:48,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:48,514 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:47 [2018-04-11 11:21:48,603 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 30 treesize of output 39 [2018-04-11 11:21:48,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:21:48,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:48,609 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:48,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2018-04-11 11:21:48,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:21:48,626 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:48,630 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:48,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:48,640 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:80, output treesize:69 [2018-04-11 11:21:48,672 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:48,674 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:48,675 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 37 treesize of output 57 [2018-04-11 11:21:48,676 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 38 treesize of output 31 [2018-04-11 11:21:48,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:48,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:48,701 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:21:48,703 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 37 treesize of output 55 [2018-04-11 11:21:48,704 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 36 treesize of output 42 [2018-04-11 11:21:48,705 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:48,710 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:48,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:48,720 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:91, output treesize:77 [2018-04-11 11:21:48,782 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 61 treesize of output 78 [2018-04-11 11:21:48,784 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 35 treesize of output 46 [2018-04-11 11:21:48,785 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:48,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:48,805 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:48,806 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:48,809 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 99 treesize of output 102 [2018-04-11 11:21:48,817 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 81 [2018-04-11 11:21:48,817 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 11:21:48,831 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:48,844 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:21:48,844 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:121, output treesize:135 [2018-04-11 11:21:49,000 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:49,007 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 0 case distinctions, treesize of input 100 treesize of output 158 [2018-04-11 11:21:49,009 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 38 treesize of output 54 [2018-04-11 11:21:49,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:49,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:49,034 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:49,034 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:49,039 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 159 treesize of output 124 [2018-04-11 11:21:49,050 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 132 treesize of output 122 [2018-04-11 11:21:49,051 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 11:21:49,091 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 11:21:49,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 11:21:49,136 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:176, output treesize:384 [2018-04-11 11:21:49,325 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:49,330 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 103 treesize of output 105 [2018-04-11 11:21:49,332 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:49,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-11 11:21:49,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:49,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:49,367 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:49,374 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 0 case distinctions, treesize of input 83 treesize of output 113 [2018-04-11 11:21:49,376 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:49,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 39 [2018-04-11 11:21:49,377 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:49,387 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:49,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 11:21:49,406 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:140, output treesize:117 [2018-04-11 11:21:49,459 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 87 treesize of output 85 [2018-04-11 11:21:49,460 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:21:49,460 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:49,468 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:21:49,469 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:49,474 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:49,474 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:21:49,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2018-04-11 11:21:49,476 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:21:49,480 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:21:49,489 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:21:49,489 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:141, output treesize:81 [2018-04-11 11:21:49,589 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:21:49,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 62 [2018-04-11 11:21:49,593 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:21:49,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:49,599 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:21:49,600 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:21:49,600 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:49,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2018-04-11 11:21:49,605 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:49,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:49,610 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:21:49,610 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:85, output treesize:5 [2018-04-11 11:21:49,640 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:21:49,657 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:21:49,657 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 43 [2018-04-11 11:21:49,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-11 11:21:49,658 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-11 11:21:49,658 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1666, Unknown=6, NotChecked=0, Total=1892 [2018-04-11 11:21:49,658 INFO L87 Difference]: Start difference. First operand 472 states and 594 transitions. Second operand 44 states. [2018-04-11 11:21:51,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:21:51,895 INFO L93 Difference]: Finished difference Result 482 states and 601 transitions. [2018-04-11 11:21:51,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-11 11:21:51,895 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2018-04-11 11:21:51,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:21:51,896 INFO L225 Difference]: With dead ends: 482 [2018-04-11 11:21:51,896 INFO L226 Difference]: Without dead ends: 482 [2018-04-11 11:21:51,897 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 70 SyntacticMatches, 4 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1463 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=727, Invalid=4814, Unknown=9, NotChecked=0, Total=5550 [2018-04-11 11:21:51,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2018-04-11 11:21:51,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 472. [2018-04-11 11:21:51,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2018-04-11 11:21:51,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 593 transitions. [2018-04-11 11:21:51,899 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 593 transitions. Word has length 86 [2018-04-11 11:21:51,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:21:51,899 INFO L459 AbstractCegarLoop]: Abstraction has 472 states and 593 transitions. [2018-04-11 11:21:51,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-11 11:21:51,899 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 593 transitions. [2018-04-11 11:21:51,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-04-11 11:21:51,900 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:21:51,900 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:21:51,900 INFO L408 AbstractCegarLoop]: === Iteration 48 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 11:21:51,900 INFO L82 PathProgramCache]: Analyzing trace with hash 774235117, now seen corresponding path program 1 times [2018-04-11 11:21:51,900 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:21:51,900 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:21:51,901 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:21:51,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:21:51,901 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:21:51,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:21:51,909 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:21:52,443 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 26 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:21:52,443 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:21:52,444 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:21:52,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:21:52,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:21:52,476 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:21:52,478 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:21:52,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:21:52,479 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:52,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:52,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 11:21:52,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:21:52,487 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:52,488 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:52,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:52,493 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2018-04-11 11:21:52,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 11:21:52,504 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:52,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 11:21:52,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:52,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:52,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 11:21:52,516 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:52,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 11:21:52,517 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:52,519 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:52,524 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:21:52,524 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:49, output treesize:23 [2018-04-11 11:21:52,529 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:52,530 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:52,530 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:21:52,530 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:52,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:52,534 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:22 [2018-04-11 11:21:52,542 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:21:52,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 8 treesize of output 7 [2018-04-11 11:21:52,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:52,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:52,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-04-11 11:21:52,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 8 treesize of output 7 [2018-04-11 11:21:52,557 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:52,560 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:52,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:52,565 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-04-11 11:21:52,664 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 30 treesize of output 59 [2018-04-11 11:21:52,666 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-11 11:21:52,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:52,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-04-11 11:21:52,702 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:52,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 36 [2018-04-11 11:21:52,719 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 11:21:52,739 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:21:52,774 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 30 treesize of output 59 [2018-04-11 11:21:52,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-04-11 11:21:52,777 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:52,814 INFO L267 ElimStorePlain]: Start of recursive call 6: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:52,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:21:52,830 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:72, output treesize:122 [2018-04-11 11:21:52,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 83 treesize of output 83 [2018-04-11 11:21:52,911 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 23 treesize of output 15 [2018-04-11 11:21:52,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:52,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:52,967 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:52,967 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:52,968 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 79 treesize of output 91 [2018-04-11 11:21:52,969 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 38 treesize of output 31 [2018-04-11 11:21:52,969 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:52,982 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:53,011 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:53,012 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:21:53,014 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 82 [2018-04-11 11:21:53,015 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 36 treesize of output 42 [2018-04-11 11:21:53,015 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:53,025 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:53,052 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:21:53,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 68 treesize of output 81 [2018-04-11 11:21:53,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 42 [2018-04-11 11:21:53,061 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:53,071 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:53,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:21:53,093 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:163, output treesize:151 [2018-04-11 11:21:53,160 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 121 [2018-04-11 11:21:53,164 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 114 treesize of output 125 [2018-04-11 11:21:53,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:53,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 104 [2018-04-11 11:21:53,236 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 11:21:53,290 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:21:53,336 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:53,338 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 96 treesize of output 87 [2018-04-11 11:21:53,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 67 [2018-04-11 11:21:53,340 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:53,352 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:53,372 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 105 treesize of output 178 [2018-04-11 11:21:53,376 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 132 treesize of output 149 [2018-04-11 11:21:53,376 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:53,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 123 [2018-04-11 11:21:53,510 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-11 11:21:53,574 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:21:53,626 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:53,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:53,628 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:53,629 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 115 treesize of output 120 [2018-04-11 11:21:53,648 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 101 [2018-04-11 11:21:53,649 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 11:21:53,669 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:53,701 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:53,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 94 [2018-04-11 11:21:53,704 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 40 treesize of output 57 [2018-04-11 11:21:53,704 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:53,711 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:53,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-11 11:21:53,742 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:229, output treesize:294 [2018-04-11 11:21:54,138 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:54,139 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:54,140 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 136 treesize of output 124 [2018-04-11 11:21:54,150 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 124 treesize of output 116 [2018-04-11 11:21:54,152 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:21:54,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 11:21:54,466 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:54,468 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:21:54,469 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 106 [2018-04-11 11:21:54,471 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 40 treesize of output 52 [2018-04-11 11:21:54,471 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:54,480 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:54,482 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:21:54,484 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 90 [2018-04-11 11:21:54,485 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 40 treesize of output 52 [2018-04-11 11:21:54,485 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:54,494 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:54,495 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:54,497 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:21:54,498 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 162 [2018-04-11 11:21:54,499 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 56 treesize of output 65 [2018-04-11 11:21:54,499 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:54,510 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:54,616 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:54,619 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:54,621 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 1 case distinctions, treesize of input 168 treesize of output 151 [2018-04-11 11:21:54,632 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 152 treesize of output 140 [2018-04-11 11:21:54,633 INFO L267 ElimStorePlain]: Start of recursive call 11: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 11:21:54,703 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 11:21:54,939 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:54,942 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:21:54,946 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 122 [2018-04-11 11:21:54,947 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 40 treesize of output 41 [2018-04-11 11:21:54,948 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:54,959 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:54,961 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:54,963 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:21:54,967 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 142 [2018-04-11 11:21:54,969 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 40 treesize of output 41 [2018-04-11 11:21:54,969 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:54,981 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:54,983 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:54,987 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:21:54,988 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 172 treesize of output 186 [2018-04-11 11:21:54,990 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 56 treesize of output 84 [2018-04-11 11:21:54,990 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:55,002 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:55,126 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:55,127 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:55,128 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 128 treesize of output 118 [2018-04-11 11:21:55,140 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 115 treesize of output 109 [2018-04-11 11:21:55,141 INFO L267 ElimStorePlain]: Start of recursive call 19: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 11:21:55,195 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 11:21:55,399 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:55,400 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:21:55,401 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 98 [2018-04-11 11:21:55,402 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 40 treesize of output 41 [2018-04-11 11:21:55,403 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:55,412 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:55,413 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:55,414 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:21:55,415 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 157 [2018-04-11 11:21:55,417 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 56 treesize of output 84 [2018-04-11 11:21:55,417 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:55,427 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:55,429 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:55,430 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:21:55,431 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 98 [2018-04-11 11:21:55,433 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 40 treesize of output 52 [2018-04-11 11:21:55,433 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:55,442 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:55,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: 12 dim-0 vars, and 9 xjuncts. [2018-04-11 11:21:55,571 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 6 variables, input treesize:433, output treesize:987 [2018-04-11 11:21:55,960 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:55,968 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 141 [2018-04-11 11:21:55,970 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:55,971 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 26 treesize of output 39 [2018-04-11 11:21:55,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:55,991 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:56,099 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 100 [2018-04-11 11:21:56,101 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:56,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 43 [2018-04-11 11:21:56,102 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:56,115 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:56,198 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 105 treesize of output 100 [2018-04-11 11:21:56,200 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:56,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 27 [2018-04-11 11:21:56,201 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:56,212 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:56,289 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 1 case distinctions, treesize of input 135 treesize of output 133 [2018-04-11 11:21:56,291 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:56,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 23 [2018-04-11 11:21:56,292 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:56,308 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:56,371 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:56,374 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 108 [2018-04-11 11:21:56,377 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:56,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 43 [2018-04-11 11:21:56,378 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:56,392 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:56,445 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:56,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 108 [2018-04-11 11:21:56,449 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:56,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 27 [2018-04-11 11:21:56,450 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:56,463 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:56,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 6 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 11:21:56,508 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 19 variables, input treesize:371, output treesize:269 [2018-04-11 11:21:56,770 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:56,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 83 [2018-04-11 11:21:56,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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:21:56,773 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:56,783 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:56,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 27 [2018-04-11 11:21:56,784 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:56,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:56,828 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:56,833 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 126 treesize of output 121 [2018-04-11 11:21:56,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 114 treesize of output 105 [2018-04-11 11:21:56,835 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:56,870 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 95 [2018-04-11 11:21:56,870 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:56,901 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:56,901 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:21:56,901 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 93 [2018-04-11 11:21:56,902 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:21:56,932 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:56,932 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:21:56,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 104 [2018-04-11 11:21:56,941 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 11:21:56,998 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 75 treesize of output 66 [2018-04-11 11:21:56,998 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:57,047 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-1 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-04-11 11:21:57,121 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 92 treesize of output 80 [2018-04-11 11:21:57,122 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:57,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 48 [2018-04-11 11:21:57,123 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:57,131 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 32 treesize of output 23 [2018-04-11 11:21:57,131 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:57,136 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:57,212 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 60 [2018-04-11 11:21:57,213 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 48 [2018-04-11 11:21:57,214 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:21:57,236 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 41 treesize of output 34 [2018-04-11 11:21:57,237 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:57,256 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 29 [2018-04-11 11:21:57,257 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:57,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2018-04-11 11:21:57,275 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:57,292 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 28 treesize of output 21 [2018-04-11 11:21:57,292 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:57,301 INFO L267 ElimStorePlain]: Start of recursive call 14: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:57,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 66 [2018-04-11 11:21:57,308 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:21:57,308 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 58 treesize of output 54 [2018-04-11 11:21:57,308 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:57,332 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:21:57,332 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 62 treesize of output 58 [2018-04-11 11:21:57,332 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:57,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2018-04-11 11:21:57,352 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:57,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 43 [2018-04-11 11:21:57,370 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:57,383 INFO L267 ElimStorePlain]: Start of recursive call 20: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:57,385 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 66 treesize of output 50 [2018-04-11 11:21:57,386 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:21:57,387 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:57,406 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 20 treesize of output 12 [2018-04-11 11:21:57,406 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:57,413 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:21:57,414 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:57,419 INFO L267 ElimStorePlain]: Start of recursive call 25: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:57,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 63 [2018-04-11 11:21:57,426 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:57,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2018-04-11 11:21:57,428 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:21:57,452 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:21:57,453 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 49 treesize of output 45 [2018-04-11 11:21:57,453 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:57,474 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:57,475 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:57,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2018-04-11 11:21:57,477 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:57,496 INFO L267 ElimStorePlain]: Start of recursive call 29: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:57,535 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 55 treesize of output 39 [2018-04-11 11:21:57,536 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:21:57,536 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:57,541 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:57,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2018-04-11 11:21:57,542 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:57,545 INFO L267 ElimStorePlain]: Start of recursive call 33: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:57,593 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:21:57,594 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 39 [2018-04-11 11:21:57,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-04-11 11:21:57,596 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:57,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-04-11 11:21:57,601 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-04-11 11:21:57,604 INFO L267 ElimStorePlain]: Start of recursive call 36: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:21:57,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 6 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:21:57,632 INFO L202 ElimStorePlain]: Needed 38 recursive calls to eliminate 10 variables, input treesize:332, output treesize:25 [2018-04-11 11:21:57,706 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:21:57,724 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:21:57,724 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 42 [2018-04-11 11:21:57,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-11 11:21:57,724 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-11 11:21:57,725 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1504, Unknown=2, NotChecked=0, Total=1722 [2018-04-11 11:21:57,725 INFO L87 Difference]: Start difference. First operand 472 states and 593 transitions. Second operand 42 states. [2018-04-11 11:21:59,228 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 143 DAG size of output 107 [2018-04-11 11:21:59,446 WARN L151 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 148 DAG size of output 111 [2018-04-11 11:21:59,710 WARN L151 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 169 DAG size of output 159 [2018-04-11 11:22:00,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:22:00,240 INFO L93 Difference]: Finished difference Result 443 states and 525 transitions. [2018-04-11 11:22:00,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-11 11:22:00,240 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 86 [2018-04-11 11:22:00,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:22:00,241 INFO L225 Difference]: With dead ends: 443 [2018-04-11 11:22:00,241 INFO L226 Difference]: Without dead ends: 443 [2018-04-11 11:22:00,241 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 71 SyntacticMatches, 8 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1365 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=646, Invalid=4043, Unknown=3, NotChecked=0, Total=4692 [2018-04-11 11:22:00,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-04-11 11:22:00,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 413. [2018-04-11 11:22:00,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-04-11 11:22:00,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 493 transitions. [2018-04-11 11:22:00,243 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 493 transitions. Word has length 86 [2018-04-11 11:22:00,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:22:00,244 INFO L459 AbstractCegarLoop]: Abstraction has 413 states and 493 transitions. [2018-04-11 11:22:00,244 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-11 11:22:00,244 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 493 transitions. [2018-04-11 11:22:00,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-04-11 11:22:00,244 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:22:00,244 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:22:00,244 INFO L408 AbstractCegarLoop]: === Iteration 49 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 11:22:00,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1443860914, now seen corresponding path program 1 times [2018-04-11 11:22:00,244 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:22:00,245 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:22:00,245 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:22:00,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:22:00,245 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:22:00,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:22:00,254 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:22:00,559 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:22:00,559 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:22:00,559 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:22:00,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:22:00,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:22:00,592 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:22:00,603 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:00,603 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:00,603 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:22:00,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:22:00,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:22:00,607 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-04-11 11:22:00,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 11:22:00,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 11:22:00,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:22:00,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:22:00,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:22:00,640 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:25 [2018-04-11 11:22:00,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 11:22:00,678 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:00,678 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:22:00,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:22:00,681 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:22:00,686 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:22:00,686 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:37 [2018-04-11 11:22:00,708 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:00,708 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:00,709 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:00,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 52 [2018-04-11 11:22:00,709 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:22:00,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:22:00,717 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:56 [2018-04-11 11:22:00,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 51 [2018-04-11 11:22:00,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:22:00,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:22:00,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:22:00,790 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:22:00,790 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:63 [2018-04-11 11:22:00,825 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:00,826 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:00,827 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:00,827 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:00,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 33 treesize of output 75 [2018-04-11 11:22:00,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:22:00,841 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:22:00,841 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:77, output treesize:89 [2018-04-11 11:22:00,993 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 71 treesize of output 80 [2018-04-11 11:22:00,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:22:00,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:22:01,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:22:01,017 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:22:01,018 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:107, output treesize:100 [2018-04-11 11:22:01,065 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:01,067 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:01,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 90 [2018-04-11 11:22:01,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 78 [2018-04-11 11:22:01,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:22:01,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:22:01,095 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:22:01,095 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:111, output treesize:96 [2018-04-11 11:22:01,143 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:01,144 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:01,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 117 [2018-04-11 11:22:01,162 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 58 [2018-04-11 11:22:01,163 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:22:01,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:22:01,191 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:22:01,192 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:125, output treesize:138 [2018-04-11 11:22:01,421 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 7 treesize of output 5 [2018-04-11 11:22:01,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, 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:22:01,422 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:22:01,423 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:22:01,437 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:22:01,437 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:161, output treesize:154 [2018-04-11 11:22:01,631 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:01,632 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:01,635 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:01,637 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 144 [2018-04-11 11:22:01,662 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 106 treesize of output 124 [2018-04-11 11:22:01,663 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 11:22:01,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:22:01,733 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:22:01,733 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:172, output treesize:125 [2018-04-11 11:22:02,048 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:02,048 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:02,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 37 treesize of output 99 [2018-04-11 11:22:02,049 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:22:02,067 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:22:02,067 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:134, output treesize:114 [2018-04-11 11:22:02,213 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:02,214 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:02,215 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:02,217 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 110 treesize of output 118 [2018-04-11 11:22:02,220 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:02,220 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:02,223 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:02,230 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 71 [2018-04-11 11:22:02,231 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:22:02,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:22:02,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-11 11:22:02,267 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:124, output treesize:117 [2018-04-11 11:22:02,494 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:02,494 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:02,495 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:22:02,495 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:02,500 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:02,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 108 [2018-04-11 11:22:02,505 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:02,505 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:02,506 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:02,506 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:22:02,519 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 87 [2018-04-11 11:22:02,521 INFO L267 ElimStorePlain]: Start of recursive call 3: 12 dim-0 vars, End of recursive call: 12 dim-0 vars, and 7 xjuncts. [2018-04-11 11:22:02,621 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:02,622 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:02,631 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 74 [2018-04-11 11:22:02,633 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 8 xjuncts. [2018-04-11 11:22:02,636 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:02,637 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:02,638 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:02,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 70 treesize of output 108 [2018-04-11 11:22:02,660 INFO L267 ElimStorePlain]: Start of recursive call 5: 11 dim-0 vars, End of recursive call: 11 dim-0 vars, and 32 xjuncts. [2018-04-11 11:22:02,663 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:02,666 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 52 [2018-04-11 11:22:02,667 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:22:02,670 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:02,671 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:02,672 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:02,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 112 [2018-04-11 11:22:02,691 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-11 11:22:02,700 INFO L267 ElimStorePlain]: Start of recursive call 7: 16 dim-0 vars, End of recursive call: 16 dim-0 vars, and 64 xjuncts. [2018-04-11 11:22:02,703 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:02,705 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:02,706 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:02,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 70 treesize of output 108 [2018-04-11 11:22:02,729 INFO L267 ElimStorePlain]: Start of recursive call 8: 9 dim-0 vars, End of recursive call: 9 dim-0 vars, and 32 xjuncts. [2018-04-11 11:22:02,732 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:02,734 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:02,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 86 [2018-04-11 11:22:02,745 INFO L267 ElimStorePlain]: Start of recursive call 9: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 8 xjuncts. [2018-04-11 11:22:02,748 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:02,750 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:02,750 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:02,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 70 treesize of output 108 [2018-04-11 11:22:02,773 INFO L267 ElimStorePlain]: Start of recursive call 10: 11 dim-0 vars, End of recursive call: 11 dim-0 vars, and 32 xjuncts. [2018-04-11 11:22:05,446 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:22:05,446 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 11:22:06,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 115 dim-0 vars, and 61 xjuncts. [2018-04-11 11:22:08,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 176 dim-0 vars, and 61 xjuncts. [2018-04-11 11:22:08,357 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:152, output treesize:2637 [2018-04-11 11:22:08,851 WARN L151 SmtUtils]: Spent 150ms on a formula simplification. DAG size of input: 1198 DAG size of output 49 [2018-04-11 11:22:08,952 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:08,953 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:08,953 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:08,954 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:08,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 27 treesize of output 51 [2018-04-11 11:22:08,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:22:08,962 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:22:08,962 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:29 [2018-04-11 11:22:09,048 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:22:09,065 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:22:09,065 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 34] total 53 [2018-04-11 11:22:09,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-04-11 11:22:09,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-04-11 11:22:09,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=2542, Unknown=0, NotChecked=0, Total=2756 [2018-04-11 11:22:09,066 INFO L87 Difference]: Start difference. First operand 413 states and 493 transitions. Second operand 53 states. [2018-04-11 11:22:10,536 WARN L151 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 100 DAG size of output 81 [2018-04-11 11:22:13,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:22:13,235 INFO L93 Difference]: Finished difference Result 474 states and 530 transitions. [2018-04-11 11:22:13,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-04-11 11:22:13,235 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 90 [2018-04-11 11:22:13,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:22:13,236 INFO L225 Difference]: With dead ends: 474 [2018-04-11 11:22:13,236 INFO L226 Difference]: Without dead ends: 474 [2018-04-11 11:22:13,237 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4130 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1456, Invalid=11654, Unknown=0, NotChecked=0, Total=13110 [2018-04-11 11:22:13,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2018-04-11 11:22:13,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 412. [2018-04-11 11:22:13,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2018-04-11 11:22:13,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 490 transitions. [2018-04-11 11:22:13,240 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 490 transitions. Word has length 90 [2018-04-11 11:22:13,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:22:13,240 INFO L459 AbstractCegarLoop]: Abstraction has 412 states and 490 transitions. [2018-04-11 11:22:13,240 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-04-11 11:22:13,240 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 490 transitions. [2018-04-11 11:22:13,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-04-11 11:22:13,240 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:22:13,241 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:22:13,241 INFO L408 AbstractCegarLoop]: === Iteration 50 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 11:22:13,241 INFO L82 PathProgramCache]: Analyzing trace with hash -159948770, now seen corresponding path program 1 times [2018-04-11 11:22:13,241 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:22:13,241 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:22:13,242 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:22:13,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:22:13,242 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:22:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:22:13,257 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:22:13,806 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:22:13,806 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:22:13,806 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:22:13,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:22:13,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:22:13,845 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:22:13,936 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:22:13,937 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:22:13,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:22:13,938 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:22:13,941 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:22:13,941 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-11 11:22:13,947 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:13,948 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:13,948 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:22:13,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:22:13,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:22:13,953 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:28 [2018-04-11 11:22:13,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 22 treesize of output 23 [2018-04-11 11:22:13,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 8 treesize of output 7 [2018-04-11 11:22:13,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:22:13,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:22:13,995 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:22:13,995 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2018-04-11 11:22:14,014 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:14,015 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:14,016 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:14,016 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:22:14,016 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:22:14,022 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:22:14,022 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:33 [2018-04-11 11:22:14,082 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 29 treesize of output 38 [2018-04-11 11:22:14,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:22:14,084 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:22:14,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:22:14,093 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:22:14,093 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:33 [2018-04-11 11:22:14,096 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 29 treesize of output 28 [2018-04-11 11:22:14,098 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:14,098 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 17 treesize of output 24 [2018-04-11 11:22:14,098 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:22:14,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:22:14,107 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:22:14,108 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-04-11 11:22:14,133 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 55 treesize of output 55 [2018-04-11 11:22:14,134 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 14 treesize of output 13 [2018-04-11 11:22:14,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:22:14,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:22:14,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 11:22:14,145 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:62, output treesize:71 [2018-04-11 11:22:14,172 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 77 treesize of output 57 [2018-04-11 11:22:14,174 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:22:14,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:22:14,179 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 19 treesize of output 11 [2018-04-11 11:22:14,179 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:22:14,182 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:14,183 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:22:14,184 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 0 case distinctions, treesize of input 22 treesize of output 22 [2018-04-11 11:22:14,184 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:22:14,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:22:14,187 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:22:14,187 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:80, output treesize:8 [2018-04-11 11:22:14,230 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:22:14,247 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:22:14,247 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 36 [2018-04-11 11:22:14,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-11 11:22:14,248 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-11 11:22:14,248 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1097, Unknown=0, NotChecked=0, Total=1260 [2018-04-11 11:22:14,248 INFO L87 Difference]: Start difference. First operand 412 states and 490 transitions. Second operand 36 states. [2018-04-11 11:22:15,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:22:15,697 INFO L93 Difference]: Finished difference Result 420 states and 496 transitions. [2018-04-11 11:22:15,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-11 11:22:15,697 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 91 [2018-04-11 11:22:15,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:22:15,698 INFO L225 Difference]: With dead ends: 420 [2018-04-11 11:22:15,698 INFO L226 Difference]: Without dead ends: 418 [2018-04-11 11:22:15,699 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 77 SyntacticMatches, 11 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1299 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=869, Invalid=3421, Unknown=0, NotChecked=0, Total=4290 [2018-04-11 11:22:15,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-04-11 11:22:15,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 348. [2018-04-11 11:22:15,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-04-11 11:22:15,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 418 transitions. [2018-04-11 11:22:15,701 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 418 transitions. Word has length 91 [2018-04-11 11:22:15,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:22:15,701 INFO L459 AbstractCegarLoop]: Abstraction has 348 states and 418 transitions. [2018-04-11 11:22:15,701 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-11 11:22:15,701 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 418 transitions. [2018-04-11 11:22:15,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-04-11 11:22:15,701 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:22:15,701 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:22:15,702 INFO L408 AbstractCegarLoop]: === Iteration 51 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 11:22:15,702 INFO L82 PathProgramCache]: Analyzing trace with hash -844138317, now seen corresponding path program 1 times [2018-04-11 11:22:15,702 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:22:15,702 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:22:15,702 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:22:15,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:22:15,703 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:22:15,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:22:15,714 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:22:16,633 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:22:16,633 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:22:16,633 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:22:16,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:22:16,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:22:16,666 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:22:16,668 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:22:16,669 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:22:16,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:22:16,672 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2018-04-11 11:22:16,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 11:22:16,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 11:22:16,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:22:16,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:22:16,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:22:16,721 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:25 [2018-04-11 11:22:16,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 11:22:16,775 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:16,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 11:22:16,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:22:16,778 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:22:16,788 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:22:16,788 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:25 [2018-04-11 11:22:16,812 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:16,812 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:16,813 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:22:16,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:22:16,818 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 15 [2018-04-11 11:22:16,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:22:16,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:22:16,823 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:29 [2018-04-11 11:22:16,884 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 19 treesize of output 20 [2018-04-11 11:22:16,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 8 treesize of output 7 [2018-04-11 11:22:16,885 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:22:16,887 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:22:16,893 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:22:16,893 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:36 [2018-04-11 11:22:16,927 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 20 [2018-04-11 11:22:16,927 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:22:16,935 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:22:16,935 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:44 [2018-04-11 11:22:17,072 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 30 treesize of output 59 [2018-04-11 11:22:17,074 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 34 treesize of output 29 [2018-04-11 11:22:17,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:22:17,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-04-11 11:22:17,109 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:22:17,122 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:17,126 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 28 treesize of output 44 [2018-04-11 11:22:17,126 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 11:22:17,146 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:22:17,162 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:22:17,163 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:62, output treesize:107 [2018-04-11 11:22:17,248 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:17,248 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:17,249 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 57 treesize of output 69 [2018-04-11 11:22:17,250 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 38 treesize of output 31 [2018-04-11 11:22:17,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:22:17,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:22:17,304 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 4 case distinctions, treesize of input 66 treesize of output 70 [2018-04-11 11:22:17,306 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 63 treesize of output 55 [2018-04-11 11:22:17,306 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:22:17,333 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:22:17,358 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:22:17,358 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:124, output treesize:98 [2018-04-11 11:22:17,419 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:17,419 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:17,421 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:17,421 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 83 [2018-04-11 11:22:17,429 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 78 [2018-04-11 11:22:17,430 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:22:17,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:22:17,483 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 68 treesize of output 86 [2018-04-11 11:22:17,488 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:17,489 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:17,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 75 [2018-04-11 11:22:17,493 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 11:22:17,553 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 55 treesize of output 60 [2018-04-11 11:22:17,553 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:22:17,603 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:22:17,624 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:22:17,625 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:141, output treesize:130 [2018-04-11 11:22:18,075 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 95 treesize of output 91 [2018-04-11 11:22:18,076 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 12 treesize of output 4 [2018-04-11 11:22:18,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:22:18,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:22:18,124 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 95 treesize of output 93 [2018-04-11 11:22:18,125 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:22:18,126 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:22:18,135 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:22:18,170 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 70 treesize of output 68 [2018-04-11 11:22:18,175 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:22:18,175 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:22:18,182 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:22:18,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 11:22:18,216 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:261, output treesize:236 [2018-04-11 11:22:18,494 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:18,495 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 78 treesize of output 68 [2018-04-11 11:22:18,505 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 56 treesize of output 62 [2018-04-11 11:22:18,506 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:22:18,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 11:22:18,603 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:18,607 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 1 case distinctions, treesize of input 103 treesize of output 90 [2018-04-11 11:22:18,617 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 79 treesize of output 83 [2018-04-11 11:22:18,619 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 11:22:18,656 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 11:22:18,781 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 4 case distinctions, treesize of input 99 treesize of output 89 [2018-04-11 11:22:18,784 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 90 treesize of output 75 [2018-04-11 11:22:18,784 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:22:18,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 63 [2018-04-11 11:22:18,829 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 11:22:18,864 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 11:22:18,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 14 dim-0 vars, and 8 xjuncts. [2018-04-11 11:22:18,963 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:281, output treesize:590 [2018-04-11 11:22:23,263 WARN L151 SmtUtils]: Spent 4163ms on a formula simplification. DAG size of input: 178 DAG size of output 70 [2018-04-11 11:22:23,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 76 [2018-04-11 11:22:23,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 11:22:23,520 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:23,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 108 [2018-04-11 11:22:23,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 11:22:23,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 4 xjuncts. [2018-04-11 11:22:23,596 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:162, output treesize:267 [2018-04-11 11:22:23,747 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 80 [2018-04-11 11:22:23,749 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:23,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 23 [2018-04-11 11:22:23,750 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:22:23,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:22:23,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 97 [2018-04-11 11:22:23,878 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:23,878 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:23,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 31 [2018-04-11 11:22:23,879 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:22:23,897 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:22:23,990 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 70 treesize of output 65 [2018-04-11 11:22:23,991 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:23,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 23 [2018-04-11 11:22:23,992 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:22:24,006 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:22:24,087 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 79 treesize of output 74 [2018-04-11 11:22:24,088 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:24,089 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:24,089 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 31 [2018-04-11 11:22:24,089 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 11:22:24,111 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:22:24,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 4 dim-2 vars, End of recursive call: 10 dim-0 vars, and 4 xjuncts. [2018-04-11 11:22:24,177 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 14 variables, input treesize:331, output treesize:315 [2018-04-11 11:22:24,660 WARN L148 SmtUtils]: Spent 199ms on a formula simplification that was a NOOP. DAG size: 133 [2018-04-11 11:22:25,017 WARN L148 SmtUtils]: Spent 224ms on a formula simplification that was a NOOP. DAG size: 133 [2018-04-11 11:22:25,335 WARN L148 SmtUtils]: Spent 166ms on a formula simplification that was a NOOP. DAG size: 144 [2018-04-11 11:22:25,626 WARN L148 SmtUtils]: Spent 141ms on a formula simplification that was a NOOP. DAG size: 144 [2018-04-11 11:22:26,197 WARN L151 SmtUtils]: Spent 340ms on a formula simplification. DAG size of input: 251 DAG size of output 168 [2018-04-11 11:22:26,577 WARN L151 SmtUtils]: Spent 175ms on a formula simplification. DAG size of input: 216 DAG size of output 115 [2018-04-11 11:22:26,591 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 1 case distinctions, treesize of input 130 treesize of output 131 [2018-04-11 11:22:26,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 27 [2018-04-11 11:22:26,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 11:22:26,621 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:22:26,749 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 106 treesize of output 104 [2018-04-11 11:22:26,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 27 [2018-04-11 11:22:26,755 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 11:22:26,775 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:22:26,912 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:26,914 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:26,915 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:26,918 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:26,927 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 4 case distinctions, treesize of input 101 treesize of output 137 [2018-04-11 11:22:26,953 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 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 9 case distinctions, treesize of input 128 treesize of output 195 [2018-04-11 11:22:26,953 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-11 11:22:26,967 INFO L267 ElimStorePlain]: Start of recursive call 7: 56 dim-0 vars, End of recursive call: 56 dim-0 vars, and 44 xjuncts. [2018-04-11 11:22:27,195 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 4 case distinctions, treesize of input 101 treesize of output 120 [2018-04-11 11:22:27,196 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-04-11 11:22:27,304 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-11 11:22:27,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 20 dim-0 vars, 3 dim-2 vars, End of recursive call: 33 dim-0 vars, and 8 xjuncts. [2018-04-11 11:22:27,515 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 23 variables, input treesize:338, output treesize:689 [2018-04-11 11:22:27,908 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 246 DAG size of output 92 [2018-04-11 11:22:27,923 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 96 treesize of output 65 [2018-04-11 11:22:27,924 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:27,925 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:22:27,925 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 40 treesize of output 35 [2018-04-11 11:22:27,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:22:27,934 INFO L477 Elim1Store]: Elim1 did not use 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2018-04-11 11:22:27,934 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:22:27,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:22:27,973 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 1 case distinctions, treesize of input 128 treesize of output 94 [2018-04-11 11:22:27,975 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:27,976 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:27,976 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:22:27,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 79 [2018-04-11 11:22:27,980 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-11 11:22:28,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 40 [2018-04-11 11:22:28,024 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:22:28,025 INFO L477 Elim1Store]: Elim1 did not use 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 40 [2018-04-11 11:22:28,025 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 11:22:28,050 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 82 treesize of output 77 [2018-04-11 11:22:28,050 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 11:22:28,068 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:28,068 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:28,069 INFO L477 Elim1Store]: Elim1 did not use 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 74 [2018-04-11 11:22:28,069 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 11:22:28,083 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:28,083 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:22:28,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 38 [2018-04-11 11:22:28,084 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 11:22:28,093 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:22:28,115 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 100 treesize of output 67 [2018-04-11 11:22:28,117 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:28,117 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:28,117 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 26 treesize of output 24 [2018-04-11 11:22:28,118 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 11:22:28,127 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:22:28,127 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:22:28,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 29 [2018-04-11 11:22:28,128 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 11:22:28,135 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:22:28,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:22:28,148 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 13 variables, input treesize:325, output treesize:10 [2018-04-11 11:22:28,302 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:22:28,319 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:22:28,320 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 34] total 64 [2018-04-11 11:22:28,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-04-11 11:22:28,320 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-04-11 11:22:28,320 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=3886, Unknown=2, NotChecked=0, Total=4160 [2018-04-11 11:22:28,320 INFO L87 Difference]: Start difference. First operand 348 states and 418 transitions. Second operand 65 states. [2018-04-11 11:22:29,814 WARN L151 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 91 DAG size of output 77 [2018-04-11 11:22:30,987 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 90 DAG size of output 62 [2018-04-11 11:22:33,264 WARN L151 SmtUtils]: Spent 163ms on a formula simplification. DAG size of input: 107 DAG size of output 99 Received shutdown request... [2018-04-11 11:22:33,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 11:22:33,349 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 11:22:33,352 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 11:22:33,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 11:22:33 BoogieIcfgContainer [2018-04-11 11:22:33,353 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 11:22:33,353 INFO L168 Benchmark]: Toolchain (without parser) took 179016.47 ms. Allocated memory was 397.9 MB in the beginning and 763.9 MB in the end (delta: 366.0 MB). Free memory was 331.0 MB in the beginning and 380.2 MB in the end (delta: -49.2 MB). Peak memory consumption was 316.8 MB. Max. memory is 5.3 GB. [2018-04-11 11:22:33,354 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 397.9 MB. Free memory is still 356.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 11:22:33,354 INFO L168 Benchmark]: CACSL2BoogieTranslator took 259.77 ms. Allocated memory is still 397.9 MB. Free memory was 331.0 MB in the beginning and 304.6 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 5.3 GB. [2018-04-11 11:22:33,354 INFO L168 Benchmark]: Boogie Preprocessor took 48.19 ms. Allocated memory is still 397.9 MB. Free memory was 304.6 MB in the beginning and 301.9 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:22:33,355 INFO L168 Benchmark]: RCFGBuilder took 547.17 ms. Allocated memory was 397.9 MB in the beginning and 605.0 MB in the end (delta: 207.1 MB). Free memory was 301.9 MB in the beginning and 517.7 MB in the end (delta: -215.8 MB). Peak memory consumption was 25.6 MB. Max. memory is 5.3 GB. [2018-04-11 11:22:33,355 INFO L168 Benchmark]: TraceAbstraction took 178158.60 ms. Allocated memory was 605.0 MB in the beginning and 763.9 MB in the end (delta: 158.9 MB). Free memory was 517.7 MB in the beginning and 380.2 MB in the end (delta: 137.5 MB). Peak memory consumption was 296.4 MB. Max. memory is 5.3 GB. [2018-04-11 11:22:33,356 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.17 ms. Allocated memory is still 397.9 MB. Free memory is still 356.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 259.77 ms. Allocated memory is still 397.9 MB. Free memory was 331.0 MB in the beginning and 304.6 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 48.19 ms. Allocated memory is still 397.9 MB. Free memory was 304.6 MB in the beginning and 301.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 547.17 ms. Allocated memory was 397.9 MB in the beginning and 605.0 MB in the end (delta: 207.1 MB). Free memory was 301.9 MB in the beginning and 517.7 MB in the end (delta: -215.8 MB). Peak memory consumption was 25.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 178158.60 ms. Allocated memory was 605.0 MB in the beginning and 763.9 MB in the end (delta: 158.9 MB). Free memory was 517.7 MB in the beginning and 380.2 MB in the end (delta: 137.5 MB). Peak memory consumption was 296.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 680]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 662]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 686]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 686). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 659]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 668]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 668). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 628]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 628). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 674]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 674). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 690]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 690). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 691]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 691). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 650]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 677]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 644]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 667]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 686]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 686). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 653]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 671]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 671). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 687]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 687). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 691]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 691). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 672]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 671]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 671). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 680]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 664]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 664). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 667]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 667]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 691]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 691). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 690]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 690). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 660]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 669]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 677]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 668]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 668). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 653]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 684]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 684). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 672]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 659]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 692]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 692). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 687]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 687). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 662]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 691]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 691). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 692]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 692). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 684]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 684). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 644]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 660]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 664]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 664). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 667]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 674]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 674). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 650]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 669]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 25 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 161 locations, 67 error locations. TIMEOUT Result, 178.1s OverallTime, 51 OverallIterations, 3 TraceHistogramMax, 109.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6501 SDtfs, 31460 SDslu, 48432 SDs, 0 SdLazy, 51422 SolverSat, 4405 SolverUnsat, 69 SolverUnknown, 0 SolverNotchecked, 54.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3622 GetRequests, 1555 SyntacticMatches, 128 SemanticMatches, 1938 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 49691 ImplicationChecksByTransitivity, 85.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=621occurred in iteration=43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 50 MinimizatonAttempts, 4193 StatesRemovedByMinimization, 43 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 66.3s InterpolantComputationTime, 4740 NumberOfCodeBlocks, 4740 NumberOfCodeBlocksAsserted, 75 NumberOfCheckSat, 4665 ConstructedInterpolants, 563 QuantifiedInterpolants, 9574388 SizeOfPredicates, 440 NumberOfNonLiveVariables, 7268 ConjunctsInSsa, 1188 ConjunctsInUnsatCore, 75 InterpolantComputations, 29 PerfectInterpolantSequences, 1027/1439 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/test-0513_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_11-22-33-361.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0513_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_11-22-33-361.csv Completed graceful shutdown