java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/list-ext-properties/list-ext_false-unreach-call_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 11:10:14,959 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 11:10:14,961 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 11:10:14,974 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 11:10:14,974 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 11:10:14,975 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 11:10:14,976 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 11:10:14,977 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 11:10:14,979 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 11:10:14,980 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 11:10:14,980 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 11:10:14,980 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 11:10:14,981 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 11:10:14,982 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 11:10:14,983 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 11:10:14,984 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 11:10:14,985 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 11:10:14,987 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 11:10:14,988 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 11:10:14,988 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 11:10:14,990 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 11:10:14,990 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 11:10:14,990 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 11:10:14,991 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 11:10:14,992 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 11:10:14,992 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 11:10:14,993 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 11:10:14,993 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 11:10:14,994 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 11:10:14,994 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 11:10:14,994 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 11:10:14,995 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:10:15,015 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 11:10:15,016 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 11:10:15,016 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 11:10:15,017 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 11:10:15,017 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 11:10:15,017 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 11:10:15,017 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 11:10:15,017 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 11:10:15,018 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 11:10:15,018 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 11:10:15,018 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 11:10:15,018 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 11:10:15,018 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 11:10:15,018 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 11:10:15,018 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 11:10:15,019 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 11:10:15,019 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 11:10:15,019 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 11:10:15,019 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 11:10:15,019 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 11:10:15,019 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 11:10:15,020 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 11:10:15,020 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 11:10:15,020 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:10:15,049 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 11:10:15,058 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 11:10:15,061 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 11:10:15,063 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 11:10:15,063 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 11:10:15,064 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,353 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG93cc69910 [2018-04-11 11:10:15,506 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 11:10:15,506 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 11:10:15,507 INFO L168 CDTParser]: Scanning list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,515 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 11:10:15,516 INFO L215 ultiparseSymbolTable]: [2018-04-11 11:10:15,516 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 11:10:15,516 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__exit ('exit') in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,516 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,516 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 11:10:15,516 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__fd_mask in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,516 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____loff_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,516 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____WAIT_STATUS in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,516 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____sigset_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,517 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____ino_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,517 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____pid_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,517 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__int64_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,517 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__suseconds_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,517 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____ino64_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,517 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____quad_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,517 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__u_long in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,517 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__pthread_barrier_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,517 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____off_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,517 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____uint8_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,518 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____fsid_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,518 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____u_quad_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,518 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____key_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,518 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__ushort in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,518 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__pthread_condattr_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,518 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__u_int8_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,518 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__loff_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,518 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__pthread_rwlockattr_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,518 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____uint16_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,518 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__clock_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,519 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____daddr_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,519 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____clock_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,519 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____gid_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,519 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__clockid_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,519 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__fsid_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,519 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__daddr_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,519 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____fd_mask in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,519 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__pthread_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,519 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__pthread_once_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,519 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____fsblkcnt64_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,520 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__pthread_attr_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,520 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____pthread_list_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,520 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____u_char in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,520 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____caddr_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,520 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__u_short in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,520 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____off64_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,520 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__ulong in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,520 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__gid_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,520 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____uint32_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,521 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__lldiv_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,521 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__wchar_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,521 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____socklen_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,521 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__uid_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,521 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__int16_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,521 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__List in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,521 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____mode_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,521 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__blksize_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,521 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__u_char in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,522 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__pthread_spinlock_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,522 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__div_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,522 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__blkcnt_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,522 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____u_long in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,522 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__quad_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,522 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____clockid_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,522 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____int16_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,522 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__off_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,523 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__u_int16_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,523 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____intptr_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,523 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__pthread_cond_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,523 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__size_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,523 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____fsfilcnt_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,523 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__key_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,523 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__pthread_mutex_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,523 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__u_int in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,523 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____rlim_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,523 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____timer_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,524 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__caddr_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,524 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____u_short in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,524 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__pthread_mutexattr_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,524 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__mode_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,524 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__int8_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,524 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__fsfilcnt_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,524 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____time_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,524 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____suseconds_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,524 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____blkcnt64_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,525 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__u_int64_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,525 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__fd_set in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,525 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__pid_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,525 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__fsblkcnt_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,525 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__int32_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,525 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____ssize_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,525 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____nlink_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,525 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____qaddr_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,525 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____rlim64_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,525 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____int8_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,525 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____int32_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,526 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____dev_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,526 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____blksize_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,526 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__timer_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,526 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____id_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,526 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__u_int32_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,526 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____uint64_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,526 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____sig_atomic_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,526 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__pthread_barrierattr_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,526 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__register_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,526 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__sigset_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,526 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____int64_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,526 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____swblk_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,526 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____uid_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,526 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__nlink_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,526 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__u_quad_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,527 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__uint in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,527 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__ssize_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,527 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____useconds_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,527 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__id_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,527 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____fsfilcnt64_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,527 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__ldiv_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,527 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____u_int in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,527 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__ino_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,527 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__dev_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,527 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__pthread_key_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,527 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____fsblkcnt_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,527 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__time_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,527 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__pthread_rwlock_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,527 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i____blkcnt_t in list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:15,539 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG93cc69910 [2018-04-11 11:10:15,543 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 11:10:15,544 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 11:10:15,544 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 11:10:15,544 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 11:10:15,548 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 11:10:15,548 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 11:10:15" (1/1) ... [2018-04-11 11:10:15,550 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a826f15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:10:15, skipping insertion in model container [2018-04-11 11:10:15,550 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 11:10:15" (1/1) ... [2018-04-11 11:10:15,561 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 11:10:15,585 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 11:10:15,724 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 11:10:15,764 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 11:10:15,770 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 113 non ball SCCs. Number of states in SCCs 113. [2018-04-11 11:10:15,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:10:15 WrapperNode [2018-04-11 11:10:15,813 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 11:10:15,814 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 11:10:15,814 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 11:10:15,814 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 11:10:15,824 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:10:15" (1/1) ... [2018-04-11 11:10:15,824 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:10:15" (1/1) ... [2018-04-11 11:10:15,835 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:10:15" (1/1) ... [2018-04-11 11:10:15,835 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:10:15" (1/1) ... [2018-04-11 11:10:15,846 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:10:15" (1/1) ... [2018-04-11 11:10:15,851 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:10:15" (1/1) ... [2018-04-11 11:10:15,853 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:10:15" (1/1) ... [2018-04-11 11:10:15,857 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 11:10:15,858 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 11:10:15,858 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 11:10:15,858 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 11:10:15,859 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:10:15" (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:10:15,947 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 11:10:15,947 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 11:10:15,947 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__exit [2018-04-11 11:10:15,947 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 11:10:15,947 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-11 11:10:15,947 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 11:10:15,947 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 11:10:15,948 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 11:10:15,948 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 11:10:15,948 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 11:10:15,948 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 11:10:15,948 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 11:10:15,948 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 11:10:15,948 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 11:10:15,948 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 11:10:15,948 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 11:10:15,948 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 11:10:15,949 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 11:10:15,949 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 11:10:15,949 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 11:10:15,949 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 11:10:15,949 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 11:10:15,949 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 11:10:15,949 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 11:10:15,949 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 11:10:15,949 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 11:10:15,949 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 11:10:15,950 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 11:10:15,950 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 11:10:15,950 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 11:10:15,950 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 11:10:15,950 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 11:10:15,950 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 11:10:15,950 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 11:10:15,950 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 11:10:15,950 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 11:10:15,950 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 11:10:15,951 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 11:10:15,951 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 11:10:15,951 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 11:10:15,951 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 11:10:15,951 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 11:10:15,951 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 11:10:15,951 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 11:10:15,951 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 11:10:15,951 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 11:10:15,952 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 11:10:15,952 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 11:10:15,952 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 11:10:15,952 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 11:10:15,952 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 11:10:15,952 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 11:10:15,952 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 11:10:15,952 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 11:10:15,952 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 11:10:15,953 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 11:10:15,953 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 11:10:15,953 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 11:10:15,953 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 11:10:15,953 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 11:10:15,953 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 11:10:15,953 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 11:10:15,953 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 11:10:15,953 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 11:10:15,953 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 11:10:15,954 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 11:10:15,954 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 11:10:15,954 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_flist_ext_false_unreach_call_false_valid_deref_i__exit [2018-04-11 11:10:15,954 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 11:10:15,954 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 11:10:15,954 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-11 11:10:15,954 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 11:10:15,954 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 11:10:15,954 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 11:10:15,954 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 11:10:15,954 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 11:10:15,954 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 11:10:15,954 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 11:10:15,954 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 11:10:15,954 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 11:10:15,955 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 11:10:15,955 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 11:10:15,955 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 11:10:15,955 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 11:10:15,955 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 11:10:15,955 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 11:10:15,955 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 11:10:15,955 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 11:10:15,955 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 11:10:15,955 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 11:10:15,955 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 11:10:15,955 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 11:10:15,955 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 11:10:15,955 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 11:10:15,955 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 11:10:15,955 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 11:10:15,955 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 11:10:15,956 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 11:10:15,956 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 11:10:15,956 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 11:10:15,956 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 11:10:15,956 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 11:10:15,956 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 11:10:15,956 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 11:10:15,956 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 11:10:15,956 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 11:10:15,956 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 11:10:15,957 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 11:10:15,957 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 11:10:15,957 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 11:10:15,957 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-11 11:10:15,957 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-11 11:10:15,957 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 11:10:15,957 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 11:10:15,957 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 11:10:15,957 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 11:10:15,957 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 11:10:16,306 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 11:10:16,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 11:10:16 BoogieIcfgContainer [2018-04-11 11:10:16,307 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 11:10:16,308 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 11:10:16,308 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 11:10:16,310 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 11:10:16,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 11:10:15" (1/3) ... [2018-04-11 11:10:16,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39250443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 11:10:16, skipping insertion in model container [2018-04-11 11:10:16,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:10:15" (2/3) ... [2018-04-11 11:10:16,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39250443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 11:10:16, skipping insertion in model container [2018-04-11 11:10:16,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 11:10:16" (3/3) ... [2018-04-11 11:10:16,312 INFO L107 eAbstractionObserver]: Analyzing ICFG list-ext_false-unreach-call_false-valid-deref.i [2018-04-11 11:10:16,318 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 11:10:16,324 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 33 error locations. [2018-04-11 11:10:16,354 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 11:10:16,354 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 11:10:16,354 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 11:10:16,354 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 11:10:16,354 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 11:10:16,354 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 11:10:16,354 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 11:10:16,355 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 11:10:16,355 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 11:10:16,355 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 11:10:16,363 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2018-04-11 11:10:16,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-11 11:10:16,369 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:10:16,369 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:10:16,369 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:10:16,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1444763761, now seen corresponding path program 1 times [2018-04-11 11:10:16,373 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:10:16,373 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:10:16,403 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:16,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:10:16,404 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:16,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:10:16,431 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:10:16,452 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:10:16,453 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:10:16,453 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 11:10:16,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-04-11 11:10:16,463 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-04-11 11:10:16,463 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-11 11:10:16,465 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2018-04-11 11:10:16,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:10:16,481 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2018-04-11 11:10:16,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-04-11 11:10:16,482 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-04-11 11:10:16,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:10:16,487 INFO L225 Difference]: With dead ends: 103 [2018-04-11 11:10:16,488 INFO L226 Difference]: Without dead ends: 94 [2018-04-11 11:10:16,491 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:10:16,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-04-11 11:10:16,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-04-11 11:10:16,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-04-11 11:10:16,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2018-04-11 11:10:16,516 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 13 [2018-04-11 11:10:16,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:10:16,517 INFO L459 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2018-04-11 11:10:16,517 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-04-11 11:10:16,517 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2018-04-11 11:10:16,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-11 11:10:16,517 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:10:16,517 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:10:16,518 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:10:16,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1109986290, now seen corresponding path program 1 times [2018-04-11 11:10:16,518 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:10:16,518 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:10:16,519 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:16,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:10:16,519 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:10:16,538 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:10:16,644 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:10:16,644 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:10:16,645 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 11:10:16,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 11:10:16,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 11:10:16,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 11:10:16,647 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand 5 states. [2018-04-11 11:10:16,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:10:16,841 INFO L93 Difference]: Finished difference Result 162 states and 174 transitions. [2018-04-11 11:10:16,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 11:10:16,842 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-04-11 11:10:16,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:10:16,844 INFO L225 Difference]: With dead ends: 162 [2018-04-11 11:10:16,844 INFO L226 Difference]: Without dead ends: 162 [2018-04-11 11:10:16,845 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 11:10:16,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-04-11 11:10:16,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 131. [2018-04-11 11:10:16,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-04-11 11:10:16,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 158 transitions. [2018-04-11 11:10:16,862 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 158 transitions. Word has length 15 [2018-04-11 11:10:16,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:10:16,863 INFO L459 AbstractCegarLoop]: Abstraction has 131 states and 158 transitions. [2018-04-11 11:10:16,863 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 11:10:16,863 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 158 transitions. [2018-04-11 11:10:16,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-11 11:10:16,863 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:10:16,863 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:10:16,863 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:10:16,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1109986289, now seen corresponding path program 1 times [2018-04-11 11:10:16,864 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:10:16,864 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:10:16,864 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:16,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:10:16,865 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:16,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:10:16,883 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:10:16,924 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:10:16,924 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:10:16,924 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 11:10:16,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 11:10:16,925 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 11:10:16,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 11:10:16,925 INFO L87 Difference]: Start difference. First operand 131 states and 158 transitions. Second operand 5 states. [2018-04-11 11:10:17,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:10:17,026 INFO L93 Difference]: Finished difference Result 128 states and 141 transitions. [2018-04-11 11:10:17,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 11:10:17,026 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-04-11 11:10:17,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:10:17,027 INFO L225 Difference]: With dead ends: 128 [2018-04-11 11:10:17,027 INFO L226 Difference]: Without dead ends: 128 [2018-04-11 11:10:17,027 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 11:10:17,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-04-11 11:10:17,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 123. [2018-04-11 11:10:17,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-11 11:10:17,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 137 transitions. [2018-04-11 11:10:17,034 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 137 transitions. Word has length 15 [2018-04-11 11:10:17,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:10:17,035 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 137 transitions. [2018-04-11 11:10:17,035 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 11:10:17,035 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 137 transitions. [2018-04-11 11:10:17,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 11:10:17,036 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:10:17,036 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] [2018-04-11 11:10:17,036 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:10:17,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1258743104, now seen corresponding path program 1 times [2018-04-11 11:10:17,037 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:10:17,037 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:10:17,037 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:17,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:10:17,038 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:17,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:10:17,054 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:10:17,127 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:10:17,127 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:10:17,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 11:10:17,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 11:10:17,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 11:10:17,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-11 11:10:17,135 INFO L87 Difference]: Start difference. First operand 123 states and 137 transitions. Second operand 7 states. [2018-04-11 11:10:17,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:10:17,440 INFO L93 Difference]: Finished difference Result 255 states and 284 transitions. [2018-04-11 11:10:17,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 11:10:17,441 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-04-11 11:10:17,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:10:17,443 INFO L225 Difference]: With dead ends: 255 [2018-04-11 11:10:17,443 INFO L226 Difference]: Without dead ends: 255 [2018-04-11 11:10:17,443 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-04-11 11:10:17,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-04-11 11:10:17,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 121. [2018-04-11 11:10:17,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-04-11 11:10:17,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 139 transitions. [2018-04-11 11:10:17,451 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 139 transitions. Word has length 26 [2018-04-11 11:10:17,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:10:17,451 INFO L459 AbstractCegarLoop]: Abstraction has 121 states and 139 transitions. [2018-04-11 11:10:17,452 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 11:10:17,452 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 139 transitions. [2018-04-11 11:10:17,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 11:10:17,452 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:10:17,453 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] [2018-04-11 11:10:17,453 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:10:17,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1258743103, now seen corresponding path program 1 times [2018-04-11 11:10:17,453 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:10:17,453 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:10:17,454 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:17,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:10:17,454 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:17,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:10:17,466 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:10:17,507 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:10:17,507 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:10:17,508 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 11:10:17,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 11:10:17,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 11:10:17,508 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-11 11:10:17,508 INFO L87 Difference]: Start difference. First operand 121 states and 139 transitions. Second operand 7 states. [2018-04-11 11:10:17,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:10:17,741 INFO L93 Difference]: Finished difference Result 231 states and 258 transitions. [2018-04-11 11:10:17,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 11:10:17,742 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-04-11 11:10:17,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:10:17,743 INFO L225 Difference]: With dead ends: 231 [2018-04-11 11:10:17,743 INFO L226 Difference]: Without dead ends: 231 [2018-04-11 11:10:17,743 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-04-11 11:10:17,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-04-11 11:10:17,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 109. [2018-04-11 11:10:17,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-04-11 11:10:17,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 121 transitions. [2018-04-11 11:10:17,749 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 121 transitions. Word has length 26 [2018-04-11 11:10:17,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:10:17,750 INFO L459 AbstractCegarLoop]: Abstraction has 109 states and 121 transitions. [2018-04-11 11:10:17,750 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 11:10:17,750 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 121 transitions. [2018-04-11 11:10:17,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-11 11:10:17,750 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:10:17,751 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:10:17,751 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:10:17,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1097115241, now seen corresponding path program 1 times [2018-04-11 11:10:17,751 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:10:17,751 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:10:17,752 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:17,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:10:17,752 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:17,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:10:17,758 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:10:17,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:10:17,788 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:10:17,788 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 11:10:17,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 11:10:17,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 11:10:17,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 11:10:17,789 INFO L87 Difference]: Start difference. First operand 109 states and 121 transitions. Second operand 6 states. [2018-04-11 11:10:17,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:10:17,883 INFO L93 Difference]: Finished difference Result 203 states and 220 transitions. [2018-04-11 11:10:17,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 11:10:17,884 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-04-11 11:10:17,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:10:17,885 INFO L225 Difference]: With dead ends: 203 [2018-04-11 11:10:17,885 INFO L226 Difference]: Without dead ends: 203 [2018-04-11 11:10:17,885 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-04-11 11:10:17,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-04-11 11:10:17,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 122. [2018-04-11 11:10:17,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-04-11 11:10:17,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 138 transitions. [2018-04-11 11:10:17,890 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 138 transitions. Word has length 27 [2018-04-11 11:10:17,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:10:17,890 INFO L459 AbstractCegarLoop]: Abstraction has 122 states and 138 transitions. [2018-04-11 11:10:17,891 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 11:10:17,891 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 138 transitions. [2018-04-11 11:10:17,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 11:10:17,891 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:10:17,891 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:10:17,891 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:10:17,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1003717138, now seen corresponding path program 1 times [2018-04-11 11:10:17,891 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:10:17,891 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:10:17,892 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:17,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:10:17,892 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:17,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:10:17,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:10:17,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:10:17,932 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:10:17,932 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 11:10:17,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 11:10:17,932 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 11:10:17,932 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 11:10:17,932 INFO L87 Difference]: Start difference. First operand 122 states and 138 transitions. Second operand 6 states. [2018-04-11 11:10:18,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:10:18,047 INFO L93 Difference]: Finished difference Result 189 states and 204 transitions. [2018-04-11 11:10:18,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 11:10:18,048 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-04-11 11:10:18,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:10:18,049 INFO L225 Difference]: With dead ends: 189 [2018-04-11 11:10:18,049 INFO L226 Difference]: Without dead ends: 189 [2018-04-11 11:10:18,049 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-04-11 11:10:18,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-04-11 11:10:18,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 125. [2018-04-11 11:10:18,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-04-11 11:10:18,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 141 transitions. [2018-04-11 11:10:18,053 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 141 transitions. Word has length 30 [2018-04-11 11:10:18,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:10:18,053 INFO L459 AbstractCegarLoop]: Abstraction has 125 states and 141 transitions. [2018-04-11 11:10:18,053 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 11:10:18,053 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 141 transitions. [2018-04-11 11:10:18,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 11:10:18,054 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:10:18,054 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] [2018-04-11 11:10:18,055 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:10:18,055 INFO L82 PathProgramCache]: Analyzing trace with hash -709458625, now seen corresponding path program 1 times [2018-04-11 11:10:18,055 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:10:18,055 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:10:18,056 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:18,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:10:18,056 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:18,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:10:18,066 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:10:18,099 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:10:18,099 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:10:18,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 11:10:18,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 11:10:18,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 11:10:18,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-11 11:10:18,100 INFO L87 Difference]: Start difference. First operand 125 states and 141 transitions. Second operand 7 states. [2018-04-11 11:10:18,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:10:18,244 INFO L93 Difference]: Finished difference Result 168 states and 188 transitions. [2018-04-11 11:10:18,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 11:10:18,244 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-04-11 11:10:18,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:10:18,245 INFO L225 Difference]: With dead ends: 168 [2018-04-11 11:10:18,245 INFO L226 Difference]: Without dead ends: 168 [2018-04-11 11:10:18,245 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-04-11 11:10:18,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-04-11 11:10:18,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 123. [2018-04-11 11:10:18,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-11 11:10:18,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 139 transitions. [2018-04-11 11:10:18,247 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 139 transitions. Word has length 30 [2018-04-11 11:10:18,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:10:18,248 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 139 transitions. [2018-04-11 11:10:18,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 11:10:18,248 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 139 transitions. [2018-04-11 11:10:18,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 11:10:18,248 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:10:18,248 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] [2018-04-11 11:10:18,248 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:10:18,248 INFO L82 PathProgramCache]: Analyzing trace with hash -709458624, now seen corresponding path program 1 times [2018-04-11 11:10:18,248 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:10:18,249 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:10:18,249 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:18,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:10:18,249 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:18,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:10:18,259 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:10:18,341 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:10:18,341 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:10:18,341 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 11:10:18,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 11:10:18,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 11:10:18,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-11 11:10:18,342 INFO L87 Difference]: Start difference. First operand 123 states and 139 transitions. Second operand 7 states. [2018-04-11 11:10:18,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:10:18,623 INFO L93 Difference]: Finished difference Result 184 states and 205 transitions. [2018-04-11 11:10:18,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 11:10:18,623 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-04-11 11:10:18,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:10:18,624 INFO L225 Difference]: With dead ends: 184 [2018-04-11 11:10:18,625 INFO L226 Difference]: Without dead ends: 184 [2018-04-11 11:10:18,625 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-04-11 11:10:18,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-04-11 11:10:18,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 108. [2018-04-11 11:10:18,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-04-11 11:10:18,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 122 transitions. [2018-04-11 11:10:18,628 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 122 transitions. Word has length 30 [2018-04-11 11:10:18,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:10:18,628 INFO L459 AbstractCegarLoop]: Abstraction has 108 states and 122 transitions. [2018-04-11 11:10:18,628 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 11:10:18,628 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 122 transitions. [2018-04-11 11:10:18,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-11 11:10:18,629 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:10:18,630 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:10:18,630 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:10:18,630 INFO L82 PathProgramCache]: Analyzing trace with hash 2133942451, now seen corresponding path program 1 times [2018-04-11 11:10:18,630 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:10:18,630 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:10:18,631 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:18,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:10:18,631 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:18,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:10:18,641 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:10:18,659 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:10:18,660 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:10:18,660 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 11:10:18,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 11:10:18,660 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 11:10:18,660 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 11:10:18,660 INFO L87 Difference]: Start difference. First operand 108 states and 122 transitions. Second operand 3 states. [2018-04-11 11:10:18,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:10:18,672 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2018-04-11 11:10:18,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 11:10:18,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-04-11 11:10:18,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:10:18,673 INFO L225 Difference]: With dead ends: 109 [2018-04-11 11:10:18,673 INFO L226 Difference]: Without dead ends: 99 [2018-04-11 11:10:18,673 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:10:18,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-04-11 11:10:18,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-04-11 11:10:18,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-04-11 11:10:18,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2018-04-11 11:10:18,676 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 37 [2018-04-11 11:10:18,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:10:18,676 INFO L459 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2018-04-11 11:10:18,676 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 11:10:18,676 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2018-04-11 11:10:18,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 11:10:18,677 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:10:18,677 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] [2018-04-11 11:10:18,677 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:10:18,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1393166961, now seen corresponding path program 1 times [2018-04-11 11:10:18,678 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:10:18,678 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:10:18,678 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:18,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:10:18,678 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:18,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:10:18,697 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:10:18,826 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:10:18,826 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:10:18,826 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:10:18,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:10:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:10:18,868 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:10:18,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:10:18,900 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:18,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:18,902 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 11:10:18,966 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:10:18,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:10:18,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:18,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:18,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:18,977 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-04-11 11:10:18,990 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:18,990 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:18,991 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:10:18,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:18,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:18,994 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2018-04-11 11:10:19,023 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:10:19,025 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:10:19,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:19,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:19,030 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:10:19,030 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-04-11 11:10:19,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-04-11 11:10:19,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-04-11 11:10:19,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:19,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:19,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:19,050 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:12 [2018-04-11 11:10:19,085 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:10:19,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:10:19,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:19,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:19,093 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:10:19,094 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-04-11 11:10:19,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-04-11 11:10:19,144 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:10:19,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:19,148 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:10:19,148 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:19,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:19,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:19,151 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-04-11 11:10:19,157 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:10:19,181 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:10:19,182 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 21 [2018-04-11 11:10:19,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 11:10:19,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 11:10:19,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2018-04-11 11:10:19,182 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand 21 states. [2018-04-11 11:10:19,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:10:19,691 INFO L93 Difference]: Finished difference Result 203 states and 219 transitions. [2018-04-11 11:10:19,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 11:10:19,691 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 38 [2018-04-11 11:10:19,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:10:19,692 INFO L225 Difference]: With dead ends: 203 [2018-04-11 11:10:19,692 INFO L226 Difference]: Without dead ends: 203 [2018-04-11 11:10:19,693 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=292, Invalid=1114, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 11:10:19,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-04-11 11:10:19,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 115. [2018-04-11 11:10:19,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-04-11 11:10:19,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2018-04-11 11:10:19,696 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 38 [2018-04-11 11:10:19,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:10:19,696 INFO L459 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2018-04-11 11:10:19,696 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 11:10:19,696 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2018-04-11 11:10:19,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 11:10:19,697 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:10:19,697 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] [2018-04-11 11:10:19,698 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:10:19,698 INFO L82 PathProgramCache]: Analyzing trace with hash 543665637, now seen corresponding path program 1 times [2018-04-11 11:10:19,698 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:10:19,698 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:10:19,699 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:19,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:10:19,699 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:19,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:10:19,712 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:10:19,824 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:10:19,824 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:10:19,824 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:10:19,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:10:19,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:10:19,857 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:10:19,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:10:19,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:19,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:19,925 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-04-11 11:10:19,968 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:10:19,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 11:10:19,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:19,972 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:19,974 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:10:19,975 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-11 11:10:20,007 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 21 treesize of output 17 [2018-04-11 11:10:20,009 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:10:20,009 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:10:20,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:20,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:20,014 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:10:20,014 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:5 [2018-04-11 11:10:20,022 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:10:20,039 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:10:20,039 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 17 [2018-04-11 11:10:20,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 11:10:20,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 11:10:20,040 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2018-04-11 11:10:20,040 INFO L87 Difference]: Start difference. First operand 115 states and 129 transitions. Second operand 18 states. [2018-04-11 11:10:20,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:10:20,554 INFO L93 Difference]: Finished difference Result 200 states and 220 transitions. [2018-04-11 11:10:20,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 11:10:20,554 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2018-04-11 11:10:20,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:10:20,555 INFO L225 Difference]: With dead ends: 200 [2018-04-11 11:10:20,555 INFO L226 Difference]: Without dead ends: 200 [2018-04-11 11:10:20,555 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=261, Invalid=731, Unknown=0, NotChecked=0, Total=992 [2018-04-11 11:10:20,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-04-11 11:10:20,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 139. [2018-04-11 11:10:20,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-04-11 11:10:20,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 159 transitions. [2018-04-11 11:10:20,558 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 159 transitions. Word has length 38 [2018-04-11 11:10:20,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:10:20,558 INFO L459 AbstractCegarLoop]: Abstraction has 139 states and 159 transitions. [2018-04-11 11:10:20,558 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 11:10:20,558 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 159 transitions. [2018-04-11 11:10:20,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 11:10:20,559 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:10:20,559 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] [2018-04-11 11:10:20,559 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:10:20,559 INFO L82 PathProgramCache]: Analyzing trace with hash 543665638, now seen corresponding path program 1 times [2018-04-11 11:10:20,559 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:10:20,559 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:10:20,560 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:20,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:10:20,560 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:20,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:10:20,572 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:10:20,710 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:10:20,710 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:10:20,710 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:10:20,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:10:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:10:20,733 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:10:20,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:10:20,756 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:20,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:20,760 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-04-11 11:10:20,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:10:20,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 11:10:20,778 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:20,779 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:20,787 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:10:20,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:10:20,789 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:20,795 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:20,799 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:10:20,800 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:20 [2018-04-11 11:10:20,829 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 13 [2018-04-11 11:10:20,831 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:10:20,831 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:20,833 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:20,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 11:10:20,842 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:10:20,842 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:20,844 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:20,846 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:10:20,846 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2018-04-11 11:10:20,858 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:10:20,894 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:10:20,895 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 15 [2018-04-11 11:10:20,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 11:10:20,895 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 11:10:20,895 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-04-11 11:10:20,895 INFO L87 Difference]: Start difference. First operand 139 states and 159 transitions. Second operand 16 states. [2018-04-11 11:10:21,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:10:21,354 INFO L93 Difference]: Finished difference Result 232 states and 255 transitions. [2018-04-11 11:10:21,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 11:10:21,354 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 38 [2018-04-11 11:10:21,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:10:21,355 INFO L225 Difference]: With dead ends: 232 [2018-04-11 11:10:21,355 INFO L226 Difference]: Without dead ends: 232 [2018-04-11 11:10:21,355 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 27 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=477, Unknown=0, NotChecked=0, Total=650 [2018-04-11 11:10:21,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-04-11 11:10:21,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 144. [2018-04-11 11:10:21,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-04-11 11:10:21,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 165 transitions. [2018-04-11 11:10:21,359 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 165 transitions. Word has length 38 [2018-04-11 11:10:21,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:10:21,359 INFO L459 AbstractCegarLoop]: Abstraction has 144 states and 165 transitions. [2018-04-11 11:10:21,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 11:10:21,359 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 165 transitions. [2018-04-11 11:10:21,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-11 11:10:21,360 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:10:21,360 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] [2018-04-11 11:10:21,360 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:10:21,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1105214694, now seen corresponding path program 1 times [2018-04-11 11:10:21,360 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:10:21,360 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:10:21,361 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:21,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:10:21,361 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:21,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:10:21,368 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:10:21,464 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:10:21,465 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:10:21,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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:10:21,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:10:21,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:10:21,499 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:10:21,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 11:10:21,539 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:21,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:21,545 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-04-11 11:10:21,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 11:10:21,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 11:10:21,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:21,590 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:21,595 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:10:21,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-11 11:10:21,639 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 21 treesize of output 17 [2018-04-11 11:10:21,641 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:10:21,642 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:10:21,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:21,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:21,651 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:10:21,652 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:5 [2018-04-11 11:10:21,664 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:10:21,694 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:10:21,694 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 17 [2018-04-11 11:10:21,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 11:10:21,695 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 11:10:21,695 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2018-04-11 11:10:21,695 INFO L87 Difference]: Start difference. First operand 144 states and 165 transitions. Second operand 18 states. [2018-04-11 11:10:22,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:10:22,125 INFO L93 Difference]: Finished difference Result 193 states and 214 transitions. [2018-04-11 11:10:22,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 11:10:22,125 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 41 [2018-04-11 11:10:22,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:10:22,126 INFO L225 Difference]: With dead ends: 193 [2018-04-11 11:10:22,126 INFO L226 Difference]: Without dead ends: 193 [2018-04-11 11:10:22,126 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=261, Invalid=731, Unknown=0, NotChecked=0, Total=992 [2018-04-11 11:10:22,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-04-11 11:10:22,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 149. [2018-04-11 11:10:22,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-04-11 11:10:22,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 170 transitions. [2018-04-11 11:10:22,128 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 170 transitions. Word has length 41 [2018-04-11 11:10:22,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:10:22,128 INFO L459 AbstractCegarLoop]: Abstraction has 149 states and 170 transitions. [2018-04-11 11:10:22,128 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 11:10:22,128 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 170 transitions. [2018-04-11 11:10:22,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-11 11:10:22,129 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:10:22,129 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] [2018-04-11 11:10:22,129 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:10:22,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1105214693, now seen corresponding path program 1 times [2018-04-11 11:10:22,129 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:10:22,129 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:10:22,130 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:22,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:10:22,130 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:22,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:10:22,141 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:10:22,267 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:10:22,267 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:10:22,267 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:10:22,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:10:22,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:10:22,286 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:10:22,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 11:10:22,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:22,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:22,312 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-04-11 11:10:22,320 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:10:22,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 11:10:22,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:22,322 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:22,327 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:10:22,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:10:22,328 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:22,329 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:22,332 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:10:22,332 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:20 [2018-04-11 11:10:22,353 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 13 [2018-04-11 11:10:22,354 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:10:22,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:22,355 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:22,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 11:10:22,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 11 treesize of output 3 [2018-04-11 11:10:22,360 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:22,361 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:22,363 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:10:22,363 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2018-04-11 11:10:22,371 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:10:22,391 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:10:22,391 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 15 [2018-04-11 11:10:22,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 11:10:22,391 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 11:10:22,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-04-11 11:10:22,391 INFO L87 Difference]: Start difference. First operand 149 states and 170 transitions. Second operand 16 states. [2018-04-11 11:10:22,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:10:22,729 INFO L93 Difference]: Finished difference Result 221 states and 243 transitions. [2018-04-11 11:10:22,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 11:10:22,729 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-04-11 11:10:22,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:10:22,730 INFO L225 Difference]: With dead ends: 221 [2018-04-11 11:10:22,730 INFO L226 Difference]: Without dead ends: 221 [2018-04-11 11:10:22,730 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 32 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=477, Unknown=0, NotChecked=0, Total=650 [2018-04-11 11:10:22,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-04-11 11:10:22,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 149. [2018-04-11 11:10:22,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-04-11 11:10:22,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 170 transitions. [2018-04-11 11:10:22,733 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 170 transitions. Word has length 41 [2018-04-11 11:10:22,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:10:22,733 INFO L459 AbstractCegarLoop]: Abstraction has 149 states and 170 transitions. [2018-04-11 11:10:22,734 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 11:10:22,734 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 170 transitions. [2018-04-11 11:10:22,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-11 11:10:22,734 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:10:22,734 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] [2018-04-11 11:10:22,734 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:10:22,734 INFO L82 PathProgramCache]: Analyzing trace with hash 484057860, now seen corresponding path program 1 times [2018-04-11 11:10:22,734 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:10:22,734 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:10:22,735 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:22,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:10:22,735 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:22,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:10:22,742 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:10:22,895 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 11:10:22,895 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:10:22,895 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:10:22,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:10:22,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:10:22,937 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:10:22,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 11:10:22,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:22,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:22,953 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 11:10:22,991 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:10:22,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:10:22,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:22,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:22,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:22,999 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-04-11 11:10:23,016 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:23,017 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:23,018 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:10:23,018 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:23,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:23,022 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2018-04-11 11:10:23,052 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:10:23,053 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:10:23,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:23,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:23,059 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:10:23,059 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-04-11 11:10:23,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-04-11 11:10:23,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-04-11 11:10:23,084 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:23,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:23,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:23,100 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:12 [2018-04-11 11:10:23,114 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:10:23,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:10:23,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:23,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:23,120 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:10:23,120 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-04-11 11:10:23,184 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 11:10:23,203 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:10:23,203 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 22 [2018-04-11 11:10:23,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 11:10:23,204 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 11:10:23,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2018-04-11 11:10:23,204 INFO L87 Difference]: Start difference. First operand 149 states and 170 transitions. Second operand 22 states. [2018-04-11 11:10:23,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:10:23,792 INFO L93 Difference]: Finished difference Result 243 states and 268 transitions. [2018-04-11 11:10:23,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 11:10:23,793 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 41 [2018-04-11 11:10:23,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:10:23,794 INFO L225 Difference]: With dead ends: 243 [2018-04-11 11:10:23,794 INFO L226 Difference]: Without dead ends: 243 [2018-04-11 11:10:23,795 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=284, Invalid=1122, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 11:10:23,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-04-11 11:10:23,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 149. [2018-04-11 11:10:23,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-04-11 11:10:23,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 169 transitions. [2018-04-11 11:10:23,798 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 169 transitions. Word has length 41 [2018-04-11 11:10:23,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:10:23,798 INFO L459 AbstractCegarLoop]: Abstraction has 149 states and 169 transitions. [2018-04-11 11:10:23,798 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 11:10:23,798 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 169 transitions. [2018-04-11 11:10:23,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 11:10:23,799 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:10:23,799 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:10:23,799 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:10:23,799 INFO L82 PathProgramCache]: Analyzing trace with hash -915052340, now seen corresponding path program 2 times [2018-04-11 11:10:23,799 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:10:23,799 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:10:23,800 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:23,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:10:23,800 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:23,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:10:23,812 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:10:23,921 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:10:23,921 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:10:23,921 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:10:23,930 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 11:10:23,945 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 11:10:23,945 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 11:10:23,947 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:10:23,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 11:10:23,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:10:23,957 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:23,958 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:23,964 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:10:23,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:10:23,966 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:23,967 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:23,972 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:10:23,972 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:36, output treesize:10 [2018-04-11 11:10:23,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2018-04-11 11:10:23,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 11:10:23,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:23,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:23,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:23,996 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:23 [2018-04-11 11:10:24,014 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:10:24,015 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:10:24,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-11 11:10:24,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:24,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:24,021 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 21 treesize of output 17 [2018-04-11 11:10:24,022 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:10:24,022 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:10:24,023 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:24,025 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:24,026 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:10:24,026 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:34, output treesize:7 [2018-04-11 11:10:24,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 11:10:24,041 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:10:24,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:24,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:24,043 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:10:24,043 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-04-11 11:10:24,046 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:10:24,071 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:10:24,071 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-04-11 11:10:24,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 11:10:24,072 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 11:10:24,072 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-04-11 11:10:24,072 INFO L87 Difference]: Start difference. First operand 149 states and 169 transitions. Second operand 13 states. [2018-04-11 11:10:24,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:10:24,371 INFO L93 Difference]: Finished difference Result 225 states and 245 transitions. [2018-04-11 11:10:24,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 11:10:24,371 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-04-11 11:10:24,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:10:24,372 INFO L225 Difference]: With dead ends: 225 [2018-04-11 11:10:24,372 INFO L226 Difference]: Without dead ends: 225 [2018-04-11 11:10:24,372 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 36 SyntacticMatches, 7 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2018-04-11 11:10:24,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-04-11 11:10:24,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 149. [2018-04-11 11:10:24,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-04-11 11:10:24,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 168 transitions. [2018-04-11 11:10:24,375 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 168 transitions. Word has length 43 [2018-04-11 11:10:24,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:10:24,375 INFO L459 AbstractCegarLoop]: Abstraction has 149 states and 168 transitions. [2018-04-11 11:10:24,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 11:10:24,375 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 168 transitions. [2018-04-11 11:10:24,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-11 11:10:24,376 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:10:24,376 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:10:24,376 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:10:24,376 INFO L82 PathProgramCache]: Analyzing trace with hash 805828618, now seen corresponding path program 2 times [2018-04-11 11:10:24,376 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:10:24,376 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:10:24,377 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:24,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 11:10:24,377 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:24,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:10:24,386 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:10:24,494 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:10:24,495 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:10:24,495 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:10:24,500 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 11:10:24,520 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 11:10:24,520 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 11:10:24,522 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:10:24,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 11:10:24,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 11:10:24,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:24,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:24,542 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:10:24,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 10 treesize of output 9 [2018-04-11 11:10:24,544 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:24,545 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:24,550 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:10:24,550 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:36, output treesize:10 [2018-04-11 11:10:24,559 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 29 treesize of output 20 [2018-04-11 11:10:24,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:10:24,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:24,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:24,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:24,564 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:23 [2018-04-11 11:10:24,579 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:10:24,581 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:10:24,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-11 11:10:24,581 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:24,583 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:24,586 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 21 treesize of output 17 [2018-04-11 11:10:24,588 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:10:24,589 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:10:24,589 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:24,591 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:24,592 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:10:24,592 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:34, output treesize:7 [2018-04-11 11:10:24,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 11:10:24,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 3 [2018-04-11 11:10:24,605 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:24,605 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:24,606 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:10:24,606 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-04-11 11:10:24,609 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:10:24,627 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:10:24,628 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-04-11 11:10:24,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 11:10:24,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 11:10:24,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-04-11 11:10:24,628 INFO L87 Difference]: Start difference. First operand 149 states and 168 transitions. Second operand 13 states. [2018-04-11 11:10:24,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:10:24,954 INFO L93 Difference]: Finished difference Result 206 states and 224 transitions. [2018-04-11 11:10:24,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 11:10:24,954 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 46 [2018-04-11 11:10:24,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:10:24,955 INFO L225 Difference]: With dead ends: 206 [2018-04-11 11:10:24,955 INFO L226 Difference]: Without dead ends: 206 [2018-04-11 11:10:24,955 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 39 SyntacticMatches, 7 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2018-04-11 11:10:24,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-04-11 11:10:24,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 152. [2018-04-11 11:10:24,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-04-11 11:10:24,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 171 transitions. [2018-04-11 11:10:24,959 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 171 transitions. Word has length 46 [2018-04-11 11:10:24,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:10:24,959 INFO L459 AbstractCegarLoop]: Abstraction has 152 states and 171 transitions. [2018-04-11 11:10:24,959 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 11:10:24,959 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 171 transitions. [2018-04-11 11:10:24,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-11 11:10:24,960 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:10:24,960 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:10:24,960 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:10:24,960 INFO L82 PathProgramCache]: Analyzing trace with hash 295905981, now seen corresponding path program 1 times [2018-04-11 11:10:24,961 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:10:24,961 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:10:24,961 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:24,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 11:10:24,962 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:10:24,972 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:10:25,075 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:10:25,075 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:10:25,075 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:10:25,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:10:25,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:10:25,103 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:10:25,149 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:10:25,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:10:25,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:25,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:25,172 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:10:25,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 11:10:25,174 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:25,175 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:25,180 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:10:25,180 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:36, output treesize:10 [2018-04-11 11:10:25,192 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 29 treesize of output 20 [2018-04-11 11:10:25,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:10:25,193 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:25,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:25,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:25,197 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:23 [2018-04-11 11:10:25,229 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 29 treesize of output 25 [2018-04-11 11:10:25,230 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:10:25,231 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 25 treesize of output 21 [2018-04-11 11:10:25,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:25,233 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:25,239 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 23 treesize of output 19 [2018-04-11 11:10:25,240 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:10:25,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-11 11:10:25,241 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:25,243 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:25,246 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:10:25,246 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:7 [2018-04-11 11:10:25,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 11:10:25,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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:10:25,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:25,261 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:25,262 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:10:25,262 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-04-11 11:10:25,274 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:10:25,293 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:10:25,293 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 18 [2018-04-11 11:10:25,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 11:10:25,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 11:10:25,293 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-04-11 11:10:25,293 INFO L87 Difference]: Start difference. First operand 152 states and 171 transitions. Second operand 18 states. [2018-04-11 11:10:25,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:10:25,723 INFO L93 Difference]: Finished difference Result 210 states and 227 transitions. [2018-04-11 11:10:25,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 11:10:25,724 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 46 [2018-04-11 11:10:25,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:10:25,724 INFO L225 Difference]: With dead ends: 210 [2018-04-11 11:10:25,724 INFO L226 Difference]: Without dead ends: 210 [2018-04-11 11:10:25,725 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 35 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=643, Unknown=0, NotChecked=0, Total=812 [2018-04-11 11:10:25,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-04-11 11:10:25,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 149. [2018-04-11 11:10:25,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-04-11 11:10:25,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 167 transitions. [2018-04-11 11:10:25,727 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 167 transitions. Word has length 46 [2018-04-11 11:10:25,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:10:25,727 INFO L459 AbstractCegarLoop]: Abstraction has 149 states and 167 transitions. [2018-04-11 11:10:25,727 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 11:10:25,727 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 167 transitions. [2018-04-11 11:10:25,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 11:10:25,728 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:10:25,728 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-04-11 11:10:25,728 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:10:25,728 INFO L82 PathProgramCache]: Analyzing trace with hash 630501015, now seen corresponding path program 2 times [2018-04-11 11:10:25,729 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:10:25,729 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:10:25,729 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:25,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:10:25,729 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:25,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:10:25,741 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:10:25,915 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:10:25,916 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:10:25,916 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:10:25,921 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 11:10:25,940 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 11:10:25,940 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 11:10:25,942 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:10:25,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 11:10:25,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:25,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:25,950 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:10:25,992 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:25,992 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:25,993 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:10:25,993 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:25,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:25,997 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-11 11:10:26,044 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:10:26,046 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:10:26,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:26,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:26,053 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:10:26,053 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-04-11 11:10:26,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2018-04-11 11:10:26,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 11:10:26,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:26,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:26,125 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:10:26,125 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:25 [2018-04-11 11:10:26,181 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 25 treesize of output 19 [2018-04-11 11:10:26,183 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:10:26,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:26,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:26,196 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:10:26,196 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:5 [2018-04-11 11:10:26,245 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:10:26,273 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:10:26,273 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 30 [2018-04-11 11:10:26,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-11 11:10:26,274 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-11 11:10:26,274 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=783, Unknown=0, NotChecked=0, Total=870 [2018-04-11 11:10:26,274 INFO L87 Difference]: Start difference. First operand 149 states and 167 transitions. Second operand 30 states. [2018-04-11 11:10:27,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:10:27,556 INFO L93 Difference]: Finished difference Result 255 states and 275 transitions. [2018-04-11 11:10:27,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-11 11:10:27,556 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 49 [2018-04-11 11:10:27,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:10:27,557 INFO L225 Difference]: With dead ends: 255 [2018-04-11 11:10:27,557 INFO L226 Difference]: Without dead ends: 255 [2018-04-11 11:10:27,558 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=651, Invalid=2771, Unknown=0, NotChecked=0, Total=3422 [2018-04-11 11:10:27,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-04-11 11:10:27,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 165. [2018-04-11 11:10:27,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-04-11 11:10:27,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 185 transitions. [2018-04-11 11:10:27,560 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 185 transitions. Word has length 49 [2018-04-11 11:10:27,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:10:27,561 INFO L459 AbstractCegarLoop]: Abstraction has 165 states and 185 transitions. [2018-04-11 11:10:27,561 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-11 11:10:27,561 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 185 transitions. [2018-04-11 11:10:27,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 11:10:27,561 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:10:27,561 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:10:27,561 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:10:27,561 INFO L82 PathProgramCache]: Analyzing trace with hash 369984641, now seen corresponding path program 1 times [2018-04-11 11:10:27,562 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:10:27,562 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:10:27,562 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:27,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 11:10:27,563 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:27,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:10:27,576 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:10:27,709 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:10:27,709 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:10:27,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 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:10:27,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:10:27,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:10:27,731 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:10:27,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 11:10:27,734 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:27,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:27,736 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:10:27,766 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:27,767 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:27,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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:10:27,767 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:27,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:27,770 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-11 11:10:27,780 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:10:27,782 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:10:27,782 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:27,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:27,787 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:10:27,787 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-04-11 11:10:27,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2018-04-11 11:10:27,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 11:10:27,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:27,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:27,825 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:10:27,826 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:25 [2018-04-11 11:10:27,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-04-11 11:10:27,878 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:10:27,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-04-11 11:10:27,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:27,881 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:27,884 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:10:27,885 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:5 [2018-04-11 11:10:27,894 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:10:27,913 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:10:27,913 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 21 [2018-04-11 11:10:27,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 11:10:27,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 11:10:27,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2018-04-11 11:10:27,913 INFO L87 Difference]: Start difference. First operand 165 states and 185 transitions. Second operand 22 states. [2018-04-11 11:10:28,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:10:28,590 INFO L93 Difference]: Finished difference Result 281 states and 307 transitions. [2018-04-11 11:10:28,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 11:10:28,590 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 49 [2018-04-11 11:10:28,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:10:28,591 INFO L225 Difference]: With dead ends: 281 [2018-04-11 11:10:28,591 INFO L226 Difference]: Without dead ends: 281 [2018-04-11 11:10:28,592 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 37 SyntacticMatches, 6 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=353, Invalid=1369, Unknown=0, NotChecked=0, Total=1722 [2018-04-11 11:10:28,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-04-11 11:10:28,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 196. [2018-04-11 11:10:28,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-04-11 11:10:28,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 222 transitions. [2018-04-11 11:10:28,595 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 222 transitions. Word has length 49 [2018-04-11 11:10:28,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:10:28,595 INFO L459 AbstractCegarLoop]: Abstraction has 196 states and 222 transitions. [2018-04-11 11:10:28,595 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 11:10:28,596 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 222 transitions. [2018-04-11 11:10:28,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 11:10:28,596 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:10:28,596 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:10:28,596 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:10:28,597 INFO L82 PathProgramCache]: Analyzing trace with hash 369984642, now seen corresponding path program 1 times [2018-04-11 11:10:28,597 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:10:28,597 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:10:28,597 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:28,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:10:28,598 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:28,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:10:28,611 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:10:28,800 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:10:28,800 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:10:28,800 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:10:28,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:10:28,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:10:28,826 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:10:28,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:10:28,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:28,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:28,831 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:10:28,871 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:28,872 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:28,872 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:10:28,873 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:28,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:28,877 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-04-11 11:10:28,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 11:10:28,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 11:10:28,892 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:28,893 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:28,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 11:10:28,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:10:28,903 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:28,904 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:28,910 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:10:28,910 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:29 [2018-04-11 11:10:28,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-11 11:10:28,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:10:28,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:28,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:28,980 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 54 treesize of output 50 [2018-04-11 11:10:28,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:10:28,982 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:28,988 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:29,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:29,003 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:77, output treesize:28 [2018-04-11 11:10:29,055 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 21 [2018-04-11 11:10:29,056 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:10:29,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-04-11 11:10:29,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:29,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:29,069 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 13 [2018-04-11 11:10:29,075 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:10:29,075 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:10:29,076 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:29,078 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:29,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:29,083 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:49, output treesize:9 [2018-04-11 11:10:29,134 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:10:29,153 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:10:29,154 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2018-04-11 11:10:29,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 11:10:29,154 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 11:10:29,154 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2018-04-11 11:10:29,154 INFO L87 Difference]: Start difference. First operand 196 states and 222 transitions. Second operand 26 states. [2018-04-11 11:10:30,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:10:30,528 INFO L93 Difference]: Finished difference Result 330 states and 359 transitions. [2018-04-11 11:10:30,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-11 11:10:30,529 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 49 [2018-04-11 11:10:30,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:10:30,530 INFO L225 Difference]: With dead ends: 330 [2018-04-11 11:10:30,530 INFO L226 Difference]: Without dead ends: 330 [2018-04-11 11:10:30,531 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=587, Invalid=2383, Unknown=0, NotChecked=0, Total=2970 [2018-04-11 11:10:30,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-04-11 11:10:30,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 200. [2018-04-11 11:10:30,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-04-11 11:10:30,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 227 transitions. [2018-04-11 11:10:30,534 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 227 transitions. Word has length 49 [2018-04-11 11:10:30,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:10:30,534 INFO L459 AbstractCegarLoop]: Abstraction has 200 states and 227 transitions. [2018-04-11 11:10:30,534 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 11:10:30,534 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 227 transitions. [2018-04-11 11:10:30,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-11 11:10:30,534 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:10:30,534 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-04-11 11:10:30,534 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:10:30,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1826491666, now seen corresponding path program 3 times [2018-04-11 11:10:30,535 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:10:30,535 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:10:30,535 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:30,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:10:30,535 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:30,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:10:30,544 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:10:30,687 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:10:30,687 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:10:30,687 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:10:30,693 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 11:10:30,722 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-11 11:10:30,723 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 11:10:30,728 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:10:30,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 11:10:30,734 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:30,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:30,737 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:10:30,775 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:30,776 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:30,777 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:10:30,777 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:30,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:30,791 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-11 11:10:30,804 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:10:30,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:10:30,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:30,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:30,814 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:10:30,814 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-04-11 11:10:30,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2018-04-11 11:10:30,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 11:10:30,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:30,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:30,850 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:10:30,850 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:25 [2018-04-11 11:10:30,874 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 29 treesize of output 23 [2018-04-11 11:10:30,876 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:10:30,876 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 23 treesize of output 15 [2018-04-11 11:10:30,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:30,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:30,882 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:10:30,882 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:5 [2018-04-11 11:10:30,896 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:10:30,914 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:10:30,915 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 18 [2018-04-11 11:10:30,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 11:10:30,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 11:10:30,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2018-04-11 11:10:30,915 INFO L87 Difference]: Start difference. First operand 200 states and 227 transitions. Second operand 19 states. [2018-04-11 11:10:31,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:10:31,388 INFO L93 Difference]: Finished difference Result 289 states and 318 transitions. [2018-04-11 11:10:31,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 11:10:31,388 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 52 [2018-04-11 11:10:31,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:10:31,389 INFO L225 Difference]: With dead ends: 289 [2018-04-11 11:10:31,389 INFO L226 Difference]: Without dead ends: 289 [2018-04-11 11:10:31,389 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 42 SyntacticMatches, 6 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=314, Invalid=1092, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 11:10:31,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-04-11 11:10:31,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 221. [2018-04-11 11:10:31,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-04-11 11:10:31,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 250 transitions. [2018-04-11 11:10:31,391 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 250 transitions. Word has length 52 [2018-04-11 11:10:31,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:10:31,392 INFO L459 AbstractCegarLoop]: Abstraction has 221 states and 250 transitions. [2018-04-11 11:10:31,392 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 11:10:31,392 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 250 transitions. [2018-04-11 11:10:31,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-11 11:10:31,392 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:10:31,392 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-04-11 11:10:31,392 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:10:31,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1826491667, now seen corresponding path program 2 times [2018-04-11 11:10:31,392 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:10:31,392 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:10:31,393 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:31,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 11:10:31,393 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:31,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:10:31,404 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:10:31,598 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:10:31,599 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:10:31,599 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:10:31,604 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 11:10:31,620 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 11:10:31,620 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 11:10:31,622 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:10:31,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:10:31,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:31,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:31,629 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:10:31,655 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:31,655 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:31,656 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:10:31,656 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:31,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:31,660 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-04-11 11:10:31,681 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:10:31,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 11:10:31,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:31,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:31,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 11:10:31,697 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:10:31,697 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:31,698 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:31,704 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:10:31,704 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:29 [2018-04-11 11:10:31,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2018-04-11 11:10:31,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:10:31,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:31,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:31,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-11 11:10:31,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:10:31,760 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:31,763 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:31,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:31,771 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:77, output treesize:28 [2018-04-11 11:10:31,800 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 25 treesize of output 19 [2018-04-11 11:10:31,801 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:10:31,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:31,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:31,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 11:10:31,813 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:10:31,813 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:31,814 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:31,817 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:10:31,817 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:39, output treesize:9 [2018-04-11 11:10:31,841 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:10:31,859 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:10:31,859 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 23 [2018-04-11 11:10:31,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 11:10:31,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 11:10:31,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2018-04-11 11:10:31,860 INFO L87 Difference]: Start difference. First operand 221 states and 250 transitions. Second operand 24 states. [2018-04-11 11:10:33,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:10:33,040 INFO L93 Difference]: Finished difference Result 334 states and 364 transitions. [2018-04-11 11:10:33,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-11 11:10:33,040 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 52 [2018-04-11 11:10:33,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:10:33,041 INFO L225 Difference]: With dead ends: 334 [2018-04-11 11:10:33,041 INFO L226 Difference]: Without dead ends: 334 [2018-04-11 11:10:33,041 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=531, Invalid=2121, Unknown=0, NotChecked=0, Total=2652 [2018-04-11 11:10:33,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-04-11 11:10:33,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 221. [2018-04-11 11:10:33,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-04-11 11:10:33,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 250 transitions. [2018-04-11 11:10:33,044 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 250 transitions. Word has length 52 [2018-04-11 11:10:33,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:10:33,044 INFO L459 AbstractCegarLoop]: Abstraction has 221 states and 250 transitions. [2018-04-11 11:10:33,044 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 11:10:33,044 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 250 transitions. [2018-04-11 11:10:33,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-11 11:10:33,044 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:10:33,044 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:10:33,044 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:10:33,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1789097704, now seen corresponding path program 1 times [2018-04-11 11:10:33,045 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:10:33,045 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:10:33,045 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:33,045 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 11:10:33,045 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:33,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:10:33,053 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:10:33,216 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 11:10:33,216 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:10:33,216 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:10:33,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:10:33,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:10:33,237 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:10:33,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:10:33,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:33,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:33,240 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 11:10:33,271 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:10:33,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 11:10:33,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:33,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:33,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:33,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-04-11 11:10:33,292 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:33,293 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:33,293 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:10:33,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:33,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:33,299 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:28 [2018-04-11 11:10:33,334 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:10:33,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 11:10:33,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:33,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:33,343 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:10:33,343 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:40 [2018-04-11 11:10:33,399 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:33,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 26 [2018-04-11 11:10:33,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 11:10:33,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:33,405 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:33,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:33,411 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:54, output treesize:56 [2018-04-11 11:10:33,433 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:33,434 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:33,434 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:33,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-04-11 11:10:33,435 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:33,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:33,440 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:61, output treesize:54 [2018-04-11 11:10:33,482 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:33,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 57 [2018-04-11 11:10:33,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 11:10:33,486 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:33,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:33,499 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:10:33,499 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:66 [2018-04-11 11:10:33,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 54 [2018-04-11 11:10:33,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 13 [2018-04-11 11:10:33,526 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:33,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2018-04-11 11:10:33,531 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:10:33,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:10:33,539 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:10:33,539 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:84, output treesize:27 [2018-04-11 11:10:33,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-04-11 11:10:33,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:10:33,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:33,595 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:33,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-11 11:10:33,601 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:38, output treesize:34 [2018-04-11 11:10:33,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2018-04-11 11:10:33,659 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:10:33,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:33,664 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:10:33,664 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:33,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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:10:33,667 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:33,668 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:33,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:33,671 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:41, output treesize:3 [2018-04-11 11:10:33,693 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:10:33,712 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:10:33,712 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 36 [2018-04-11 11:10:33,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-11 11:10:33,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-11 11:10:33,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1097, Unknown=0, NotChecked=0, Total=1260 [2018-04-11 11:10:33,713 INFO L87 Difference]: Start difference. First operand 221 states and 250 transitions. Second operand 36 states. [2018-04-11 11:10:35,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:10:35,508 INFO L93 Difference]: Finished difference Result 439 states and 481 transitions. [2018-04-11 11:10:35,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-11 11:10:35,541 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 52 [2018-04-11 11:10:35,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:10:35,542 INFO L225 Difference]: With dead ends: 439 [2018-04-11 11:10:35,542 INFO L226 Difference]: Without dead ends: 439 [2018-04-11 11:10:35,544 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1719 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=963, Invalid=5357, Unknown=0, NotChecked=0, Total=6320 [2018-04-11 11:10:35,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-04-11 11:10:35,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 246. [2018-04-11 11:10:35,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-04-11 11:10:35,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 279 transitions. [2018-04-11 11:10:35,547 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 279 transitions. Word has length 52 [2018-04-11 11:10:35,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:10:35,547 INFO L459 AbstractCegarLoop]: Abstraction has 246 states and 279 transitions. [2018-04-11 11:10:35,547 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-11 11:10:35,547 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 279 transitions. [2018-04-11 11:10:35,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-11 11:10:35,548 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:10:35,548 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-04-11 11:10:35,548 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:10:35,548 INFO L82 PathProgramCache]: Analyzing trace with hash -916597038, now seen corresponding path program 2 times [2018-04-11 11:10:35,548 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:10:35,548 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:10:35,548 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:35,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:10:35,548 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:35,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:10:35,555 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:10:35,715 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 11:10:35,715 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:10:35,715 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:10:35,721 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 11:10:35,740 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 11:10:35,740 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 11:10:35,741 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:10:35,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:10:35,743 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:35,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:35,746 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:10:35,784 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:35,785 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:35,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 11:10:35,785 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:35,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:35,788 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-11 11:10:35,816 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:10:35,817 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:10:35,817 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:35,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:35,822 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:10:35,822 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-04-11 11:10:35,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2018-04-11 11:10:35,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 11:10:35,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:35,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:35,889 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:10:35,889 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:25 [2018-04-11 11:10:35,924 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 25 treesize of output 19 [2018-04-11 11:10:35,925 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:10:35,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:35,927 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:35,929 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:10:35,929 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:5 [2018-04-11 11:10:35,959 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:10:35,977 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:10:35,977 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 30 [2018-04-11 11:10:35,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-11 11:10:35,978 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-11 11:10:35,978 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=782, Unknown=0, NotChecked=0, Total=870 [2018-04-11 11:10:35,978 INFO L87 Difference]: Start difference. First operand 246 states and 279 transitions. Second operand 30 states. [2018-04-11 11:10:37,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:10:37,681 INFO L93 Difference]: Finished difference Result 452 states and 497 transitions. [2018-04-11 11:10:37,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-11 11:10:37,681 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 52 [2018-04-11 11:10:37,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:10:37,682 INFO L225 Difference]: With dead ends: 452 [2018-04-11 11:10:37,682 INFO L226 Difference]: Without dead ends: 452 [2018-04-11 11:10:37,683 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 978 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=818, Invalid=3604, Unknown=0, NotChecked=0, Total=4422 [2018-04-11 11:10:37,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2018-04-11 11:10:37,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 266. [2018-04-11 11:10:37,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-04-11 11:10:37,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 303 transitions. [2018-04-11 11:10:37,686 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 303 transitions. Word has length 52 [2018-04-11 11:10:37,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:10:37,686 INFO L459 AbstractCegarLoop]: Abstraction has 266 states and 303 transitions. [2018-04-11 11:10:37,686 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-11 11:10:37,686 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 303 transitions. [2018-04-11 11:10:37,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-11 11:10:37,686 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:10:37,686 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:10:37,687 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:10:37,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1272790085, now seen corresponding path program 1 times [2018-04-11 11:10:37,687 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:10:37,687 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:10:37,687 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:37,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 11:10:37,687 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:10:37,692 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:10:37,743 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-11 11:10:37,743 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:10:37,743 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:10:37,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:10:37,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:10:37,765 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:10:37,773 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-11 11:10:37,791 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:10:37,791 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-04-11 11:10:37,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 11:10:37,791 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 11:10:37,791 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-04-11 11:10:37,791 INFO L87 Difference]: Start difference. First operand 266 states and 303 transitions. Second operand 6 states. [2018-04-11 11:10:37,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:10:37,803 INFO L93 Difference]: Finished difference Result 285 states and 324 transitions. [2018-04-11 11:10:37,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 11:10:37,803 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-04-11 11:10:37,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:10:37,805 INFO L225 Difference]: With dead ends: 285 [2018-04-11 11:10:37,805 INFO L226 Difference]: Without dead ends: 270 [2018-04-11 11:10:37,805 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-04-11 11:10:37,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-04-11 11:10:37,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 267. [2018-04-11 11:10:37,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-04-11 11:10:37,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 307 transitions. [2018-04-11 11:10:37,809 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 307 transitions. Word has length 53 [2018-04-11 11:10:37,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:10:37,809 INFO L459 AbstractCegarLoop]: Abstraction has 267 states and 307 transitions. [2018-04-11 11:10:37,809 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 11:10:37,809 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 307 transitions. [2018-04-11 11:10:37,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-11 11:10:37,809 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:10:37,809 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:10:37,809 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:10:37,810 INFO L82 PathProgramCache]: Analyzing trace with hash 2069737896, now seen corresponding path program 1 times [2018-04-11 11:10:37,810 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:10:37,810 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:10:37,810 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:37,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:10:37,810 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:37,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:10:37,815 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:10:37,841 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-11 11:10:37,841 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:10:37,841 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:10:37,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:10:37,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:10:37,864 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:10:37,875 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-11 11:10:37,893 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:10:37,894 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-04-11 11:10:37,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 11:10:37,894 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 11:10:37,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-04-11 11:10:37,894 INFO L87 Difference]: Start difference. First operand 267 states and 307 transitions. Second operand 6 states. [2018-04-11 11:10:37,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:10:37,904 INFO L93 Difference]: Finished difference Result 281 states and 322 transitions. [2018-04-11 11:10:37,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 11:10:37,904 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-04-11 11:10:37,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:10:37,904 INFO L225 Difference]: With dead ends: 281 [2018-04-11 11:10:37,904 INFO L226 Difference]: Without dead ends: 266 [2018-04-11 11:10:37,905 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-04-11 11:10:37,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-04-11 11:10:37,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 255. [2018-04-11 11:10:37,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-04-11 11:10:37,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 296 transitions. [2018-04-11 11:10:37,908 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 296 transitions. Word has length 53 [2018-04-11 11:10:37,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:10:37,908 INFO L459 AbstractCegarLoop]: Abstraction has 255 states and 296 transitions. [2018-04-11 11:10:37,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 11:10:37,908 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 296 transitions. [2018-04-11 11:10:37,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 11:10:37,909 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:10:37,909 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:10:37,909 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:10:37,909 INFO L82 PathProgramCache]: Analyzing trace with hash -902212688, now seen corresponding path program 2 times [2018-04-11 11:10:37,910 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:10:37,910 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:10:37,910 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:37,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:10:37,910 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:37,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:10:37,921 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:10:38,266 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:10:38,267 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:10:38,267 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:10:38,276 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 11:10:38,304 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 11:10:38,304 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 11:10:38,307 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:10:38,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:10:38,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:38,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:38,313 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:10:38,356 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:38,357 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:38,357 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:10:38,358 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:38,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:38,363 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-04-11 11:10:38,410 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:10:38,412 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:10:38,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:38,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:38,420 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:10:38,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:10:38,421 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:38,422 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:38,428 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:10:38,428 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:29 [2018-04-11 11:10:38,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-11 11:10:38,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 11:10:38,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:38,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:38,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:38,505 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:48 [2018-04-11 11:10:38,579 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:38,582 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 43 treesize of output 48 [2018-04-11 11:10:38,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:10:38,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:38,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:38,600 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:38,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 58 [2018-04-11 11:10:38,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:10:38,603 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:38,609 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:38,615 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:10:38,616 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:74, output treesize:61 [2018-04-11 11:10:38,708 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:38,716 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 3 case distinctions, treesize of input 69 treesize of output 124 [2018-04-11 11:10:38,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 99 [2018-04-11 11:10:38,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:38,733 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:38,733 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 67 treesize of output 78 [2018-04-11 11:10:38,733 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:38,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:10:38,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:10:38,751 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:104, output treesize:179 [2018-04-11 11:10:38,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 81 [2018-04-11 11:10:38,847 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 21 [2018-04-11 11:10:38,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:38,855 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 48 treesize of output 35 [2018-04-11 11:10:38,855 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:38,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:38,873 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 49 treesize of output 37 [2018-04-11 11:10:38,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2018-04-11 11:10:38,874 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:38,879 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:10:38,879 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:38,881 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:38,892 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:38,893 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:38,893 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 89 treesize of output 85 [2018-04-11 11:10:38,898 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 40 [2018-04-11 11:10:38,899 INFO L267 ElimStorePlain]: Start of recursive call 9: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 11:10:38,912 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 65 treesize of output 58 [2018-04-11 11:10:38,913 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-04-11 11:10:38,914 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 59 treesize of output 46 [2018-04-11 11:10:38,914 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:38,929 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 11:10:38,947 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 60 treesize of output 46 [2018-04-11 11:10:38,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2018-04-11 11:10:38,949 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:38,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-04-11 11:10:38,954 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:38,965 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:38,967 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 60 treesize of output 46 [2018-04-11 11:10:38,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 42 treesize of output 29 [2018-04-11 11:10:38,968 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:38,973 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 7 [2018-04-11 11:10:38,974 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:38,977 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:38,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 11:10:38,987 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:193, output treesize:48 [2018-04-11 11:10:39,049 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:39,050 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:39,050 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 22 treesize of output 24 [2018-04-11 11:10:39,056 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 15 treesize of output 18 [2018-04-11 11:10:39,056 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:10:39,061 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:10:39,062 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:39,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:39,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 11:10:39,069 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:10:39,069 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:39,070 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:39,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:10:39,073 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:38, output treesize:7 [2018-04-11 11:10:39,099 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:10:39,118 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:10:39,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 40 [2018-04-11 11:10:39,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-11 11:10:39,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-11 11:10:39,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1414, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 11:10:39,119 INFO L87 Difference]: Start difference. First operand 255 states and 296 transitions. Second operand 40 states. [2018-04-11 11:10:40,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:10:40,740 INFO L93 Difference]: Finished difference Result 330 states and 371 transitions. [2018-04-11 11:10:40,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 11:10:40,774 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 54 [2018-04-11 11:10:40,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:10:40,775 INFO L225 Difference]: With dead ends: 330 [2018-04-11 11:10:40,775 INFO L226 Difference]: Without dead ends: 330 [2018-04-11 11:10:40,776 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 943 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=545, Invalid=3745, Unknown=0, NotChecked=0, Total=4290 [2018-04-11 11:10:40,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-04-11 11:10:40,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 265. [2018-04-11 11:10:40,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-04-11 11:10:40,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 306 transitions. [2018-04-11 11:10:40,779 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 306 transitions. Word has length 54 [2018-04-11 11:10:40,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:10:40,779 INFO L459 AbstractCegarLoop]: Abstraction has 265 states and 306 transitions. [2018-04-11 11:10:40,779 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-11 11:10:40,780 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 306 transitions. [2018-04-11 11:10:40,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 11:10:40,780 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:10:40,780 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:10:40,780 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:10:40,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1675321626, now seen corresponding path program 3 times [2018-04-11 11:10:40,780 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:10:40,780 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:10:40,781 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:40,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 11:10:40,781 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:40,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:10:40,788 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:10:41,075 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:10:41,075 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:10:41,075 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:10:41,080 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 11:10:41,098 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-11 11:10:41,098 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 11:10:41,100 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:10:41,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 11:10:41,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:41,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:41,105 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:10:41,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:10:41,131 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:41,139 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:41,139 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:41,140 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:10:41,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:41,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:41,147 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2018-04-11 11:10:41,199 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:10:41,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:10:41,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:41,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:41,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 11:10:41,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 11:10:41,213 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:41,214 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:41,222 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:10:41,222 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:55, output treesize:56 [2018-04-11 11:10:41,343 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:41,344 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:10:41,344 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:41,366 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:41,367 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:41,368 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:41,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2018-04-11 11:10:41,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:41,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:41,391 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:74 [2018-04-11 11:10:41,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-04-11 11:10:41,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:41,480 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:41,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2018-04-11 11:10:41,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:10:41,486 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:41,489 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:41,506 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:41,508 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:41,508 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 51 treesize of output 63 [2018-04-11 11:10:41,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-11 11:10:41,511 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:41,518 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:41,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:41,531 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:107, output treesize:69 [2018-04-11 11:10:41,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 11:10:41,684 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:10:41,684 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:41,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:41,695 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:10:41,695 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:89, output treesize:78 [2018-04-11 11:10:41,777 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:41,778 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:41,778 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 68 treesize of output 55 [2018-04-11 11:10:41,783 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2018-04-11 11:10:41,784 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 11:10:41,797 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:10:41,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 42 [2018-04-11 11:10:41,801 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 11:10:41,802 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:10:41,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2018-04-11 11:10:41,803 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:41,818 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:10:41,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-11 11:10:41,850 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:79, output treesize:57 [2018-04-11 11:10:41,953 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:10:41,972 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:10:41,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 36 [2018-04-11 11:10:41,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-11 11:10:41,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-11 11:10:41,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1173, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 11:10:41,973 INFO L87 Difference]: Start difference. First operand 265 states and 306 transitions. Second operand 37 states. [2018-04-11 11:10:44,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:10:44,593 INFO L93 Difference]: Finished difference Result 355 states and 398 transitions. [2018-04-11 11:10:44,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-11 11:10:44,593 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 54 [2018-04-11 11:10:44,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:10:44,594 INFO L225 Difference]: With dead ends: 355 [2018-04-11 11:10:44,594 INFO L226 Difference]: Without dead ends: 355 [2018-04-11 11:10:44,595 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1166 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=639, Invalid=3393, Unknown=0, NotChecked=0, Total=4032 [2018-04-11 11:10:44,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-04-11 11:10:44,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 268. [2018-04-11 11:10:44,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-04-11 11:10:44,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 310 transitions. [2018-04-11 11:10:44,599 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 310 transitions. Word has length 54 [2018-04-11 11:10:44,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:10:44,599 INFO L459 AbstractCegarLoop]: Abstraction has 268 states and 310 transitions. [2018-04-11 11:10:44,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-11 11:10:44,600 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 310 transitions. [2018-04-11 11:10:44,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 11:10:44,600 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:10:44,600 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:10:44,600 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:10:44,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1675321627, now seen corresponding path program 2 times [2018-04-11 11:10:44,601 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:10:44,601 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:10:44,601 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:44,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 11:10:44,601 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:44,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:10:44,610 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:10:45,010 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:10:45,010 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:10:45,010 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:10:45,015 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 11:10:45,037 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 11:10:45,037 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 11:10:45,039 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:10:45,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 11:10:45,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:45,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:45,043 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:10:45,073 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:45,074 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:45,074 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:10:45,074 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:45,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:45,078 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-04-11 11:10:45,116 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:10:45,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:10:45,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:45,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:45,126 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:10:45,127 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:10:45,128 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:45,129 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:45,135 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:10:45,135 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2018-04-11 11:10:45,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 11:10:45,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:45,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:45,209 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:37 [2018-04-11 11:10:45,233 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 57 treesize of output 51 [2018-04-11 11:10:45,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:10:45,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:45,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:45,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, 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:10:45,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:10:45,250 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:45,254 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:45,260 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:10:45,260 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:74, output treesize:51 [2018-04-11 11:10:45,413 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:45,413 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:10:45,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, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 67 [2018-04-11 11:10:45,417 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:10:45,418 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 46 treesize of output 26 [2018-04-11 11:10:45,418 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:10:45,425 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:10:45,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 15 treesize of output 11 [2018-04-11 11:10:45,425 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:45,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:10:45,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2018-04-11 11:10:45,441 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:10:45,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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:10:45,441 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:45,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 7 treesize of output 1 [2018-04-11 11:10:45,446 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:45,449 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:45,453 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:10:45,453 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:84, output treesize:9 [2018-04-11 11:10:45,483 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:10:45,501 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:10:45,501 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 32 [2018-04-11 11:10:45,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-11 11:10:45,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-11 11:10:45,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=946, Unknown=0, NotChecked=0, Total=1056 [2018-04-11 11:10:45,503 INFO L87 Difference]: Start difference. First operand 268 states and 310 transitions. Second operand 33 states. [2018-04-11 11:10:46,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:10:46,893 INFO L93 Difference]: Finished difference Result 359 states and 404 transitions. [2018-04-11 11:10:46,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 11:10:46,894 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 54 [2018-04-11 11:10:46,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:10:46,894 INFO L225 Difference]: With dead ends: 359 [2018-04-11 11:10:46,895 INFO L226 Difference]: Without dead ends: 359 [2018-04-11 11:10:46,895 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 37 SyntacticMatches, 6 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=400, Invalid=2356, Unknown=0, NotChecked=0, Total=2756 [2018-04-11 11:10:46,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-04-11 11:10:46,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 274. [2018-04-11 11:10:46,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-04-11 11:10:46,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 317 transitions. [2018-04-11 11:10:46,898 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 317 transitions. Word has length 54 [2018-04-11 11:10:46,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:10:46,898 INFO L459 AbstractCegarLoop]: Abstraction has 274 states and 317 transitions. [2018-04-11 11:10:46,898 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-11 11:10:46,898 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 317 transitions. [2018-04-11 11:10:46,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-11 11:10:46,899 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:10:46,899 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:10:46,899 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:10:46,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1090595090, now seen corresponding path program 4 times [2018-04-11 11:10:46,899 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:10:46,899 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:10:46,900 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:46,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 11:10:46,900 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:46,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:10:46,907 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:10:47,177 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:10:47,178 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:10:47,178 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:10:47,183 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 11:10:47,204 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 11:10:47,204 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 11:10:47,206 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:10:47,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:10:47,216 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:47,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:47,218 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:10:47,287 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:47,287 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:47,288 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:10:47,288 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:47,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:47,291 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-04-11 11:10:47,328 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:10:47,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:10:47,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:47,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:47,339 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:10:47,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:10:47,341 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:47,342 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:47,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:47,350 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2018-04-11 11:10:47,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 6 treesize of output 5 [2018-04-11 11:10:47,410 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:47,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:47,415 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:34 [2018-04-11 11:10:47,427 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 57 treesize of output 51 [2018-04-11 11:10:47,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:10:47,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:47,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:47,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 33 treesize of output 34 [2018-04-11 11:10:47,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 14 treesize of output 13 [2018-04-11 11:10:47,443 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:47,446 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:47,451 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:10:47,451 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:74, output treesize:38 [2018-04-11 11:10:47,505 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:10:47,506 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:10:47,507 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:10:47,507 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:47,509 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:47,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 11:10:47,516 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:44 [2018-04-11 11:10:47,618 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:10:47,620 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 41 [2018-04-11 11:10:47,623 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:10:47,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-04-11 11:10:47,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:47,634 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:10:47,634 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:10:47,635 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:47,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:47,641 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:10:47,641 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:53, output treesize:5 [2018-04-11 11:10:47,657 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:10:47,675 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:10:47,675 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 34 [2018-04-11 11:10:47,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-11 11:10:47,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-11 11:10:47,676 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1076, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 11:10:47,676 INFO L87 Difference]: Start difference. First operand 274 states and 317 transitions. Second operand 35 states. [2018-04-11 11:10:48,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:10:48,742 INFO L93 Difference]: Finished difference Result 325 states and 368 transitions. [2018-04-11 11:10:48,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 11:10:48,743 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 57 [2018-04-11 11:10:48,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:10:48,744 INFO L225 Difference]: With dead ends: 325 [2018-04-11 11:10:48,744 INFO L226 Difference]: Without dead ends: 325 [2018-04-11 11:10:48,744 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 928 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=515, Invalid=2907, Unknown=0, NotChecked=0, Total=3422 [2018-04-11 11:10:48,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-04-11 11:10:48,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 279. [2018-04-11 11:10:48,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-04-11 11:10:48,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 322 transitions. [2018-04-11 11:10:48,747 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 322 transitions. Word has length 57 [2018-04-11 11:10:48,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:10:48,747 INFO L459 AbstractCegarLoop]: Abstraction has 279 states and 322 transitions. [2018-04-11 11:10:48,747 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-11 11:10:48,747 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 322 transitions. [2018-04-11 11:10:48,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-11 11:10:48,748 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:10:48,748 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:10:48,748 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:10:48,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1090595091, now seen corresponding path program 3 times [2018-04-11 11:10:48,748 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:10:48,748 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:10:48,748 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:48,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 11:10:48,749 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:10:48,757 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:10:49,141 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:10:49,142 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:10:49,142 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:10:49,147 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 11:10:49,165 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-11 11:10:49,165 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 11:10:49,167 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:10:49,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:10:49,170 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:49,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:49,172 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:10:49,202 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:49,202 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:49,203 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:10:49,203 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:49,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:49,206 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-11 11:10:49,241 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:10:49,242 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:10:49,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:49,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:49,251 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:10:49,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 11:10:49,252 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:49,253 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:49,258 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:10:49,258 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:40, output treesize:20 [2018-04-11 11:10:49,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:10:49,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:49,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:49,315 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:34 [2018-04-11 11:10:49,360 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:49,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-11 11:10:49,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:10:49,365 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:49,368 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:49,376 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:49,379 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 26 [2018-04-11 11:10:49,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, 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:10:49,380 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:49,383 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:49,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:49,390 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:57, output treesize:50 [2018-04-11 11:10:49,528 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 79 treesize of output 66 [2018-04-11 11:10:49,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-04-11 11:10:49,529 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:10:49,535 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 25 treesize of output 5 [2018-04-11 11:10:49,535 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:49,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:10:49,543 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 27 treesize of output 23 [2018-04-11 11:10:49,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2018-04-11 11:10:49,545 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:49,547 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:49,550 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:10:49,550 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:79, output treesize:9 [2018-04-11 11:10:49,566 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:10:49,584 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:10:49,584 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 35 [2018-04-11 11:10:49,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-11 11:10:49,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-11 11:10:49,585 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1141, Unknown=0, NotChecked=0, Total=1260 [2018-04-11 11:10:49,585 INFO L87 Difference]: Start difference. First operand 279 states and 322 transitions. Second operand 36 states. [2018-04-11 11:10:50,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:10:50,813 INFO L93 Difference]: Finished difference Result 347 states and 391 transitions. [2018-04-11 11:10:50,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 11:10:50,814 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 57 [2018-04-11 11:10:50,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:10:50,815 INFO L225 Difference]: With dead ends: 347 [2018-04-11 11:10:50,815 INFO L226 Difference]: Without dead ends: 347 [2018-04-11 11:10:50,818 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=461, Invalid=2845, Unknown=0, NotChecked=0, Total=3306 [2018-04-11 11:10:50,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-04-11 11:10:50,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 279. [2018-04-11 11:10:50,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-04-11 11:10:50,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 322 transitions. [2018-04-11 11:10:50,825 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 322 transitions. Word has length 57 [2018-04-11 11:10:50,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:10:50,825 INFO L459 AbstractCegarLoop]: Abstraction has 279 states and 322 transitions. [2018-04-11 11:10:50,825 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-11 11:10:50,825 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 322 transitions. [2018-04-11 11:10:50,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-11 11:10:50,826 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:10:50,826 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:10:50,826 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:10:50,827 INFO L82 PathProgramCache]: Analyzing trace with hash 549889369, now seen corresponding path program 1 times [2018-04-11 11:10:50,827 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:10:50,827 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:10:50,828 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:50,828 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 11:10:50,828 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:50,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:10:50,859 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:10:51,221 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:10:51,221 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:10:51,221 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:10:51,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:10:51,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:10:51,248 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:10:51,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:10:51,262 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:51,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:51,264 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:10:51,302 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:51,303 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:51,303 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:10:51,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:51,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:51,307 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-04-11 11:10:51,341 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:10:51,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:10:51,343 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:51,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:51,351 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:10:51,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:10:51,353 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:51,354 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:51,360 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:10:51,360 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2018-04-11 11:10:51,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:10:51,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:51,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:51,424 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:34 [2018-04-11 11:10:51,436 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:10:51,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:10:51,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:51,440 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:51,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2018-04-11 11:10:51,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:10:51,451 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:51,454 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:51,459 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:10:51,459 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:74, output treesize:38 [2018-04-11 11:10:51,513 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:10:51,514 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:10:51,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 11:10:51,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:51,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:51,522 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:10:51,522 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:44 [2018-04-11 11:10:51,594 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:10:51,596 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 41 [2018-04-11 11:10:51,597 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:10:51,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 11:10:51,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:51,602 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:10:51,602 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:51,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:51,607 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:10:51,607 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:53, output treesize:5 [2018-04-11 11:10:51,625 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:10:51,644 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:10:51,645 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 34 [2018-04-11 11:10:51,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-11 11:10:51,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-11 11:10:51,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1076, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 11:10:51,646 INFO L87 Difference]: Start difference. First operand 279 states and 322 transitions. Second operand 35 states. [2018-04-11 11:10:52,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:10:52,861 INFO L93 Difference]: Finished difference Result 332 states and 375 transitions. [2018-04-11 11:10:52,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 11:10:52,861 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 57 [2018-04-11 11:10:52,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:10:52,862 INFO L225 Difference]: With dead ends: 332 [2018-04-11 11:10:52,862 INFO L226 Difference]: Without dead ends: 332 [2018-04-11 11:10:52,862 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=515, Invalid=2907, Unknown=0, NotChecked=0, Total=3422 [2018-04-11 11:10:52,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-04-11 11:10:52,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 284. [2018-04-11 11:10:52,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-04-11 11:10:52,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 327 transitions. [2018-04-11 11:10:52,865 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 327 transitions. Word has length 57 [2018-04-11 11:10:52,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:10:52,865 INFO L459 AbstractCegarLoop]: Abstraction has 284 states and 327 transitions. [2018-04-11 11:10:52,865 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-11 11:10:52,865 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 327 transitions. [2018-04-11 11:10:52,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-11 11:10:52,865 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:10:52,865 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:10:52,866 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:10:52,866 INFO L82 PathProgramCache]: Analyzing trace with hash 549889370, now seen corresponding path program 1 times [2018-04-11 11:10:52,866 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:10:52,866 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:10:52,866 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:52,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:10:52,866 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:52,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:10:52,876 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:10:53,291 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:10:53,291 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:10:53,291 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:10:53,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:10:53,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:10:53,318 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:10:53,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:10:53,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:53,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:53,322 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:10:53,371 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:53,372 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:53,372 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:10:53,372 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:53,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:53,377 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-04-11 11:10:53,420 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:10:53,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:10:53,421 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:53,422 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:53,431 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:10:53,433 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:10:53,433 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:53,434 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:53,441 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:10:53,441 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2018-04-11 11:10:53,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 11:10:53,517 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:53,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:53,524 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:37 [2018-04-11 11:10:53,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-04-11 11:10:53,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 11:10:53,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:53,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:53,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2018-04-11 11:10:53,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:10:53,556 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:53,560 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:53,567 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:10:53,567 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:74, output treesize:51 [2018-04-11 11:10:53,789 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:53,790 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:10:53,792 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 73 [2018-04-11 11:10:53,793 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:10:53,794 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 52 treesize of output 28 [2018-04-11 11:10:53,794 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:10:53,801 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:10:53,802 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:10:53,802 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:53,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:10:53,817 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 35 treesize of output 31 [2018-04-11 11:10:53,821 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:10:53,822 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:10:53,822 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:53,830 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:10:53,830 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:10:53,831 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:53,835 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:53,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:53,851 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:96, output treesize:9 [2018-04-11 11:10:53,877 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:10:53,897 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:10:53,897 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 34 [2018-04-11 11:10:53,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-11 11:10:53,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-11 11:10:53,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1078, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 11:10:53,898 INFO L87 Difference]: Start difference. First operand 284 states and 327 transitions. Second operand 35 states. [2018-04-11 11:10:55,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:10:55,283 INFO L93 Difference]: Finished difference Result 352 states and 396 transitions. [2018-04-11 11:10:55,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 11:10:55,284 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 57 [2018-04-11 11:10:55,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:10:55,284 INFO L225 Difference]: With dead ends: 352 [2018-04-11 11:10:55,284 INFO L226 Difference]: Without dead ends: 352 [2018-04-11 11:10:55,285 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 848 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=451, Invalid=2741, Unknown=0, NotChecked=0, Total=3192 [2018-04-11 11:10:55,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-04-11 11:10:55,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 279. [2018-04-11 11:10:55,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-04-11 11:10:55,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 322 transitions. [2018-04-11 11:10:55,288 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 322 transitions. Word has length 57 [2018-04-11 11:10:55,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:10:55,288 INFO L459 AbstractCegarLoop]: Abstraction has 279 states and 322 transitions. [2018-04-11 11:10:55,288 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-11 11:10:55,288 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 322 transitions. [2018-04-11 11:10:55,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-11 11:10:55,289 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:10:55,289 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] [2018-04-11 11:10:55,289 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:10:55,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1845647441, now seen corresponding path program 2 times [2018-04-11 11:10:55,289 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:10:55,289 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:10:55,289 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:55,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:10:55,290 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:55,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:10:55,295 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:10:55,583 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 11:10:55,583 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:10:55,584 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:10:55,589 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 11:10:55,609 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 11:10:55,609 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 11:10:55,611 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:10:55,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:10:55,612 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:55,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:55,615 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:10:55,655 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:55,656 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:55,656 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:10:55,656 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:55,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:55,662 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-11 11:10:55,708 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:10:55,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 11:10:55,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:55,711 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:55,721 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:10:55,722 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:10:55,722 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:55,723 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:55,730 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:10:55,730 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2018-04-11 11:10:55,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-11 11:10:55,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:10:55,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:55,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:55,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:55,808 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:55 [2018-04-11 11:10:55,835 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:55,836 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:55,836 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:55,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-11 11:10:55,837 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:55,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:55,843 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:60, output treesize:53 [2018-04-11 11:10:55,894 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:55,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 41 [2018-04-11 11:10:55,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:10:55,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:55,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:55,915 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:55,918 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 65 treesize of output 66 [2018-04-11 11:10:55,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 11:10:55,919 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:55,926 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:55,934 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:10:55,935 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:79, output treesize:65 [2018-04-11 11:10:56,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 60 [2018-04-11 11:10:56,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-11 11:10:56,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:56,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:56,040 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:10:56,040 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:106, output treesize:88 [2018-04-11 11:10:56,107 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 66 [2018-04-11 11:10:56,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18 [2018-04-11 11:10:56,109 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:10:56,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2018-04-11 11:10:56,115 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:56,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:10:56,125 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 19 treesize of output 15 [2018-04-11 11:10:56,126 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:10:56,126 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:56,127 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:56,131 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:10:56,132 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:99, output treesize:19 [2018-04-11 11:10:56,206 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 11:10:56,223 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:10:56,223 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 40 [2018-04-11 11:10:56,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-11 11:10:56,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-11 11:10:56,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1401, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 11:10:56,224 INFO L87 Difference]: Start difference. First operand 279 states and 322 transitions. Second operand 40 states. [2018-04-11 11:10:57,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:10:57,831 INFO L93 Difference]: Finished difference Result 381 states and 432 transitions. [2018-04-11 11:10:57,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-11 11:10:57,832 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 57 [2018-04-11 11:10:57,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:10:57,833 INFO L225 Difference]: With dead ends: 381 [2018-04-11 11:10:57,833 INFO L226 Difference]: Without dead ends: 381 [2018-04-11 11:10:57,833 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1229 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=605, Invalid=3951, Unknown=0, NotChecked=0, Total=4556 [2018-04-11 11:10:57,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-04-11 11:10:57,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 276. [2018-04-11 11:10:57,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-04-11 11:10:57,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 318 transitions. [2018-04-11 11:10:57,835 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 318 transitions. Word has length 57 [2018-04-11 11:10:57,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:10:57,835 INFO L459 AbstractCegarLoop]: Abstraction has 276 states and 318 transitions. [2018-04-11 11:10:57,835 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-11 11:10:57,835 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 318 transitions. [2018-04-11 11:10:57,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-11 11:10:57,836 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:10:57,836 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:10:57,836 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:10:57,836 INFO L82 PathProgramCache]: Analyzing trace with hash -2083885385, now seen corresponding path program 4 times [2018-04-11 11:10:57,836 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:10:57,836 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:10:57,836 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:57,837 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 11:10:57,837 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:10:57,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:10:57,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:10:58,116 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:10:58,116 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:10:58,116 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:10:58,123 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 11:10:58,145 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 11:10:58,145 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 11:10:58,147 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:10:58,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:10:58,159 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:58,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:58,162 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:10:58,211 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:58,212 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:58,212 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:10:58,212 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:58,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:58,217 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-04-11 11:10:58,260 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:10:58,261 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:10:58,261 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:58,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:58,272 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:10:58,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 11:10:58,273 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:58,274 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:58,281 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:10:58,281 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2018-04-11 11:10:58,361 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 23 treesize of output 24 [2018-04-11 11:10:58,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:10:58,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:58,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:58,377 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 23 treesize of output 30 [2018-04-11 11:10:58,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 11:10:58,378 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:58,381 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:58,389 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:10:58,389 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:55, output treesize:29 [2018-04-11 11:10:58,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 41 treesize of output 28 [2018-04-11 11:10:58,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-04-11 11:10:58,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:58,449 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:58,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:58,453 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:64, output treesize:50 [2018-04-11 11:10:58,616 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:10:58,616 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:10:58,618 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 68 treesize of output 72 [2018-04-11 11:10:58,621 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:10:58,621 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 25 treesize of output 21 [2018-04-11 11:10:58,621 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:58,632 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:10:58,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2018-04-11 11:10:58,633 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:10:58,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:10:58,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-04-11 11:10:58,671 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:10:58,672 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:10:58,672 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:58,677 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:10:58,678 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:10:58,678 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:58,681 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:58,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:58,687 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:95, output treesize:7 [2018-04-11 11:10:58,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 11:10:58,707 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:10:58,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:10:58,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:10:58,708 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:10:58,708 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-04-11 11:10:58,717 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:10:58,744 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:10:58,744 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 37 [2018-04-11 11:10:58,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-11 11:10:58,744 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-11 11:10:58,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1219, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 11:10:58,745 INFO L87 Difference]: Start difference. First operand 276 states and 318 transitions. Second operand 37 states. [2018-04-11 11:11:00,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:11:00,123 INFO L93 Difference]: Finished difference Result 348 states and 390 transitions. [2018-04-11 11:11:00,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 11:11:00,123 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 59 [2018-04-11 11:11:00,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:11:00,124 INFO L225 Difference]: With dead ends: 348 [2018-04-11 11:11:00,124 INFO L226 Difference]: Without dead ends: 348 [2018-04-11 11:11:00,124 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 39 SyntacticMatches, 7 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 914 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=448, Invalid=3092, Unknown=0, NotChecked=0, Total=3540 [2018-04-11 11:11:00,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-04-11 11:11:00,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 275. [2018-04-11 11:11:00,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-04-11 11:11:00,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 316 transitions. [2018-04-11 11:11:00,126 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 316 transitions. Word has length 59 [2018-04-11 11:11:00,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:11:00,126 INFO L459 AbstractCegarLoop]: Abstraction has 275 states and 316 transitions. [2018-04-11 11:11:00,127 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-11 11:11:00,127 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 316 transitions. [2018-04-11 11:11:00,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-11 11:11:00,127 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:11:00,127 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:11:00,127 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:11:00,128 INFO L82 PathProgramCache]: Analyzing trace with hash -943279003, now seen corresponding path program 3 times [2018-04-11 11:11:00,128 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:11:00,128 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:11:00,128 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:11:00,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 11:11:00,128 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:11:00,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:11:00,135 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:11:00,371 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:11:00,371 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:11:00,371 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:11:00,376 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 11:11:00,402 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-11 11:11:00,403 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 11:11:00,404 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:11:00,422 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:00,423 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:00,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, 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:11:00,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:00,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:00,428 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-11 11:11:00,438 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:11:00,438 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:11:00,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:00,439 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:00,443 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:11:00,444 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-04-11 11:11:00,516 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:00,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-11 11:11:00,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 10 treesize of output 9 [2018-04-11 11:11:00,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:00,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:00,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 14 [2018-04-11 11:11:00,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 11:11:00,533 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:00,534 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:00,539 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:11:00,539 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:37 [2018-04-11 11:11:00,604 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:11:00,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 17 [2018-04-11 11:11:00,605 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:00,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:00,612 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:11:00,612 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:64 [2018-04-11 11:11:00,637 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:00,637 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:00,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 33 [2018-04-11 11:11:00,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:00,646 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:11:00,647 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:78, output treesize:80 [2018-04-11 11:11:00,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 84 [2018-04-11 11:11:00,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 82 [2018-04-11 11:11:00,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:00,778 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:11:00,779 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 70 treesize of output 62 [2018-04-11 11:11:00,779 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:11:00,805 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:11:00,838 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 3 case distinctions, treesize of input 91 treesize of output 99 [2018-04-11 11:11:00,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 95 [2018-04-11 11:11:00,840 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:00,866 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:00,870 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 66 treesize of output 67 [2018-04-11 11:11:00,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:11:00,871 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:00,880 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:00,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-11 11:11:00,903 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:103, output treesize:148 [2018-04-11 11:11:00,961 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 1 case distinctions, treesize of input 102 treesize of output 86 [2018-04-11 11:11:00,963 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 59 [2018-04-11 11:11:00,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:00,985 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 59 treesize of output 52 [2018-04-11 11:11:00,985 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:01,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 49 [2018-04-11 11:11:01,006 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:01,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:01,034 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 58 treesize of output 50 [2018-04-11 11:11:01,035 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 7 [2018-04-11 11:11:01,035 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:01,042 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:11:01,042 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:01,047 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:01,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-11 11:11:01,060 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 8 variables, input treesize:161, output treesize:77 [2018-04-11 11:11:01,182 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:01,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 71 [2018-04-11 11:11:01,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 60 [2018-04-11 11:11:01,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:01,211 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:01,212 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 50 treesize of output 44 [2018-04-11 11:11:01,212 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:01,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:11:01,256 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:01,262 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 3 case distinctions, treesize of input 40 treesize of output 59 [2018-04-11 11:11:01,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2018-04-11 11:11:01,271 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:01,297 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:01,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, 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 32 [2018-04-11 11:11:01,298 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:01,313 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:11:01,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 10 dim-0 vars, and 4 xjuncts. [2018-04-11 11:11:01,353 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:93, output treesize:155 [2018-04-11 11:11:01,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 52 [2018-04-11 11:11:01,640 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 43 treesize of output 38 [2018-04-11 11:11:01,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:01,674 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 44 treesize of output 37 [2018-04-11 11:11:01,674 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:01,693 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:11:01,725 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:01,725 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:01,726 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 43 treesize of output 45 [2018-04-11 11:11:01,730 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 10 treesize of output 15 [2018-04-11 11:11:01,730 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:01,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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:11:01,738 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:01,743 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:01,773 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 36 treesize of output 32 [2018-04-11 11:11:01,774 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:11:01,774 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:01,792 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:01,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-04-11 11:11:01,819 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 10 variables, input treesize:128, output treesize:122 [2018-04-11 11:11:01,931 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 33 treesize of output 25 [2018-04-11 11:11:01,933 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 25 treesize of output 14 [2018-04-11 11:11:01,933 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:01,936 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:01,940 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:11:01,940 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:15 [2018-04-11 11:11:02,019 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:11:02,045 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:11:02,045 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 27] total 39 [2018-04-11 11:11:02,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-11 11:11:02,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-11 11:11:02,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1415, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 11:11:02,045 INFO L87 Difference]: Start difference. First operand 275 states and 316 transitions. Second operand 40 states. [2018-04-11 11:11:05,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:11:05,864 INFO L93 Difference]: Finished difference Result 414 states and 467 transitions. [2018-04-11 11:11:05,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-04-11 11:11:05,865 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 60 [2018-04-11 11:11:05,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:11:05,866 INFO L225 Difference]: With dead ends: 414 [2018-04-11 11:11:05,866 INFO L226 Difference]: Without dead ends: 414 [2018-04-11 11:11:05,866 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2244 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1136, Invalid=7606, Unknown=0, NotChecked=0, Total=8742 [2018-04-11 11:11:05,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-04-11 11:11:05,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 306. [2018-04-11 11:11:05,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-04-11 11:11:05,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 352 transitions. [2018-04-11 11:11:05,869 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 352 transitions. Word has length 60 [2018-04-11 11:11:05,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:11:05,869 INFO L459 AbstractCegarLoop]: Abstraction has 306 states and 352 transitions. [2018-04-11 11:11:05,869 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-11 11:11:05,869 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 352 transitions. [2018-04-11 11:11:05,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-11 11:11:05,870 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:11:05,870 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:11:05,870 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:11:05,870 INFO L82 PathProgramCache]: Analyzing trace with hash -943279002, now seen corresponding path program 2 times [2018-04-11 11:11:05,870 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:11:05,871 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:11:05,871 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:11:05,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 11:11:05,871 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:11:05,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:11:05,881 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:11:06,251 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:11:06,252 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:11:06,252 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:11:06,258 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 11:11:06,288 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 11:11:06,288 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 11:11:06,291 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:11:06,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:11:06,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:06,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:06,296 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:11:06,332 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:06,332 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:06,333 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:11:06,333 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:06,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:06,342 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-11 11:11:06,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, 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:11:06,392 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:11:06,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:06,393 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:06,403 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:11:06,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:11:06,405 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:06,407 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:06,414 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:11:06,415 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:45 [2018-04-11 11:11:06,493 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:06,493 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:06,494 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:06,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-11 11:11:06,494 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:06,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:06,499 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:38 [2018-04-11 11:11:06,538 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:06,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2018-04-11 11:11:06,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:11:06,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:06,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:06,563 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:06,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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:11:06,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 11:11:06,567 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:06,572 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:06,581 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:11:06,582 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:81, output treesize:67 [2018-04-11 11:11:06,679 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:06,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2018-04-11 11:11:06,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:06,693 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:06,693 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:06,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-04-11 11:11:06,694 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:06,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 11:11:06,704 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:100, output treesize:93 [2018-04-11 11:11:06,745 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 42 [2018-04-11 11:11:06,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:11:06,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:06,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:06,766 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 112 treesize of output 93 [2018-04-11 11:11:06,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:11:06,767 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:06,774 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:06,785 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:11:06,785 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:146, output treesize:80 [2018-04-11 11:11:06,855 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 67 treesize of output 45 [2018-04-11 11:11:06,856 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:11:06,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:06,861 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 27 treesize of output 16 [2018-04-11 11:11:06,861 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:06,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:06,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 11:11:06,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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:11:06,871 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:06,872 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:06,877 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:11:06,877 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:91, output treesize:18 [2018-04-11 11:11:06,931 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:11:06,948 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:11:06,948 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 37 [2018-04-11 11:11:06,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-11 11:11:06,949 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-11 11:11:06,949 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1266, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 11:11:06,949 INFO L87 Difference]: Start difference. First operand 306 states and 352 transitions. Second operand 38 states. [2018-04-11 11:11:09,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:11:09,782 INFO L93 Difference]: Finished difference Result 456 states and 507 transitions. [2018-04-11 11:11:09,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-11 11:11:09,782 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 60 [2018-04-11 11:11:09,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:11:09,783 INFO L225 Difference]: With dead ends: 456 [2018-04-11 11:11:09,783 INFO L226 Difference]: Without dead ends: 455 [2018-04-11 11:11:09,783 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=728, Invalid=4384, Unknown=0, NotChecked=0, Total=5112 [2018-04-11 11:11:09,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-04-11 11:11:09,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 320. [2018-04-11 11:11:09,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-04-11 11:11:09,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 367 transitions. [2018-04-11 11:11:09,785 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 367 transitions. Word has length 60 [2018-04-11 11:11:09,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:11:09,786 INFO L459 AbstractCegarLoop]: Abstraction has 320 states and 367 transitions. [2018-04-11 11:11:09,786 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-11 11:11:09,786 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 367 transitions. [2018-04-11 11:11:09,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-11 11:11:09,786 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:11:09,786 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:11:09,786 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:11:09,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1203795377, now seen corresponding path program 4 times [2018-04-11 11:11:09,786 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:11:09,786 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:11:09,787 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:11:09,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 11:11:09,787 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:11:09,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:11:09,793 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:11:10,010 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:11:10,010 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:11:10,010 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:11:10,014 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 11:11:10,031 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 11:11:10,031 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 11:11:10,033 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:11:10,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:11:10,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:10,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:10,036 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:11:10,068 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:10,068 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:10,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, 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:11:10,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:10,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:10,072 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-11 11:11:10,080 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:11:10,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:11:10,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:10,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:10,087 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:11:10,087 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2018-04-11 11:11:10,097 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:10,098 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:10,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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:11:10,098 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:10,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:10,101 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2018-04-11 11:11:10,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-04-11 11:11:10,130 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:11:10,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:10,133 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:10,137 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:11:10,138 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:32 [2018-04-11 11:11:10,198 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 17 [2018-04-11 11:11:10,199 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:10,204 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:11:10,204 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:61 [2018-04-11 11:11:10,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 73 [2018-04-11 11:11:10,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 82 treesize of output 81 [2018-04-11 11:11:10,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:10,261 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 51 treesize of output 66 [2018-04-11 11:11:10,261 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 11:11:10,278 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:11:10,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 11:11:10,290 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:78, output treesize:67 [2018-04-11 11:11:10,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-04-11 11:11:10,346 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:11:10,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-04-11 11:11:10,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:10,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:10,352 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:11:10,352 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:5 [2018-04-11 11:11:10,366 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:11:10,383 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:11:10,384 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 28 [2018-04-11 11:11:10,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-11 11:11:10,384 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-11 11:11:10,384 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=707, Unknown=0, NotChecked=0, Total=812 [2018-04-11 11:11:10,384 INFO L87 Difference]: Start difference. First operand 320 states and 367 transitions. Second operand 29 states. [2018-04-11 11:11:11,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:11:11,472 INFO L93 Difference]: Finished difference Result 465 states and 526 transitions. [2018-04-11 11:11:11,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 11:11:11,472 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 60 [2018-04-11 11:11:11,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:11:11,473 INFO L225 Difference]: With dead ends: 465 [2018-04-11 11:11:11,473 INFO L226 Difference]: Without dead ends: 465 [2018-04-11 11:11:11,473 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 43 SyntacticMatches, 9 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 834 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=556, Invalid=2524, Unknown=0, NotChecked=0, Total=3080 [2018-04-11 11:11:11,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2018-04-11 11:11:11,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 351. [2018-04-11 11:11:11,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-04-11 11:11:11,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 405 transitions. [2018-04-11 11:11:11,477 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 405 transitions. Word has length 60 [2018-04-11 11:11:11,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:11:11,477 INFO L459 AbstractCegarLoop]: Abstraction has 351 states and 405 transitions. [2018-04-11 11:11:11,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-11 11:11:11,477 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 405 transitions. [2018-04-11 11:11:11,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-11 11:11:11,478 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:11:11,478 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:11:11,478 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:11:11,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1203795376, now seen corresponding path program 3 times [2018-04-11 11:11:11,479 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:11:11,479 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:11:11,479 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:11:11,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 11:11:11,479 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:11:11,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:11:11,489 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:11:11,829 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:11:11,829 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:11:11,829 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:11:11,834 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 11:11:11,859 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-11 11:11:11,859 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 11:11:11,861 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:11:11,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:11:11,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:11,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:11,865 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:11:11,894 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:11,894 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:11,895 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:11:11,895 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:11,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:11,902 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-11 11:11:11,949 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:11:11,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:11:11,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:11,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:11,963 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:11:11,965 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:11:11,965 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:11,968 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:11,978 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:11:11,978 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:45 [2018-04-11 11:11:12,074 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:12,074 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:12,075 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:12,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2018-04-11 11:11:12,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:12,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:12,090 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:58, output treesize:64 [2018-04-11 11:11:12,153 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:12,156 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 46 treesize of output 47 [2018-04-11 11:11:12,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 11:11:12,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:12,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:12,201 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:12,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 33 [2018-04-11 11:11:12,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:11:12,205 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:12,209 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:12,221 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:11:12,222 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:97, output treesize:89 [2018-04-11 11:11:12,327 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:12,327 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:12,328 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:12,329 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:12,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 67 [2018-04-11 11:11:12,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:12,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2018-04-11 11:11:12,343 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:12,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:11:12,355 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:122, output treesize:113 [2018-04-11 11:11:12,426 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:12,426 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:12,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, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 100 [2018-04-11 11:11:12,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 11:11:12,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:12,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:12,461 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 28 treesize of output 39 [2018-04-11 11:11:12,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:11:12,463 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:12,467 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:12,480 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:11:12,481 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:139, output treesize:117 [2018-04-11 11:11:12,642 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 154 treesize of output 85 [2018-04-11 11:11:12,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2018-04-11 11:11:12,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:12,662 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 29 treesize of output 17 [2018-04-11 11:11:12,662 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:12,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2018-04-11 11:11:12,669 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:11:12,674 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:11:12,683 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 22 treesize of output 16 [2018-04-11 11:11:12,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-04-11 11:11:12,684 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:12,687 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:12,693 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:11:12,694 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:175, output treesize:20 [2018-04-11 11:11:12,767 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:11:12,784 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:11:12,784 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22] total 39 [2018-04-11 11:11:12,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-11 11:11:12,784 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-11 11:11:12,784 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1410, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 11:11:12,784 INFO L87 Difference]: Start difference. First operand 351 states and 405 transitions. Second operand 40 states. [2018-04-11 11:11:14,574 WARN L151 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 117 DAG size of output 107 [2018-04-11 11:11:16,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:11:16,331 INFO L93 Difference]: Finished difference Result 568 states and 638 transitions. [2018-04-11 11:11:16,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-11 11:11:16,331 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 60 [2018-04-11 11:11:16,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:11:16,332 INFO L225 Difference]: With dead ends: 568 [2018-04-11 11:11:16,332 INFO L226 Difference]: Without dead ends: 566 [2018-04-11 11:11:16,333 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1443 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=817, Invalid=5189, Unknown=0, NotChecked=0, Total=6006 [2018-04-11 11:11:16,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2018-04-11 11:11:16,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 371. [2018-04-11 11:11:16,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-04-11 11:11:16,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 429 transitions. [2018-04-11 11:11:16,336 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 429 transitions. Word has length 60 [2018-04-11 11:11:16,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:11:16,336 INFO L459 AbstractCegarLoop]: Abstraction has 371 states and 429 transitions. [2018-04-11 11:11:16,336 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-11 11:11:16,336 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 429 transitions. [2018-04-11 11:11:16,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-11 11:11:16,336 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:11:16,336 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:11:16,336 INFO L408 AbstractCegarLoop]: === Iteration 42 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:11:16,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1383042322, now seen corresponding path program 5 times [2018-04-11 11:11:16,337 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:11:16,337 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:11:16,337 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:11:16,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 11:11:16,337 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:11:16,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:11:16,344 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:11:16,633 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:11:16,633 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:11: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 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:11:16,639 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 11:11:16,661 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-04-11 11:11:16,661 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 11:11:16,663 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:11:16,706 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:16,707 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:16,707 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:11:16,707 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:16,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:16,711 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-04-11 11:11:16,757 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:11:16,759 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:11:16,759 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:16,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:16,769 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:11:16,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:11:16,771 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:16,772 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:16,779 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:11:16,779 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2018-04-11 11:11:16,887 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 23 treesize of output 24 [2018-04-11 11:11:16,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:11:16,889 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:16,892 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:16,905 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 23 treesize of output 30 [2018-04-11 11:11:16,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 11:11:16,906 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:16,910 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:16,916 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:11:16,917 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:58, output treesize:44 [2018-04-11 11:11:16,996 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 31 treesize of output 18 [2018-04-11 11:11:16,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:11:16,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:17,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:17,007 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:11:17,007 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:83, output treesize:69 [2018-04-11 11:11:17,188 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:17,188 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:11:17,190 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 80 treesize of output 80 [2018-04-11 11:11:17,191 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:11:17,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 33 [2018-04-11 11:11:17,192 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:11:17,200 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:11:17,200 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:11:17,200 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:17,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:11:17,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-04-11 11:11:17,218 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:11:17,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-04-11 11:11:17,219 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:17,224 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:11:17,224 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:17,226 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:17,231 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:11:17,231 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:102, output treesize:17 [2018-04-11 11:11:17,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 11:11:17,274 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:11:17,274 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:11:17,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:17,276 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:17,279 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:11:17,279 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:3 [2018-04-11 11:11:17,290 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:11:17,307 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:11:17,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 25] total 42 [2018-04-11 11:11:17,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-11 11:11:17,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-11 11:11:17,307 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1557, Unknown=0, NotChecked=0, Total=1722 [2018-04-11 11:11:17,308 INFO L87 Difference]: Start difference. First operand 371 states and 429 transitions. Second operand 42 states. [2018-04-11 11:11:18,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:11:18,460 INFO L93 Difference]: Finished difference Result 430 states and 487 transitions. [2018-04-11 11:11:18,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 11:11:18,460 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 62 [2018-04-11 11:11:18,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:11:18,461 INFO L225 Difference]: With dead ends: 430 [2018-04-11 11:11:18,461 INFO L226 Difference]: Without dead ends: 430 [2018-04-11 11:11:18,461 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 997 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=470, Invalid=3436, Unknown=0, NotChecked=0, Total=3906 [2018-04-11 11:11:18,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2018-04-11 11:11:18,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 379. [2018-04-11 11:11:18,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-04-11 11:11:18,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 437 transitions. [2018-04-11 11:11:18,464 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 437 transitions. Word has length 62 [2018-04-11 11:11:18,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:11:18,464 INFO L459 AbstractCegarLoop]: Abstraction has 379 states and 437 transitions. [2018-04-11 11:11:18,464 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-11 11:11:18,464 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 437 transitions. [2018-04-11 11:11:18,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-11 11:11:18,464 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:11:18,464 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:11:18,464 INFO L408 AbstractCegarLoop]: === Iteration 43 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:11:18,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1746950869, now seen corresponding path program 2 times [2018-04-11 11:11:18,464 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:11:18,465 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:11:18,465 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:11:18,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 11:11:18,465 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:11:18,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:11:18,471 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:11:18,751 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:11:18,751 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:11:18,751 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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:11:18,756 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 11:11:18,775 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 11:11:18,775 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 11:11:18,777 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:11:18,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 11:11:18,779 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:18,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:18,781 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:11:18,807 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:18,807 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:18,807 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:11:18,808 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:18,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:18,811 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-04-11 11:11:18,846 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:11:18,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, 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:11:18,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:18,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:18,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:11:18,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 11:11:18,856 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:18,857 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:18,862 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:11:18,862 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2018-04-11 11:11:18,927 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 23 treesize of output 30 [2018-04-11 11:11:18,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 11:11:18,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:18,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:18,940 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 38 treesize of output 39 [2018-04-11 11:11:18,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:11:18,941 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:18,944 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:18,950 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:11:18,950 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:55, output treesize:29 [2018-04-11 11:11:18,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2018-04-11 11:11:18,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-04-11 11:11:18,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:18,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:19,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:19,003 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:64, output treesize:50 [2018-04-11 11:11:19,118 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:19,119 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:11:19,120 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 64 treesize of output 66 [2018-04-11 11:11:19,121 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:11:19,121 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 52 treesize of output 32 [2018-04-11 11:11:19,122 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:11:19,127 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:11:19,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-11 11:11:19,127 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:19,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:11:19,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-04-11 11:11:19,143 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:11:19,143 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:11:19,143 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:19,148 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:11:19,148 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:11:19,148 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:19,151 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:19,154 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:11:19,154 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:83, output treesize:7 [2018-04-11 11:11:19,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 11:11:19,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 11 treesize of output 3 [2018-04-11 11:11:19,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:19,174 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:19,175 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:11:19,175 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-04-11 11:11:19,185 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:11:19,202 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:11:19,202 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 36 [2018-04-11 11:11:19,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-11 11:11:19,202 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-11 11:11:19,202 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1147, Unknown=0, NotChecked=0, Total=1260 [2018-04-11 11:11:19,203 INFO L87 Difference]: Start difference. First operand 379 states and 437 transitions. Second operand 36 states. [2018-04-11 11:11:20,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:11:20,373 INFO L93 Difference]: Finished difference Result 428 states and 485 transitions. [2018-04-11 11:11:20,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 11:11:20,373 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 62 [2018-04-11 11:11:20,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:11:20,374 INFO L225 Difference]: With dead ends: 428 [2018-04-11 11:11:20,374 INFO L226 Difference]: Without dead ends: 428 [2018-04-11 11:11:20,374 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 850 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=400, Invalid=2792, Unknown=0, NotChecked=0, Total=3192 [2018-04-11 11:11:20,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-04-11 11:11:20,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 374. [2018-04-11 11:11:20,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-04-11 11:11:20,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 432 transitions. [2018-04-11 11:11:20,377 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 432 transitions. Word has length 62 [2018-04-11 11:11:20,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:11:20,377 INFO L459 AbstractCegarLoop]: Abstraction has 374 states and 432 transitions. [2018-04-11 11:11:20,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-11 11:11:20,377 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 432 transitions. [2018-04-11 11:11:20,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-11 11:11:20,378 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:11:20,378 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:11:20,378 INFO L408 AbstractCegarLoop]: === Iteration 44 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:11:20,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1109468942, now seen corresponding path program 3 times [2018-04-11 11:11:20,378 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:11:20,378 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:11:20,378 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:11:20,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 11:11:20,378 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:11:20,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:11:20,384 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:11:20,685 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:11:20,685 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:11:20,685 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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:11:20,690 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 11:11:20,708 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-11 11:11:20,708 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 11:11:20,710 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:11:20,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:11:20,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:20,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:20,714 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:11:20,748 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:20,749 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:20,749 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:11:20,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:20,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:20,753 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-04-11 11:11:20,788 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:11:20,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:11:20,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:20,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:20,797 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:11:20,798 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:11:20,798 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:20,799 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:20,804 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:11:20,804 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2018-04-11 11:11:20,861 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:20,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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:11:20,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 11:11:20,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:20,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:20,875 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:20,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2018-04-11 11:11:20,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:11:20,878 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:20,882 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:20,888 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:11:20,888 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:59, output treesize:33 [2018-04-11 11:11:20,931 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 53 treesize of output 36 [2018-04-11 11:11:20,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-04-11 11:11:20,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:20,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:20,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:20,937 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:72, output treesize:54 [2018-04-11 11:11:21,059 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 70 treesize of output 57 [2018-04-11 11:11:21,061 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 45 treesize of output 39 [2018-04-11 11:11:21,061 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:11:21,067 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:11:21,067 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 33 treesize of output 29 [2018-04-11 11:11:21,067 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:21,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:11:21,078 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 41 treesize of output 35 [2018-04-11 11:11:21,079 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 24 treesize of output 18 [2018-04-11 11:11:21,079 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:11:21,084 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:11:21,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-11 11:11:21,084 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:21,087 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:21,090 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:11:21,090 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:87, output treesize:7 [2018-04-11 11:11:21,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 11:11:21,107 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:11:21,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:21,108 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:21,108 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:11:21,108 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-04-11 11:11:21,129 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:11:21,146 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:11:21,146 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 37 [2018-04-11 11:11:21,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-11 11:11:21,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-11 11:11:21,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1221, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 11:11:21,146 INFO L87 Difference]: Start difference. First operand 374 states and 432 transitions. Second operand 37 states. [2018-04-11 11:11:22,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:11:22,619 INFO L93 Difference]: Finished difference Result 420 states and 476 transitions. [2018-04-11 11:11:22,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 11:11:22,619 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 62 [2018-04-11 11:11:22,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:11:22,620 INFO L225 Difference]: With dead ends: 420 [2018-04-11 11:11:22,620 INFO L226 Difference]: Without dead ends: 420 [2018-04-11 11:11:22,620 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 766 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=399, Invalid=2907, Unknown=0, NotChecked=0, Total=3306 [2018-04-11 11:11:22,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2018-04-11 11:11:22,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 371. [2018-04-11 11:11:22,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-04-11 11:11:22,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 428 transitions. [2018-04-11 11:11:22,623 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 428 transitions. Word has length 62 [2018-04-11 11:11:22,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:11:22,623 INFO L459 AbstractCegarLoop]: Abstraction has 371 states and 428 transitions. [2018-04-11 11:11:22,623 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-11 11:11:22,623 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 428 transitions. [2018-04-11 11:11:22,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-11 11:11:22,623 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:11:22,623 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:11:22,624 INFO L408 AbstractCegarLoop]: === Iteration 45 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:11:22,624 INFO L82 PathProgramCache]: Analyzing trace with hash -677357542, now seen corresponding path program 6 times [2018-04-11 11:11:22,624 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:11:22,624 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:11:22,624 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:11:22,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 11:11:22,625 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:11:22,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:11:22,631 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:11:22,796 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:11:22,797 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:11:22,797 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 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:11:22,801 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 11:11:22,821 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-04-11 11:11:22,821 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 11:11:22,823 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:11:22,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:11:22,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:22,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:22,826 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:11:22,849 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:22,850 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:22,850 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:11:22,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:22,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:22,853 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-11 11:11:22,861 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:11:22,862 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:11:22,862 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:22,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:22,867 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:11:22,867 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-04-11 11:11:22,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 14 [2018-04-11 11:11:22,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:11:22,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:22,946 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:22,954 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:22,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2018-04-11 11:11:22,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:11:22,957 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:22,962 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:22,968 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:11:22,968 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:37 [2018-04-11 11:11:22,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2018-04-11 11:11:22,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-04-11 11:11:22,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:22,992 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:22,996 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:11:22,996 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:24 [2018-04-11 11:11:23,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 11:11:23,061 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:23,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:23,067 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:32 [2018-04-11 11:11:23,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 41 [2018-04-11 11:11:23,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-04-11 11:11:23,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:23,147 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:11:23,148 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 27 treesize of output 27 [2018-04-11 11:11:23,148 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:11:23,160 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:11:23,173 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 2 xjuncts. [2018-04-11 11:11:23,174 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:45, output treesize:69 [2018-04-11 11:11:23,248 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 19 treesize of output 15 [2018-04-11 11:11:23,249 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:11:23,249 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:11:23,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:23,251 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:23,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:11:23,256 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:11 [2018-04-11 11:11:23,277 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:11:23,293 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:11:23,293 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 34 [2018-04-11 11:11:23,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-11 11:11:23,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-11 11:11:23,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1051, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 11:11:23,294 INFO L87 Difference]: Start difference. First operand 371 states and 428 transitions. Second operand 35 states. [2018-04-11 11:11:24,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:11:24,361 INFO L93 Difference]: Finished difference Result 447 states and 508 transitions. [2018-04-11 11:11:24,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-11 11:11:24,361 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 63 [2018-04-11 11:11:24,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:11:24,362 INFO L225 Difference]: With dead ends: 447 [2018-04-11 11:11:24,362 INFO L226 Difference]: Without dead ends: 447 [2018-04-11 11:11:24,362 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1025 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=652, Invalid=3254, Unknown=0, NotChecked=0, Total=3906 [2018-04-11 11:11:24,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-04-11 11:11:24,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 387. [2018-04-11 11:11:24,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-04-11 11:11:24,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 446 transitions. [2018-04-11 11:11:24,365 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 446 transitions. Word has length 63 [2018-04-11 11:11:24,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:11:24,365 INFO L459 AbstractCegarLoop]: Abstraction has 387 states and 446 transitions. [2018-04-11 11:11:24,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-11 11:11:24,365 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 446 transitions. [2018-04-11 11:11:24,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-11 11:11:24,365 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:11:24,365 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:11:24,365 INFO L408 AbstractCegarLoop]: === Iteration 46 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:11:24,366 INFO L82 PathProgramCache]: Analyzing trace with hash -677357541, now seen corresponding path program 4 times [2018-04-11 11:11:24,366 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:11:24,366 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:11:24,366 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:11:24,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 11:11:24,366 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:11:24,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:11:24,373 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:11:24,610 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:11:24,610 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:11:24,610 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 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:11:24,615 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 11:11:24,636 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 11:11:24,637 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 11:11:24,638 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:11:24,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 11:11:24,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:24,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:24,642 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:11:24,678 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:24,679 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:24,679 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:11:24,679 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:24,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:24,683 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-04-11 11:11:24,721 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:11:24,722 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:11:24,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:24,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:24,731 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:11:24,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:11:24,732 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:24,733 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:24,740 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:11:24,740 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:34 [2018-04-11 11:11:24,798 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:24,799 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:24,799 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:11:24,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:24,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:24,804 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:30 [2018-04-11 11:11:24,838 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:24,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-11 11:11:24,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:11:24,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:24,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:24,857 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:24,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2018-04-11 11:11:24,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:11:24,861 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:24,864 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:24,873 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:11:24,873 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:73, output treesize:53 [2018-04-11 11:11:24,964 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:24,964 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:24,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-04-11 11:11:24,965 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:24,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2018-04-11 11:11:24,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:24,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 11:11:24,984 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:82, output treesize:75 [2018-04-11 11:11:25,024 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 41 treesize of output 42 [2018-04-11 11:11:25,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:11:25,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:25,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:25,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 90 [2018-04-11 11:11:25,062 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 74 treesize of output 79 [2018-04-11 11:11:25,062 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 11:11:25,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 80 [2018-04-11 11:11:25,094 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:25,112 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:11:25,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 11:11:25,133 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:128, output treesize:104 [2018-04-11 11:11:25,224 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 35 treesize of output 27 [2018-04-11 11:11:25,225 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:11:25,226 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 27 treesize of output 19 [2018-04-11 11:11:25,226 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:25,229 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:25,236 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 13 [2018-04-11 11:11:25,237 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:11:25,238 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:11:25,238 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:25,239 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:25,245 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:11:25,245 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:62, output treesize:18 [2018-04-11 11:11:25,292 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:11:25,309 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:11:25,309 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 38 [2018-04-11 11:11:25,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-11 11:11:25,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-11 11:11:25,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1340, Unknown=0, NotChecked=0, Total=1482 [2018-04-11 11:11:25,310 INFO L87 Difference]: Start difference. First operand 387 states and 446 transitions. Second operand 39 states. [2018-04-11 11:11:27,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:11:27,275 INFO L93 Difference]: Finished difference Result 504 states and 563 transitions. [2018-04-11 11:11:27,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 11:11:27,275 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 63 [2018-04-11 11:11:27,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:11:27,276 INFO L225 Difference]: With dead ends: 504 [2018-04-11 11:11:27,276 INFO L226 Difference]: Without dead ends: 503 [2018-04-11 11:11:27,276 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1108 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=677, Invalid=4015, Unknown=0, NotChecked=0, Total=4692 [2018-04-11 11:11:27,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2018-04-11 11:11:27,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 392. [2018-04-11 11:11:27,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-04-11 11:11:27,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 451 transitions. [2018-04-11 11:11:27,279 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 451 transitions. Word has length 63 [2018-04-11 11:11:27,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:11:27,279 INFO L459 AbstractCegarLoop]: Abstraction has 392 states and 451 transitions. [2018-04-11 11:11:27,279 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-11 11:11:27,279 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 451 transitions. [2018-04-11 11:11:27,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-11 11:11:27,279 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:11:27,279 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:11:27,280 INFO L408 AbstractCegarLoop]: === Iteration 47 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:11:27,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1171584603, now seen corresponding path program 1 times [2018-04-11 11:11:27,280 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:11:27,280 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:11:27,280 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:11:27,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 11:11:27,280 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:11:27,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:11:27,287 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:11:27,544 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:11:27,544 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:11:27,544 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 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:11:27,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:11:27,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:11:27,565 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:11:27,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:11:27,567 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:27,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:27,568 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 11:11:27,599 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:11:27,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:11:27,600 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:27,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:27,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:27,604 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-04-11 11:11:27,619 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:27,619 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:27,619 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:11:27,620 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:27,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:27,623 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2018-04-11 11:11:27,651 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:11:27,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:11:27,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:27,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:27,657 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:11:27,657 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:29 [2018-04-11 11:11:27,708 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:27,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 26 [2018-04-11 11:11:27,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:11:27,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:27,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:27,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:27,719 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:45 [2018-04-11 11:11:27,741 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:27,741 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:27,741 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:11:27,742 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:27,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:27,748 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:54 [2018-04-11 11:11:27,794 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:27,796 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 46 treesize of output 47 [2018-04-11 11:11:27,797 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:11:27,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:27,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:27,808 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:11:27,808 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:66 [2018-04-11 11:11:27,915 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:27,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 106 [2018-04-11 11:11:27,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 76 [2018-04-11 11:11:27,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:27,971 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:27,986 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 54 treesize of output 71 [2018-04-11 11:11:27,987 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 11:11:28,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:11:28,019 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:11:28,019 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:95, output treesize:215 [2018-04-11 11:11:28,092 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:28,093 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:28,094 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:28,094 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 108 treesize of output 117 [2018-04-11 11:11:28,094 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:28,118 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:28,118 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:28,119 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:28,119 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:28,120 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 100 treesize of output 109 [2018-04-11 11:11:28,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:28,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 11:11:28,141 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:209, output treesize:195 [2018-04-11 11:11:28,237 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:28,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 109 [2018-04-11 11:11:28,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 124 [2018-04-11 11:11:28,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:28,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:28,305 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:28,306 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:11:28,307 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:28,308 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 106 treesize of output 84 [2018-04-11 11:11:28,310 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 50 treesize of output 42 [2018-04-11 11:11:28,310 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:28,317 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:28,334 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 2 xjuncts. [2018-04-11 11:11:28,335 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:221, output treesize:180 [2018-04-11 11:11:28,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 61 [2018-04-11 11:11:28,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 13 [2018-04-11 11:11:28,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:28,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2018-04-11 11:11:28,389 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:11:28,393 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:11:28,411 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 143 treesize of output 95 [2018-04-11 11:11:28,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 54 [2018-04-11 11:11:28,413 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:11:28,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 69 [2018-04-11 11:11:28,430 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:11:28,464 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 69 treesize of output 54 [2018-04-11 11:11:28,464 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:28,482 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 54 treesize of output 46 [2018-04-11 11:11:28,482 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:11:28,499 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 54 treesize of output 42 [2018-04-11 11:11:28,499 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:11:28,515 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-11 11:11:28,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 10 dim-0 vars, and 3 xjuncts. [2018-04-11 11:11:28,535 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:228, output treesize:116 [2018-04-11 11:11:28,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-04-11 11:11:28,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:11:28,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:28,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:28,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-11 11:11:28,622 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:38, output treesize:34 [2018-04-11 11:11:28,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2018-04-11 11:11:28,684 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:11:28,684 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:28,689 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:11:28,689 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:28,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 11:11:28,692 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:28,693 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:28,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:28,695 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:41, output treesize:3 [2018-04-11 11:11:28,727 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:11:28,744 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:11:28,744 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 52 [2018-04-11 11:11:28,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-04-11 11:11:28,744 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-04-11 11:11:28,744 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=2421, Unknown=0, NotChecked=0, Total=2652 [2018-04-11 11:11:28,744 INFO L87 Difference]: Start difference. First operand 392 states and 451 transitions. Second operand 52 states. [2018-04-11 11:11:32,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:11:32,860 INFO L93 Difference]: Finished difference Result 646 states and 723 transitions. [2018-04-11 11:11:32,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-04-11 11:11:32,886 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 63 [2018-04-11 11:11:32,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:11:32,888 INFO L225 Difference]: With dead ends: 646 [2018-04-11 11:11:32,888 INFO L226 Difference]: Without dead ends: 640 [2018-04-11 11:11:32,888 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4078 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1956, Invalid=12086, Unknown=0, NotChecked=0, Total=14042 [2018-04-11 11:11:32,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2018-04-11 11:11:32,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 377. [2018-04-11 11:11:32,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-04-11 11:11:32,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 433 transitions. [2018-04-11 11:11:32,891 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 433 transitions. Word has length 63 [2018-04-11 11:11:32,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:11:32,891 INFO L459 AbstractCegarLoop]: Abstraction has 377 states and 433 transitions. [2018-04-11 11:11:32,891 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-04-11 11:11:32,891 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 433 transitions. [2018-04-11 11:11:32,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-11 11:11:32,891 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:11:32,891 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:11:32,891 INFO L408 AbstractCegarLoop]: === Iteration 48 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:11:32,891 INFO L82 PathProgramCache]: Analyzing trace with hash -50957748, now seen corresponding path program 5 times [2018-04-11 11:11:32,891 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:11:32,892 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:11:32,892 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:11:32,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:11:32,892 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:11:32,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:11:32,900 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:11:33,388 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:11:33,388 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:11:33,388 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 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:11:33,393 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 11:11:33,442 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-04-11 11:11:33,442 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 11:11:33,445 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:11:33,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:11:33,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:33,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:33,449 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:11:33,500 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:33,500 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:33,500 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:11:33,501 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:33,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:11:33,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:33,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:33,516 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:37 [2018-04-11 11:11:33,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 8 [2018-04-11 11:11:33,562 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:33,574 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:11:33,576 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:11:33,576 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:33,577 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:33,587 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:11:33,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 11:11:33,589 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:33,590 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:33,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:33,598 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:70, output treesize:48 [2018-04-11 11:11:33,720 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:33,721 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:33,721 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:33,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-04-11 11:11:33,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:33,730 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:11:33,730 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:71, output treesize:64 [2018-04-11 11:11:33,786 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:33,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-04-11 11:11:33,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 11:11:33,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:33,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:33,806 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:33,808 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:33,808 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 58 treesize of output 70 [2018-04-11 11:11:33,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-11 11:11:33,811 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:33,817 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:33,826 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:11:33,826 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:90, output treesize:66 [2018-04-11 11:11:33,925 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:33,927 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:33,947 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 130 treesize of output 109 [2018-04-11 11:11:33,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:11:33,949 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:33,960 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:33,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 57 [2018-04-11 11:11:33,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:11:33,982 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:33,987 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:33,999 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:11:33,999 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:160, output treesize:86 [2018-04-11 11:11:34,119 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 22 [2018-04-11 11:11:34,121 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:11:34,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-04-11 11:11:34,121 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:34,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:34,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-11 11:11:34,133 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:107, output treesize:86 [2018-04-11 11:11:34,267 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:34,267 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:11:34,268 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:34,268 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 71 treesize of output 67 [2018-04-11 11:11:34,271 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:11:34,275 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 41 [2018-04-11 11:11:34,276 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:11:34,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-04-11 11:11:34,286 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:34,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:34,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:34,296 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:95, output treesize:5 [2018-04-11 11:11:34,361 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:11:34,378 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:11:34,378 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 24] total 51 [2018-04-11 11:11:34,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-04-11 11:11:34,379 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-04-11 11:11:34,379 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=2385, Unknown=0, NotChecked=0, Total=2550 [2018-04-11 11:11:34,379 INFO L87 Difference]: Start difference. First operand 377 states and 433 transitions. Second operand 51 states. [2018-04-11 11:11:37,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:11:37,825 INFO L93 Difference]: Finished difference Result 477 states and 533 transitions. [2018-04-11 11:11:37,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-11 11:11:37,825 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 65 [2018-04-11 11:11:37,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:11:37,826 INFO L225 Difference]: With dead ends: 477 [2018-04-11 11:11:37,826 INFO L226 Difference]: Without dead ends: 477 [2018-04-11 11:11:37,826 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1701 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=861, Invalid=6449, Unknown=0, NotChecked=0, Total=7310 [2018-04-11 11:11:37,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2018-04-11 11:11:37,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 387. [2018-04-11 11:11:37,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-04-11 11:11:37,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 443 transitions. [2018-04-11 11:11:37,828 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 443 transitions. Word has length 65 [2018-04-11 11:11:37,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:11:37,829 INFO L459 AbstractCegarLoop]: Abstraction has 387 states and 443 transitions. [2018-04-11 11:11:37,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-04-11 11:11:37,829 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 443 transitions. [2018-04-11 11:11:37,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-11 11:11:37,829 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:11:37,829 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:11:37,829 INFO L408 AbstractCegarLoop]: === Iteration 49 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:11:37,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1626816862, now seen corresponding path program 6 times [2018-04-11 11:11:37,829 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:11:37,829 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:11:37,830 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:11:37,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 11:11:37,830 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:11:37,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:11:37,837 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:11:38,171 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:11:38,171 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:11:38,171 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:11:38,176 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 11:11:38,195 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-04-11 11:11:38,196 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 11:11:38,198 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:11:38,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:11:38,199 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:38,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:38,201 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:11:38,231 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:38,231 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:38,232 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:11:38,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:38,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:38,238 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-11 11:11:38,282 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:11:38,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:11:38,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:38,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:38,295 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:11:38,296 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:11:38,296 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:38,297 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:38,305 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:11:38,305 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:45 [2018-04-11 11:11:38,391 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:38,391 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:38,392 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:38,392 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:11:38,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:38,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:38,398 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:37 [2018-04-11 11:11:38,425 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 23 treesize of output 30 [2018-04-11 11:11:38,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 11:11:38,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:38,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:38,441 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:38,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, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 50 [2018-04-11 11:11:38,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-11 11:11:38,443 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:38,447 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:38,455 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:11:38,455 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:63, output treesize:45 [2018-04-11 11:11:38,491 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:38,493 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:38,496 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 130 treesize of output 109 [2018-04-11 11:11:38,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:11:38,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:38,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:38,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2018-04-11 11:11:38,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 22 treesize of output 21 [2018-04-11 11:11:38,518 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:38,521 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:38,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:38,528 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:142, output treesize:68 [2018-04-11 11:11:38,565 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 13 [2018-04-11 11:11:38,566 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:11:38,567 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:11:38,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:38,568 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:38,572 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:11:38,572 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:79, output treesize:66 [2018-04-11 11:11:38,627 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:11:38,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:38,628 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:38,628 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 69 treesize of output 63 [2018-04-11 11:11:38,631 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:11:38,635 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 41 [2018-04-11 11:11:38,635 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:11:38,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-04-11 11:11:38,644 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:38,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:38,649 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:11:38,649 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:75, output treesize:5 [2018-04-11 11:11:38,670 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:11:38,686 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:11:38,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 34 [2018-04-11 11:11:38,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-11 11:11:38,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-11 11:11:38,687 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1063, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 11:11:38,687 INFO L87 Difference]: Start difference. First operand 387 states and 443 transitions. Second operand 35 states. [2018-04-11 11:11:40,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:11:40,223 INFO L93 Difference]: Finished difference Result 479 states and 537 transitions. [2018-04-11 11:11:40,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-11 11:11:40,223 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 65 [2018-04-11 11:11:40,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:11:40,224 INFO L225 Difference]: With dead ends: 479 [2018-04-11 11:11:40,224 INFO L226 Difference]: Without dead ends: 479 [2018-04-11 11:11:40,224 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 45 SyntacticMatches, 10 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1024 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=542, Invalid=3240, Unknown=0, NotChecked=0, Total=3782 [2018-04-11 11:11:40,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2018-04-11 11:11:40,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 392. [2018-04-11 11:11:40,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-04-11 11:11:40,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 450 transitions. [2018-04-11 11:11:40,227 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 450 transitions. Word has length 65 [2018-04-11 11:11:40,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:11:40,227 INFO L459 AbstractCegarLoop]: Abstraction has 392 states and 450 transitions. [2018-04-11 11:11:40,227 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-11 11:11:40,227 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 450 transitions. [2018-04-11 11:11:40,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-11 11:11:40,227 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:11:40,227 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:11:40,227 INFO L408 AbstractCegarLoop]: === Iteration 50 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:11:40,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1626816861, now seen corresponding path program 4 times [2018-04-11 11:11:40,227 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:11:40,228 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:11:40,228 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:11:40,228 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 11:11:40,228 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:11:40,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:11:40,235 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:11:40,814 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:11:40,814 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:11:40,814 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 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:11:40,819 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 11:11:40,837 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 11:11:40,837 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 11:11:40,840 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:11:40,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 11:11:40,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:40,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:40,846 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:11:40,908 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:40,909 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:40,909 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:11:40,909 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:40,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:40,916 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-11 11:11:40,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:11:40,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:11:40,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:40,982 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:40,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:11:40,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:11:40,994 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:40,996 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:41,004 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:11:41,005 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:45 [2018-04-11 11:11:41,135 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:41,135 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:41,136 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:41,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-11 11:11:41,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:41,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:41,145 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:58, output treesize:51 [2018-04-11 11:11:41,213 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:41,216 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:41,217 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 37 treesize of output 49 [2018-04-11 11:11:41,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-11 11:11:41,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:41,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:41,246 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:41,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 33 [2018-04-11 11:11:41,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:11:41,250 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:41,255 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:41,266 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:11:41,266 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:74, output treesize:65 [2018-04-11 11:11:41,417 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:41,422 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 88 [2018-04-11 11:11:41,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:11:41,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:41,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:41,446 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:41,446 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:41,451 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 115 treesize of output 108 [2018-04-11 11:11:41,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:11:41,452 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:41,461 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:41,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:11:41,474 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:154, output treesize:81 [2018-04-11 11:11:41,739 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:41,740 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:11:41,740 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:41,741 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 91 treesize of output 85 [2018-04-11 11:11:41,744 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:11:41,748 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 39 [2018-04-11 11:11:41,748 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:11:41,763 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:11:41,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2018-04-11 11:11:41,763 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:11:41,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:11:41,785 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 42 treesize of output 36 [2018-04-11 11:11:41,787 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:11:41,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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:11:41,787 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:41,793 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:11:41,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-04-11 11:11:41,794 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:41,797 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:41,806 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:11:41,806 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:126, output treesize:9 [2018-04-11 11:11:41,869 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:11:41,886 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:11:41,886 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 47 [2018-04-11 11:11:41,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-04-11 11:11:41,886 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-04-11 11:11:41,886 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=2087, Unknown=0, NotChecked=0, Total=2256 [2018-04-11 11:11:41,886 INFO L87 Difference]: Start difference. First operand 392 states and 450 transitions. Second operand 48 states. [2018-04-11 11:11:45,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:11:45,964 INFO L93 Difference]: Finished difference Result 524 states and 585 transitions. [2018-04-11 11:11:45,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-11 11:11:45,965 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 65 [2018-04-11 11:11:45,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:11:45,966 INFO L225 Difference]: With dead ends: 524 [2018-04-11 11:11:45,966 INFO L226 Difference]: Without dead ends: 524 [2018-04-11 11:11:45,966 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1739 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=911, Invalid=6571, Unknown=0, NotChecked=0, Total=7482 [2018-04-11 11:11:45,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2018-04-11 11:11:45,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 396. [2018-04-11 11:11:45,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-04-11 11:11:45,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 455 transitions. [2018-04-11 11:11:45,969 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 455 transitions. Word has length 65 [2018-04-11 11:11:45,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:11:45,969 INFO L459 AbstractCegarLoop]: Abstraction has 396 states and 455 transitions. [2018-04-11 11:11:45,969 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-04-11 11:11:45,969 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 455 transitions. [2018-04-11 11:11:45,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-04-11 11:11:45,969 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:11:45,969 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:11:45,970 INFO L408 AbstractCegarLoop]: === Iteration 51 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:11:45,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1218216714, now seen corresponding path program 7 times [2018-04-11 11:11:45,970 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:11:45,970 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:11:45,970 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:11:45,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 11:11:45,970 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:11:45,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:11:45,976 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:11:46,376 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:11:46,376 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:11:46,376 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 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:11:46,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:11:46,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:11:46,402 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:11:46,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:11:46,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:46,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:46,406 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:11:46,443 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:46,443 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:46,444 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:11:46,444 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:46,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:46,449 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-11 11:11:46,492 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:11:46,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:11:46,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:46,494 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:46,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, 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:11:46,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, 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:11:46,504 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:46,505 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:46,512 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:11:46,512 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:45 [2018-04-11 11:11:46,595 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:46,595 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:46,596 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:46,596 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:11:46,596 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:46,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:46,602 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:37 [2018-04-11 11:11:46,622 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 23 treesize of output 30 [2018-04-11 11:11:46,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 11:11:46,623 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:46,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:46,637 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:46,637 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 38 treesize of output 50 [2018-04-11 11:11:46,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-11 11:11:46,638 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:46,642 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:46,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:46,650 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:63, output treesize:45 [2018-04-11 11:11:46,736 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:46,739 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:46,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 61 [2018-04-11 11:11:46,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:11:46,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:46,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:46,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 36 [2018-04-11 11:11:46,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-11 11:11:46,761 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:46,764 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:46,773 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:11:46,773 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:76, output treesize:68 [2018-04-11 11:11:46,973 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 61 treesize of output 45 [2018-04-11 11:11:46,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-04-11 11:11:46,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:46,979 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:11:46,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 11:11:46,979 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:46,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:46,987 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:11:46,987 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:131, output treesize:74 [2018-04-11 11:11:47,073 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:47,074 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:47,074 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:11:47,075 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:47,075 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 71 treesize of output 75 [2018-04-11 11:11:47,076 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:11:47,080 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 36 [2018-04-11 11:11:47,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:47,084 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:11:47,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-04-11 11:11:47,085 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:47,087 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:47,091 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:11:47,092 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:83, output treesize:5 [2018-04-11 11:11:47,117 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:11:47,133 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:11:47,133 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 29] total 41 [2018-04-11 11:11:47,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-11 11:11:47,134 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-11 11:11:47,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1566, Unknown=0, NotChecked=0, Total=1722 [2018-04-11 11:11:47,134 INFO L87 Difference]: Start difference. First operand 396 states and 455 transitions. Second operand 42 states. [2018-04-11 11:11:49,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:11:49,593 INFO L93 Difference]: Finished difference Result 485 states and 545 transitions. [2018-04-11 11:11:49,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-11 11:11:49,594 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 68 [2018-04-11 11:11:49,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:11:49,595 INFO L225 Difference]: With dead ends: 485 [2018-04-11 11:11:49,595 INFO L226 Difference]: Without dead ends: 485 [2018-04-11 11:11:49,595 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 41 SyntacticMatches, 9 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1933 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=896, Invalid=6076, Unknown=0, NotChecked=0, Total=6972 [2018-04-11 11:11:49,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-04-11 11:11:49,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 401. [2018-04-11 11:11:49,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-04-11 11:11:49,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 460 transitions. [2018-04-11 11:11:49,597 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 460 transitions. Word has length 68 [2018-04-11 11:11:49,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:11:49,597 INFO L459 AbstractCegarLoop]: Abstraction has 401 states and 460 transitions. [2018-04-11 11:11:49,598 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-11 11:11:49,598 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 460 transitions. [2018-04-11 11:11:49,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-04-11 11:11:49,598 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:11:49,598 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:11:49,598 INFO L408 AbstractCegarLoop]: === Iteration 52 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:11:49,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1218216715, now seen corresponding path program 5 times [2018-04-11 11:11:49,598 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:11:49,598 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:11:49,599 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:11:49,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:11:49,599 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:11:49,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:11:49,609 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:11:50,083 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:11:50,084 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:11:50,084 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 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:11:50,088 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 11:11:50,121 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-04-11 11:11:50,121 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 11:11:50,123 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:11:50,161 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:50,162 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:50,162 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:11:50,162 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:50,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:50,167 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-11 11:11:50,205 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:11:50,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:11:50,206 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:50,207 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:50,217 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:11:50,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, 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:11:50,218 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:50,219 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:50,227 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:11:50,227 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:45 [2018-04-11 11:11:50,311 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:50,311 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:50,312 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:50,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-04-11 11:11:50,312 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:50,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:50,319 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:65, output treesize:58 [2018-04-11 11:11:50,366 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:50,369 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:11:50,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 11:11:50,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:50,376 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:50,389 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:50,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-04-11 11:11:50,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 11:11:50,393 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:50,397 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:50,407 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:11:50,408 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:81, output treesize:82 [2018-04-11 11:11:50,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 196 [2018-04-11 11:11:50,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-04-11 11:11:50,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:50,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:50,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 144 [2018-04-11 11:11:50,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-04-11 11:11:50,572 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:50,580 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:50,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:50,590 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:220, output treesize:117 [2018-04-11 11:11:50,782 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:50,783 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:11:50,784 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:50,784 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 135 treesize of output 125 [2018-04-11 11:11:50,787 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:11:50,791 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 53 [2018-04-11 11:11:50,791 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:11:50,808 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:11:50,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 49 [2018-04-11 11:11:50,809 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:11:50,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:11:50,831 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 43 treesize of output 37 [2018-04-11 11:11:50,832 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:11:50,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-04-11 11:11:50,833 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:11:50,838 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:11:50,839 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:11:50,839 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:50,841 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:50,848 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:11:50,848 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:165, output treesize:9 [2018-04-11 11:11:50,900 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:11:50,917 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:11:50,917 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 47 [2018-04-11 11:11:50,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-04-11 11:11:50,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-04-11 11:11:50,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=2073, Unknown=0, NotChecked=0, Total=2256 [2018-04-11 11:11:50,917 INFO L87 Difference]: Start difference. First operand 401 states and 460 transitions. Second operand 48 states. [2018-04-11 11:11:53,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:11:53,048 INFO L93 Difference]: Finished difference Result 478 states and 538 transitions. [2018-04-11 11:11:53,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 11:11:53,048 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 68 [2018-04-11 11:11:53,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:11:53,049 INFO L225 Difference]: With dead ends: 478 [2018-04-11 11:11:53,049 INFO L226 Difference]: Without dead ends: 478 [2018-04-11 11:11:53,049 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1439 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=629, Invalid=4773, Unknown=0, NotChecked=0, Total=5402 [2018-04-11 11:11:53,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2018-04-11 11:11:53,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 401. [2018-04-11 11:11:53,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-04-11 11:11:53,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 460 transitions. [2018-04-11 11:11:53,051 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 460 transitions. Word has length 68 [2018-04-11 11:11:53,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:11:53,052 INFO L459 AbstractCegarLoop]: Abstraction has 401 states and 460 transitions. [2018-04-11 11:11:53,052 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-04-11 11:11:53,052 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 460 transitions. [2018-04-11 11:11:53,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-04-11 11:11:53,052 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:11:53,052 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] [2018-04-11 11:11:53,052 INFO L408 AbstractCegarLoop]: === Iteration 53 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:11:53,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1496075971, now seen corresponding path program 3 times [2018-04-11 11:11:53,052 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:11:53,052 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:11:53,053 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:11:53,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 11:11:53,053 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:11:53,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:11:53,060 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:11:53,428 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:11:53,429 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:11:53,429 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 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:11:53,433 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 11:11:53,455 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-11 11:11:53,455 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 11:11:53,457 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:11:53,462 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:53,462 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:53,463 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:11:53,463 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:53,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:53,468 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-11 11:11:53,512 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:11:53,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:11:53,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:53,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:53,523 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:11:53,524 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:11:53,524 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:53,525 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:53,532 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:11:53,532 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:45 [2018-04-11 11:11:53,611 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:53,612 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:53,612 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:53,613 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:11:53,613 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:53,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:53,619 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:37 [2018-04-11 11:11:53,637 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:53,637 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 23 treesize of output 35 [2018-04-11 11:11:53,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-11 11:11:53,639 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:53,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:53,652 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:53,654 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 23 treesize of output 30 [2018-04-11 11:11:53,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 11:11:53,655 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:53,658 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:53,664 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:11:53,664 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:63, output treesize:45 [2018-04-11 11:11:53,694 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:53,696 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:53,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 109 [2018-04-11 11:11:53,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:11:53,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:53,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:53,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2018-04-11 11:11:53,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-11 11:11:53,719 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:53,722 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:53,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:53,729 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:142, output treesize:68 [2018-04-11 11:11:53,775 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 13 [2018-04-11 11:11:53,776 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:11:53,776 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:11:53,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:53,778 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:53,782 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:11:53,782 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:79, output treesize:66 [2018-04-11 11:11:53,847 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:53,848 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:53,848 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:11:53,848 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:53,849 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 67 treesize of output 69 [2018-04-11 11:11:53,850 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:11:53,854 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 39 [2018-04-11 11:11:53,854 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:11:53,863 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:11:53,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-04-11 11:11:53,863 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:53,865 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:53,867 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:11:53,867 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:67, output treesize:5 [2018-04-11 11:11:53,889 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:11:53,905 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:11:53,905 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 32 [2018-04-11 11:11:53,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-11 11:11:53,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-11 11:11:53,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=945, Unknown=0, NotChecked=0, Total=1056 [2018-04-11 11:11:53,906 INFO L87 Difference]: Start difference. First operand 401 states and 460 transitions. Second operand 33 states. [2018-04-11 11:11:55,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:11:55,092 INFO L93 Difference]: Finished difference Result 474 states and 533 transitions. [2018-04-11 11:11:55,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 11:11:55,092 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 68 [2018-04-11 11:11:55,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:11:55,093 INFO L225 Difference]: With dead ends: 474 [2018-04-11 11:11:55,093 INFO L226 Difference]: Without dead ends: 474 [2018-04-11 11:11:55,094 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 49 SyntacticMatches, 10 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=413, Invalid=2667, Unknown=0, NotChecked=0, Total=3080 [2018-04-11 11:11:55,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2018-04-11 11:11:55,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 406. [2018-04-11 11:11:55,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2018-04-11 11:11:55,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 465 transitions. [2018-04-11 11:11:55,096 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 465 transitions. Word has length 68 [2018-04-11 11:11:55,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:11:55,096 INFO L459 AbstractCegarLoop]: Abstraction has 406 states and 465 transitions. [2018-04-11 11:11:55,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-11 11:11:55,096 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 465 transitions. [2018-04-11 11:11:55,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-04-11 11:11:55,096 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:11:55,097 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] [2018-04-11 11:11:55,097 INFO L408 AbstractCegarLoop]: === Iteration 54 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:11:55,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1496075970, now seen corresponding path program 2 times [2018-04-11 11:11:55,097 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:11:55,097 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:11:55,097 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:11:55,097 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 11:11:55,097 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:11:55,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:11:55,104 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:11:55,569 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:11:55,569 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:11:55,569 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 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:11:55,577 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 11:11:55,596 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 11:11:55,596 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 11:11:55,598 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:11:55,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:11:55,600 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:55,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:55,601 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:11:55,629 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:55,629 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:55,629 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:11:55,629 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:55,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:55,635 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-11 11:11:55,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 13 treesize of output 10 [2018-04-11 11:11:55,678 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:11:55,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:55,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:55,688 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:11:55,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:11:55,689 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:55,690 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:55,697 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:11:55,697 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:45 [2018-04-11 11:11:55,777 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:55,778 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:55,778 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:55,778 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:11:55,778 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:55,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:55,788 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:40 [2018-04-11 11:11:55,837 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 23 treesize of output 30 [2018-04-11 11:11:55,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 11:11:55,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:55,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:55,851 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:55,852 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 38 treesize of output 50 [2018-04-11 11:11:55,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-11 11:11:55,853 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:55,857 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:55,864 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:11:55,864 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:63, output treesize:60 [2018-04-11 11:11:55,938 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:55,943 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 56 treesize of output 87 [2018-04-11 11:11:55,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:11:55,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:55,950 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:55,960 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:55,961 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:55,964 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 117 treesize of output 104 [2018-04-11 11:11:55,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:11:55,966 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:55,973 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:55,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:55,981 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:148, output treesize:75 [2018-04-11 11:11:56,101 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:56,102 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:56,102 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:11:56,103 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:56,103 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 97 treesize of output 95 [2018-04-11 11:11:56,105 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:11:56,108 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 52 [2018-04-11 11:11:56,109 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 11:11:56,124 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:11:56,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 65 [2018-04-11 11:11:56,127 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 11:11:56,128 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:11:56,129 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 55 treesize of output 47 [2018-04-11 11:11:56,129 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:56,144 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:11:56,158 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 47 treesize of output 39 [2018-04-11 11:11:56,159 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:11:56,160 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 11 [2018-04-11 11:11:56,160 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:56,165 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:11:56,165 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:56,169 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:56,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 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 39 [2018-04-11 11:11:56,171 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:11:56,171 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 11 [2018-04-11 11:11:56,171 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:56,176 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:11:56,176 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:56,179 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:56,188 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:11:56,188 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:106, output treesize:9 [2018-04-11 11:11:56,234 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:11:56,251 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:11:56,251 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21] total 42 [2018-04-11 11:11:56,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-11 11:11:56,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-11 11:11:56,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1653, Unknown=0, NotChecked=0, Total=1806 [2018-04-11 11:11:56,252 INFO L87 Difference]: Start difference. First operand 406 states and 465 transitions. Second operand 43 states. [2018-04-11 11:11:58,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:11:58,227 INFO L93 Difference]: Finished difference Result 478 states and 538 transitions. [2018-04-11 11:11:58,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 11:11:58,228 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 68 [2018-04-11 11:11:58,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:11:58,229 INFO L225 Difference]: With dead ends: 478 [2018-04-11 11:11:58,229 INFO L226 Difference]: Without dead ends: 478 [2018-04-11 11:11:58,229 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1083 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=579, Invalid=4113, Unknown=0, NotChecked=0, Total=4692 [2018-04-11 11:11:58,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2018-04-11 11:11:58,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 401. [2018-04-11 11:11:58,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-04-11 11:11:58,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 460 transitions. [2018-04-11 11:11:58,231 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 460 transitions. Word has length 68 [2018-04-11 11:11:58,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:11:58,232 INFO L459 AbstractCegarLoop]: Abstraction has 401 states and 460 transitions. [2018-04-11 11:11:58,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-11 11:11:58,232 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 460 transitions. [2018-04-11 11:11:58,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-04-11 11:11:58,232 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:11:58,232 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] [2018-04-11 11:11:58,232 INFO L408 AbstractCegarLoop]: === Iteration 55 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:11:58,232 INFO L82 PathProgramCache]: Analyzing trace with hash 372571431, now seen corresponding path program 4 times [2018-04-11 11:11:58,232 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:11:58,232 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:11:58,233 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:11:58,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 11:11:58,233 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:11:58,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:11:58,239 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:11:58,948 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 11:11:58,948 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:11:58,948 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 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:11:58,953 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 11:11:58,977 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 11:11:58,977 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 11:11:58,979 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:11:58,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:11:58,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:58,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:58,982 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:11:59,036 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:59,037 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:59,037 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:11:59,037 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:59,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:59,042 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-11 11:11:59,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 11:11:59,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:11:59,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:59,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:59,104 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:11:59,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:11:59,105 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:59,106 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:59,113 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:11:59,113 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2018-04-11 11:11:59,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-11 11:11:59,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:11:59,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:59,196 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:59,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:59,201 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:55 [2018-04-11 11:11:59,231 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:59,232 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:59,232 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:59,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-11 11:11:59,233 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:59,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:59,238 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:60, output treesize:53 [2018-04-11 11:11:59,296 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:59,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 53 [2018-04-11 11:11:59,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 11:11:59,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:59,306 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:59,316 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:59,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 41 [2018-04-11 11:11:59,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:11:59,319 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:59,323 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:59,331 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:11:59,331 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:79, output treesize:65 [2018-04-11 11:11:59,426 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:59,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2018-04-11 11:11:59,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:11:59,443 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:59,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:59,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:59,453 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:95, output treesize:105 [2018-04-11 11:11:59,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:11:59,488 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:59,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:59,496 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:114, output treesize:113 [2018-04-11 11:11:59,580 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:59,581 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:59,585 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 115 treesize of output 115 [2018-04-11 11:11:59,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 11:11:59,587 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:59,595 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:59,608 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:59,610 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 85 treesize of output 86 [2018-04-11 11:11:59,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:11:59,612 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:59,617 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:11:59,632 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:11:59,632 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:139, output treesize:111 [2018-04-11 11:11:59,831 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 6 case distinctions, treesize of input 88 treesize of output 233 [2018-04-11 11:11:59,835 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:59,840 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 146 treesize of output 175 [2018-04-11 11:11:59,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 11:11:59,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 64 [2018-04-11 11:11:59,908 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:11:59,969 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:11:59,974 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 86 treesize of output 111 [2018-04-11 11:11:59,974 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 11:11:59,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 11:12:00,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 11:12:00,030 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:213, output treesize:608 [2018-04-11 11:12:00,364 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:00,366 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:00,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 226 treesize of output 168 [2018-04-11 11:12:00,369 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 34 treesize of output 21 [2018-04-11 11:12:00,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:00,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 40 [2018-04-11 11:12:00,386 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:12:00,400 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:12:00,401 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 40 treesize of output 30 [2018-04-11 11:12:00,401 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:00,431 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:12:00,488 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 210 treesize of output 179 [2018-04-11 11:12:00,490 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:12:00,490 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 124 treesize of output 110 [2018-04-11 11:12:00,490 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:00,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-04-11 11:12:00,507 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:00,519 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:00,572 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 133 treesize of output 95 [2018-04-11 11:12:00,574 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 21 treesize of output 13 [2018-04-11 11:12:00,574 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:12:00,587 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 30 treesize of output 18 [2018-04-11 11:12:00,587 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:12:00,599 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:12:00,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-04-11 11:12:00,600 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:00,608 INFO L267 ElimStorePlain]: Start of recursive call 9: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 11:12:00,651 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 80 treesize of output 68 [2018-04-11 11:12:00,652 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:12:00,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-04-11 11:12:00,653 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:00,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-04-11 11:12:00,664 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:00,671 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:00,708 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:00,709 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 208 treesize of output 193 [2018-04-11 11:12:00,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-04-11 11:12:00,710 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:00,724 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:12:00,725 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 122 treesize of output 108 [2018-04-11 11:12:00,725 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:00,736 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:00,768 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:00,770 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:00,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 99 [2018-04-11 11:12:00,773 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:12:00,776 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 41 [2018-04-11 11:12:00,777 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 11:12:00,792 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 44 treesize of output 33 [2018-04-11 11:12:00,792 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:00,800 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 37 treesize of output 21 [2018-04-11 11:12:00,800 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:12:00,808 INFO L267 ElimStorePlain]: Start of recursive call 19: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:12:00,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 6 dim-2 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2018-04-11 11:12:00,834 INFO L202 ElimStorePlain]: Needed 22 recursive calls to eliminate 16 variables, input treesize:645, output treesize:98 [2018-04-11 11:12:01,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-04-11 11:12:01,024 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:12:01,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:01,029 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:12:01,029 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:01,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:01,058 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 55 [2018-04-11 11:12:01,059 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 43 treesize of output 38 [2018-04-11 11:12:01,060 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:01,096 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:01,097 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:01,097 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 43 treesize of output 37 [2018-04-11 11:12:01,097 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:01,135 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:01,135 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:01,135 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 38 treesize of output 34 [2018-04-11 11:12:01,136 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:01,171 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 47 treesize of output 42 [2018-04-11 11:12:01,171 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:01,221 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 30 [2018-04-11 11:12:01,221 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:01,275 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 42 treesize of output 35 [2018-04-11 11:12:01,275 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:01,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2018-04-11 11:12:01,369 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:01,399 INFO L267 ElimStorePlain]: Start of recursive call 5: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 11:12:01,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-04-11 11:12:01,547 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:12:01,547 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:01,558 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:12:01,558 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:01,564 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:01,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-04-11 11:12:01,606 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 11 variables, input treesize:125, output treesize:69 [2018-04-11 11:12:01,730 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:12:01,747 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:12:01,747 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 30] total 55 [2018-04-11 11:12:01,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-04-11 11:12:01,748 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-04-11 11:12:01,748 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=2766, Unknown=0, NotChecked=0, Total=2970 [2018-04-11 11:12:01,748 INFO L87 Difference]: Start difference. First operand 401 states and 460 transitions. Second operand 55 states. [2018-04-11 11:12:04,640 WARN L151 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 231 DAG size of output 90 [2018-04-11 11:12:06,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:12:06,416 INFO L93 Difference]: Finished difference Result 534 states and 597 transitions. [2018-04-11 11:12:06,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-11 11:12:06,417 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 68 [2018-04-11 11:12:06,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:12:06,418 INFO L225 Difference]: With dead ends: 534 [2018-04-11 11:12:06,418 INFO L226 Difference]: Without dead ends: 534 [2018-04-11 11:12:06,418 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2153 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=941, Invalid=7989, Unknown=0, NotChecked=0, Total=8930 [2018-04-11 11:12:06,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2018-04-11 11:12:06,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 411. [2018-04-11 11:12:06,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-04-11 11:12:06,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 470 transitions. [2018-04-11 11:12:06,422 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 470 transitions. Word has length 68 [2018-04-11 11:12:06,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:12:06,422 INFO L459 AbstractCegarLoop]: Abstraction has 411 states and 470 transitions. [2018-04-11 11:12:06,422 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-04-11 11:12:06,422 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 470 transitions. [2018-04-11 11:12:06,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-04-11 11:12:06,423 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:12:06,423 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:12:06,423 INFO L408 AbstractCegarLoop]: === Iteration 56 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:12:06,423 INFO L82 PathProgramCache]: Analyzing trace with hash -2022965379, now seen corresponding path program 4 times [2018-04-11 11:12:06,423 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:12:06,423 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:12:06,424 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:12:06,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 11:12:06,424 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:12:06,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:12:06,433 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:12:07,170 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 11:12:07,170 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:12:07,170 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 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:12:07,174 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 11:12:07,198 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 11:12:07,198 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 11:12:07,200 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:12:07,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:12:07,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:07,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:07,213 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:12:07,255 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:07,256 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:07,256 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:12:07,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:07,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:07,261 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-11 11:12:07,308 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:12:07,309 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:12:07,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:07,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:07,318 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:12:07,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:12:07,319 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:07,320 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:07,326 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:12:07,327 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2018-04-11 11:12:07,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 12 [2018-04-11 11:12:07,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:12:07,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:07,410 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:07,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:07,416 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:55 [2018-04-11 11:12:07,446 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:07,447 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:07,447 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:07,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2018-04-11 11:12:07,448 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:07,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:07,458 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:66, output treesize:72 [2018-04-11 11:12:07,530 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:07,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 62 [2018-04-11 11:12:07,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 11:12:07,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:07,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:07,556 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:07,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 41 [2018-04-11 11:12:07,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:12:07,559 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:07,563 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:07,575 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:12:07,575 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:98, output treesize:90 [2018-04-11 11:12:07,690 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:07,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2018-04-11 11:12:07,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-11 11:12:07,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:07,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:07,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:07,707 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:128, output treesize:138 [2018-04-11 11:12:07,750 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:07,751 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:07,751 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:07,752 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:07,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 79 [2018-04-11 11:12:07,752 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:07,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:07,770 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:143, output treesize:135 [2018-04-11 11:12:07,850 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:07,850 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:07,855 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 141 treesize of output 137 [2018-04-11 11:12:07,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 11:12:07,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:07,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:07,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:07,883 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 103 treesize of output 104 [2018-04-11 11:12:07,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:12:07,884 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:07,891 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:07,903 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:12:07,903 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:161, output treesize:139 [2018-04-11 11:12:08,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 153 [2018-04-11 11:12:08,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-04-11 11:12:08,040 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:08,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:08,057 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:12:08,058 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:229, output treesize:205 [2018-04-11 11:12:08,201 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 211 treesize of output 129 [2018-04-11 11:12:08,202 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:12:08,203 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 51 treesize of output 41 [2018-04-11 11:12:08,203 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:08,213 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 44 treesize of output 28 [2018-04-11 11:12:08,213 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:12:08,221 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 52 treesize of output 20 [2018-04-11 11:12:08,222 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:12:08,229 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 11:12:08,240 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 21 treesize of output 17 [2018-04-11 11:12:08,241 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:12:08,241 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:12:08,241 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:08,243 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:08,252 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:12:08,252 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:226, output treesize:34 [2018-04-11 11:12:08,360 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 11:12:08,376 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:12:08,376 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 54 [2018-04-11 11:12:08,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-04-11 11:12:08,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-04-11 11:12:08,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=2652, Unknown=0, NotChecked=0, Total=2862 [2018-04-11 11:12:08,377 INFO L87 Difference]: Start difference. First operand 411 states and 470 transitions. Second operand 54 states. [2018-04-11 11:12:13,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:12:13,050 INFO L93 Difference]: Finished difference Result 601 states and 672 transitions. [2018-04-11 11:12:13,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-11 11:12:13,050 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 68 [2018-04-11 11:12:13,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:12:13,052 INFO L225 Difference]: With dead ends: 601 [2018-04-11 11:12:13,052 INFO L226 Difference]: Without dead ends: 601 [2018-04-11 11:12:13,052 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2533 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1115, Invalid=8785, Unknown=0, NotChecked=0, Total=9900 [2018-04-11 11:12:13,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2018-04-11 11:12:13,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 426. [2018-04-11 11:12:13,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2018-04-11 11:12:13,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 490 transitions. [2018-04-11 11:12:13,055 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 490 transitions. Word has length 68 [2018-04-11 11:12:13,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:12:13,055 INFO L459 AbstractCegarLoop]: Abstraction has 426 states and 490 transitions. [2018-04-11 11:12:13,055 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-04-11 11:12:13,055 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 490 transitions. [2018-04-11 11:12:13,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-11 11:12:13,055 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:12:13,055 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:12:13,055 INFO L408 AbstractCegarLoop]: === Iteration 57 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:12:13,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1375537741, now seen corresponding path program 2 times [2018-04-11 11:12:13,056 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:12:13,056 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:12:13,056 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:12:13,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 11:12:13,056 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:12:13,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:12:13,062 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:12:13,113 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-04-11 11:12:13,113 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:12:13,113 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 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:12:13,121 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 11:12:13,142 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 11:12:13,142 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 11:12:13,144 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:12:13,169 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-04-11 11:12:13,186 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:12:13,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-04-11 11:12:13,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 11:12:13,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 11:12:13,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-04-11 11:12:13,187 INFO L87 Difference]: Start difference. First operand 426 states and 490 transitions. Second operand 8 states. [2018-04-11 11:12:13,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:12:13,208 INFO L93 Difference]: Finished difference Result 459 states and 522 transitions. [2018-04-11 11:12:13,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 11:12:13,208 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2018-04-11 11:12:13,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:12:13,210 INFO L225 Difference]: With dead ends: 459 [2018-04-11 11:12:13,210 INFO L226 Difference]: Without dead ends: 439 [2018-04-11 11:12:13,210 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-04-11 11:12:13,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-04-11 11:12:13,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 426. [2018-04-11 11:12:13,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2018-04-11 11:12:13,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 493 transitions. [2018-04-11 11:12:13,213 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 493 transitions. Word has length 69 [2018-04-11 11:12:13,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:12:13,213 INFO L459 AbstractCegarLoop]: Abstraction has 426 states and 493 transitions. [2018-04-11 11:12:13,213 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 11:12:13,213 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 493 transitions. [2018-04-11 11:12:13,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-11 11:12:13,213 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:12:13,213 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-11 11:12:13,213 INFO L408 AbstractCegarLoop]: === Iteration 58 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:12:13,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1413136518, now seen corresponding path program 1 times [2018-04-11 11:12:13,214 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:12:13,214 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:12:13,214 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:12:13,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 11:12:13,214 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:12:13,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:12:13,219 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:12:13,236 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-04-11 11:12:13,237 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:12:13,237 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 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:12:13,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:12:13,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:12:13,260 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:12:13,280 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-04-11 11:12:13,300 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:12:13,300 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-04-11 11:12:13,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 11:12:13,300 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 11:12:13,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-04-11 11:12:13,301 INFO L87 Difference]: Start difference. First operand 426 states and 493 transitions. Second operand 8 states. [2018-04-11 11:12:13,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:12:13,324 INFO L93 Difference]: Finished difference Result 471 states and 537 transitions. [2018-04-11 11:12:13,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 11:12:13,324 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2018-04-11 11:12:13,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:12:13,325 INFO L225 Difference]: With dead ends: 471 [2018-04-11 11:12:13,325 INFO L226 Difference]: Without dead ends: 431 [2018-04-11 11:12:13,325 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-04-11 11:12:13,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-04-11 11:12:13,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 396. [2018-04-11 11:12:13,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-04-11 11:12:13,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 465 transitions. [2018-04-11 11:12:13,328 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 465 transitions. Word has length 69 [2018-04-11 11:12:13,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:12:13,328 INFO L459 AbstractCegarLoop]: Abstraction has 396 states and 465 transitions. [2018-04-11 11:12:13,328 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 11:12:13,328 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 465 transitions. [2018-04-11 11:12:13,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-04-11 11:12:13,329 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:12:13,329 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 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] [2018-04-11 11:12:13,329 INFO L408 AbstractCegarLoop]: === Iteration 59 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:12:13,329 INFO L82 PathProgramCache]: Analyzing trace with hash -679328209, now seen corresponding path program 7 times [2018-04-11 11:12:13,329 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:12:13,329 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:12:13,330 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:12:13,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:12:13,330 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:12:13,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:12:13,338 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:12:13,939 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 10 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:12:13,939 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:12:13,939 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 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:12:13,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:12:13,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:12:13,970 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:12:13,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 11:12:13,971 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:13,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:13,973 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:12:14,037 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:14,037 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:14,037 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:12:14,037 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:14,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:14,041 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-04-11 11:12:14,097 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:12:14,098 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:12:14,098 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:14,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:14,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 11:12:14,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 10 treesize of output 9 [2018-04-11 11:12:14,109 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:14,110 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:14,116 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:12:14,116 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:34 [2018-04-11 11:12:14,249 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:14,250 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:14,250 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:12:14,250 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:14,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:14,269 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:53 [2018-04-11 11:12:14,346 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:14,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-11 11:12:14,350 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:12:14,350 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:14,354 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:14,365 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:14,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 33 [2018-04-11 11:12:14,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:12:14,376 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:14,380 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:14,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:14,389 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:76, output treesize:67 [2018-04-11 11:12:14,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 18 [2018-04-11 11:12:14,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 27 [2018-04-11 11:12:14,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:14,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:14,561 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:12:14,561 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:105, output treesize:121 [2018-04-11 11:12:14,611 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:14,611 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:14,612 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:14,612 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 26 treesize of output 33 [2018-04-11 11:12:14,612 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:14,624 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:12:14,624 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:129, output treesize:122 [2018-04-11 11:12:14,716 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:14,717 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:14,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 131 [2018-04-11 11:12:14,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 117 [2018-04-11 11:12:14,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:14,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:14,782 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:14,783 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:14,786 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:14,796 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 3 case distinctions, treesize of input 127 treesize of output 139 [2018-04-11 11:12:14,798 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 159 treesize of output 155 [2018-04-11 11:12:14,799 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:14,836 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:12:14,836 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 80 treesize of output 71 [2018-04-11 11:12:14,837 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:14,856 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:12:14,880 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:12:14,880 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:145, output treesize:229 [2018-04-11 11:12:15,135 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:15,135 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 141 treesize of output 169 [2018-04-11 11:12:15,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2018-04-11 11:12:15,137 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:15,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:15,184 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:15,185 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 263 treesize of output 279 [2018-04-11 11:12:15,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 104 [2018-04-11 11:12:15,186 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:15,200 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:15,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 11:12:15,225 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:434, output treesize:300 [2018-04-11 11:12:15,926 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:15,927 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:15,928 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:15,928 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:15,928 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:12:15,929 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:15,930 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:15,930 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:15,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 231 [2018-04-11 11:12:15,937 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:12:15,949 INFO L477 Elim1Store]: Elim1 applied some 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 4 new quantified variables, introduced 5 case distinctions, treesize of input 129 treesize of output 149 [2018-04-11 11:12:15,951 INFO L267 ElimStorePlain]: Start of recursive call 3: 10 dim-0 vars, End of recursive call: 10 dim-0 vars, and 7 xjuncts. [2018-04-11 11:12:15,996 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:12:15,996 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 139 treesize of output 122 [2018-04-11 11:12:15,997 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:12:16,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 24 [2018-04-11 11:12:16,010 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:12:16,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 11:12:16,038 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:16,040 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 99 treesize of output 89 [2018-04-11 11:12:16,041 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:12:16,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 40 [2018-04-11 11:12:16,042 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:16,053 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 7 [2018-04-11 11:12:16,053 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:16,061 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:12:16,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-04-11 11:12:16,061 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:16,066 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:16,076 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:12:16,076 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:257, output treesize:25 [2018-04-11 11:12:16,188 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:16,189 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:16,189 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:16,190 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:16,190 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:16,191 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:16,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 45 [2018-04-11 11:12:16,201 INFO L477 Elim1Store]: Elim1 applied some 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 14 treesize of output 37 [2018-04-11 11:12:16,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:16,208 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:12:16,208 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:16,212 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:12:16,212 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:16,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:16,218 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:12:16,218 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:3 [2018-04-11 11:12:16,282 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:12:16,299 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:12:16,299 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 33] total 60 [2018-04-11 11:12:16,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-04-11 11:12:16,300 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-04-11 11:12:16,300 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=3321, Unknown=0, NotChecked=0, Total=3540 [2018-04-11 11:12:16,300 INFO L87 Difference]: Start difference. First operand 396 states and 465 transitions. Second operand 60 states. [2018-04-11 11:12:19,645 WARN L151 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 208 DAG size of output 98 [2018-04-11 11:12:20,625 WARN L151 SmtUtils]: Spent 228ms on a formula simplification. DAG size of input: 181 DAG size of output 137 [2018-04-11 11:12:20,897 WARN L151 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 172 DAG size of output 135 [2018-04-11 11:12:21,223 WARN L151 SmtUtils]: Spent 187ms on a formula simplification. DAG size of input: 178 DAG size of output 138 [2018-04-11 11:12:22,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:12:22,373 INFO L93 Difference]: Finished difference Result 471 states and 540 transitions. [2018-04-11 11:12:22,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-11 11:12:22,373 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 70 [2018-04-11 11:12:22,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:12:22,374 INFO L225 Difference]: With dead ends: 471 [2018-04-11 11:12:22,374 INFO L226 Difference]: Without dead ends: 471 [2018-04-11 11:12:22,375 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2396 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=861, Invalid=8645, Unknown=0, NotChecked=0, Total=9506 [2018-04-11 11:12:22,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2018-04-11 11:12:22,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 411. [2018-04-11 11:12:22,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-04-11 11:12:22,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 480 transitions. [2018-04-11 11:12:22,377 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 480 transitions. Word has length 70 [2018-04-11 11:12:22,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:12:22,377 INFO L459 AbstractCegarLoop]: Abstraction has 411 states and 480 transitions. [2018-04-11 11:12:22,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-04-11 11:12:22,377 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 480 transitions. [2018-04-11 11:12:22,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-04-11 11:12:22,378 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:12:22,378 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:12:22,378 INFO L408 AbstractCegarLoop]: === Iteration 60 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:12:22,378 INFO L82 PathProgramCache]: Analyzing trace with hash -687731963, now seen corresponding path program 5 times [2018-04-11 11:12:22,379 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:12:22,379 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:12:22,379 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:12:22,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:12:22,379 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:12:22,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:12:22,391 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:12:23,167 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:12:23,167 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:12:23,167 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 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:12:23,174 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 11:12:23,220 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-04-11 11:12:23,220 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 11:12:23,223 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:12:23,263 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:23,264 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:23,264 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:12:23,264 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:23,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:23,288 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-11 11:12:23,353 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:12:23,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 10 treesize of output 9 [2018-04-11 11:12:23,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:23,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:23,366 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:12:23,367 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:12:23,367 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:23,368 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:23,376 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:12:23,376 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:45 [2018-04-11 11:12:23,482 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:23,483 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:23,483 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:23,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-11 11:12:23,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:23,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:23,491 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:48 [2018-04-11 11:12:23,551 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:23,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 33 [2018-04-11 11:12:23,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:12:23,558 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:23,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:23,574 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:23,576 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:12:23,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 11:12:23,578 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:23,588 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:23,595 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:12:23,596 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:71, output treesize:70 [2018-04-11 11:12:23,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:12:23,739 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:23,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:23,749 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:119, output treesize:118 [2018-04-11 11:12:23,833 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 164 treesize of output 158 [2018-04-11 11:12:23,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-04-11 11:12:23,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:23,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:23,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 124 [2018-04-11 11:12:23,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-04-11 11:12:23,862 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:23,869 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:23,879 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:12:23,880 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:183, output treesize:121 [2018-04-11 11:12:24,146 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:12:24,148 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 131 treesize of output 118 [2018-04-11 11:12:24,159 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:12:24,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 79 [2018-04-11 11:12:24,160 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:12:24,172 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:12:24,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-04-11 11:12:24,172 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:24,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:24,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-11 11:12:24,193 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:166, output treesize:90 [2018-04-11 11:12:24,335 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:24,336 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:12:24,336 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:12:24,336 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:24,338 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:24,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 80 [2018-04-11 11:12:24,345 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 35 [2018-04-11 11:12:24,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:24,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-04-11 11:12:24,350 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:24,353 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:12:24,354 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:12:24,354 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:24,355 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:24,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:24,363 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:99, output treesize:5 [2018-04-11 11:12:24,398 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:12:24,416 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:12:24,416 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 53 [2018-04-11 11:12:24,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-04-11 11:12:24,417 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-04-11 11:12:24,417 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=2628, Unknown=0, NotChecked=0, Total=2862 [2018-04-11 11:12:24,417 INFO L87 Difference]: Start difference. First operand 411 states and 480 transitions. Second operand 54 states. [2018-04-11 11:12:27,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:12:27,575 INFO L93 Difference]: Finished difference Result 472 states and 542 transitions. [2018-04-11 11:12:27,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 11:12:27,575 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 70 [2018-04-11 11:12:27,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:12:27,576 INFO L225 Difference]: With dead ends: 472 [2018-04-11 11:12:27,576 INFO L226 Difference]: Without dead ends: 472 [2018-04-11 11:12:27,577 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1856 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=725, Invalid=6081, Unknown=0, NotChecked=0, Total=6806 [2018-04-11 11:12:27,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2018-04-11 11:12:27,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 414. [2018-04-11 11:12:27,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2018-04-11 11:12:27,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 484 transitions. [2018-04-11 11:12:27,579 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 484 transitions. Word has length 70 [2018-04-11 11:12:27,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:12:27,580 INFO L459 AbstractCegarLoop]: Abstraction has 414 states and 484 transitions. [2018-04-11 11:12:27,580 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-04-11 11:12:27,580 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 484 transitions. [2018-04-11 11:12:27,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-04-11 11:12:27,580 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:12:27,580 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:12:27,580 INFO L408 AbstractCegarLoop]: === Iteration 61 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:12:27,580 INFO L82 PathProgramCache]: Analyzing trace with hash -687731962, now seen corresponding path program 3 times [2018-04-11 11:12:27,580 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:12:27,580 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:12:27,581 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:12:27,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 11:12:27,581 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:12:27,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:12:27,590 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:12:28,395 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:12:28,395 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:12:28,395 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 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:12:28,400 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 11:12:28,429 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-11 11:12:28,429 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 11:12:28,431 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:12:28,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:12:28,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:28,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:28,435 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:12:28,476 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:28,476 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:28,476 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:12:28,477 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:28,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:28,483 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-11 11:12:28,536 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:12:28,537 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:12:28,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:28,538 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:28,547 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:12:28,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:12:28,548 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:28,549 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:28,556 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:12:28,556 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:45 [2018-04-11 11:12:28,578 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:28,578 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:28,579 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:28,579 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:12:28,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:28,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:28,587 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:40 [2018-04-11 11:12:28,610 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:28,610 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 23 treesize of output 35 [2018-04-11 11:12:28,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-11 11:12:28,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:28,616 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:28,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:28,630 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 23 treesize of output 30 [2018-04-11 11:12:28,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 11:12:28,631 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:28,637 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:28,646 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:12:28,646 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:63, output treesize:60 [2018-04-11 11:12:28,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:12:28,743 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:28,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:28,753 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:69, output treesize:68 [2018-04-11 11:12:28,783 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:28,786 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:28,788 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 54 treesize of output 76 [2018-04-11 11:12:28,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:12:28,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:28,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:28,807 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:28,811 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 38 treesize of output 71 [2018-04-11 11:12:28,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:12:28,813 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:28,818 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:28,828 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:12:28,828 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:91, output treesize:92 [2018-04-11 11:12:29,247 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:29,247 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:12:29,248 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:29,249 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:29,249 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:12:29,251 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:29,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 152 [2018-04-11 11:12:29,255 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:12:29,260 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 101 treesize of output 83 [2018-04-11 11:12:29,260 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 11:12:29,281 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:12:29,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 64 [2018-04-11 11:12:29,282 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:12:29,283 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:12:29,287 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 78 [2018-04-11 11:12:29,288 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 11:12:29,319 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:12:29,320 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 64 treesize of output 60 [2018-04-11 11:12:29,320 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:29,324 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:12:29,324 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 64 treesize of output 60 [2018-04-11 11:12:29,324 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:29,326 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:12:29,326 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 70 treesize of output 66 [2018-04-11 11:12:29,326 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:29,354 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-04-11 11:12:29,381 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 65 treesize of output 53 [2018-04-11 11:12:29,382 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:12:29,383 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:12:29,383 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:29,393 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:12:29,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-04-11 11:12:29,393 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:29,400 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:12:29,400 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:29,404 INFO L267 ElimStorePlain]: Start of recursive call 9: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:29,407 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 67 treesize of output 55 [2018-04-11 11:12:29,408 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:12:29,408 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:12:29,409 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:29,417 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:12:29,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-04-11 11:12:29,418 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:29,424 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:12:29,424 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:29,429 INFO L267 ElimStorePlain]: Start of recursive call 13: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:29,431 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 67 treesize of output 59 [2018-04-11 11:12:29,433 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:12:29,433 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:12:29,433 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:29,442 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:12:29,442 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:12:29,442 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:29,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 9 treesize of output 1 [2018-04-11 11:12:29,450 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:29,454 INFO L267 ElimStorePlain]: Start of recursive call 17: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:29,471 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:12:29,471 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 4 variables, input treesize:171, output treesize:9 [2018-04-11 11:12:29,519 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:12:29,536 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:12:29,536 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 44 [2018-04-11 11:12:29,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-11 11:12:29,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-11 11:12:29,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1817, Unknown=0, NotChecked=0, Total=1980 [2018-04-11 11:12:29,537 INFO L87 Difference]: Start difference. First operand 414 states and 484 transitions. Second operand 45 states. [2018-04-11 11:12:31,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:12:31,781 INFO L93 Difference]: Finished difference Result 500 states and 573 transitions. [2018-04-11 11:12:31,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-11 11:12:31,782 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 70 [2018-04-11 11:12:31,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:12:31,783 INFO L225 Difference]: With dead ends: 500 [2018-04-11 11:12:31,783 INFO L226 Difference]: Without dead ends: 500 [2018-04-11 11:12:31,783 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 42 SyntacticMatches, 14 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1588 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=575, Invalid=4681, Unknown=0, NotChecked=0, Total=5256 [2018-04-11 11:12:31,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2018-04-11 11:12:31,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 420. [2018-04-11 11:12:31,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2018-04-11 11:12:31,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 491 transitions. [2018-04-11 11:12:31,786 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 491 transitions. Word has length 70 [2018-04-11 11:12:31,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:12:31,786 INFO L459 AbstractCegarLoop]: Abstraction has 420 states and 491 transitions. [2018-04-11 11:12:31,787 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-11 11:12:31,787 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 491 transitions. [2018-04-11 11:12:31,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-04-11 11:12:31,787 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:12:31,787 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:12:31,787 INFO L408 AbstractCegarLoop]: === Iteration 62 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:12:31,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1879141890, now seen corresponding path program 5 times [2018-04-11 11:12:31,788 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:12:31,788 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:12:31,788 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:12:31,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 11:12:31,788 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:12:31,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:12:31,799 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:12:32,192 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:12:32,192 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:12:32,193 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 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:12:32,198 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 11:12:32,249 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-04-11 11:12:32,249 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 11:12:32,251 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:12:32,257 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:32,257 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:32,258 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:12:32,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:32,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:32,264 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-11 11:12:32,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 11:12:32,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 11:12:32,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:32,320 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:32,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 13 treesize of output 10 [2018-04-11 11:12:32,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 11:12:32,330 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:32,331 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:32,338 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:12:32,339 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:45 [2018-04-11 11:12:32,426 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:32,427 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:32,427 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:32,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2018-04-11 11:12:32,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:32,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:32,437 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:51, output treesize:57 [2018-04-11 11:12:32,495 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:32,497 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 46 treesize of output 47 [2018-04-11 11:12:32,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 11:12:32,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:32,504 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:32,522 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:32,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2018-04-11 11:12:32,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:12:32,526 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:32,530 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:32,545 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:12:32,545 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:100, output treesize:83 [2018-04-11 11:12:32,666 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:32,667 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:32,668 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:32,668 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:32,669 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 41 treesize of output 117 [2018-04-11 11:12:32,669 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:32,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2018-04-11 11:12:32,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:32,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 11:12:32,709 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:129, output treesize:148 [2018-04-11 11:12:32,804 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:32,805 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:32,812 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 124 treesize of output 120 [2018-04-11 11:12:32,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:12:32,813 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:32,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:32,859 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:32,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 32 [2018-04-11 11:12:32,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:12:32,863 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:32,867 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:32,896 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:12:32,896 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:171, output treesize:154 [2018-04-11 11:12:33,060 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:12:33,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 23 [2018-04-11 11:12:33,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:33,064 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:33,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 11:12:33,087 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:181, output treesize:193 [2018-04-11 11:12:33,159 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:33,160 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:33,162 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 23 treesize of output 42 [2018-04-11 11:12:33,162 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:33,194 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:33,195 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:33,196 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:33,196 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:33,197 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:33,197 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 97 [2018-04-11 11:12:33,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:33,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 11:12:33,231 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:204, output treesize:194 [2018-04-11 11:12:33,370 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:33,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 170 treesize of output 163 [2018-04-11 11:12:33,390 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:12:33,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 130 [2018-04-11 11:12:33,391 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:12:33,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 167 treesize of output 166 [2018-04-11 11:12:33,562 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:33,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 124 treesize of output 112 [2018-04-11 11:12:33,743 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:12:33,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, 4 dim-1 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-04-11 11:12:33,912 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:33,924 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 3 case distinctions, treesize of input 186 treesize of output 198 [2018-04-11 11:12:33,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 201 treesize of output 200 [2018-04-11 11:12:33,926 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:33,991 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 146 treesize of output 147 [2018-04-11 11:12:33,992 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-11 11:12:34,044 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:12:34,049 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 141 treesize of output 146 [2018-04-11 11:12:34,051 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:12:34,052 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 16 treesize of output 15 [2018-04-11 11:12:34,052 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:34,071 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:34,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 168 [2018-04-11 11:12:34,078 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:12:34,079 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 16 treesize of output 15 [2018-04-11 11:12:34,079 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:34,104 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:34,106 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:34,111 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 122 treesize of output 131 [2018-04-11 11:12:34,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:12:34,113 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:34,133 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:34,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 17 dim-0 vars, and 5 xjuncts. [2018-04-11 11:12:34,258 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:220, output treesize:885 [2018-04-11 11:12:34,517 WARN L151 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 218 DAG size of output 169 [2018-04-11 11:12:34,958 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 3 case distinctions, treesize of input 340 treesize of output 374 [2018-04-11 11:12:34,961 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:34,967 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 338 treesize of output 381 [2018-04-11 11:12:34,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 11:12:35,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 315 treesize of output 314 [2018-04-11 11:12:35,092 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:35,167 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:12:35,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 235 treesize of output 216 [2018-04-11 11:12:35,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-04-11 11:12:35,393 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:35,415 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:35,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 245 treesize of output 228 [2018-04-11 11:12:35,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:12:35,611 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:35,632 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:35,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 261 treesize of output 240 [2018-04-11 11:12:35,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-04-11 11:12:35,818 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:35,840 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:35,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 17 dim-0 vars, 4 dim-2 vars, End of recursive call: 21 dim-0 vars, and 5 xjuncts. [2018-04-11 11:12:35,998 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 21 variables, input treesize:1082, output treesize:1302 [2018-04-11 11:12:36,282 WARN L148 SmtUtils]: Spent 104ms on a formula simplification that was a NOOP. DAG size: 246 [2018-04-11 11:12:36,592 WARN L148 SmtUtils]: Spent 184ms on a formula simplification that was a NOOP. DAG size: 246 [2018-04-11 11:12:36,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 249 treesize of output 225 [2018-04-11 11:12:36,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-11 11:12:36,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:36,630 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:12:36,630 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:36,649 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:36,820 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:36,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 321 treesize of output 327 [2018-04-11 11:12: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 323 treesize of output 318 [2018-04-11 11:12:36,829 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:36,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 293 treesize of output 288 [2018-04-11 11:12:36,908 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:36,979 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:36,979 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:36,980 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 288 treesize of output 282 [2018-04-11 11:12:36,980 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:37,051 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 314 treesize of output 293 [2018-04-11 11:12:37,051 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:37,122 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 293 treesize of output 288 [2018-04-11 11:12:37,122 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:37,186 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:12:37,399 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:37,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 222 treesize of output 204 [2018-04-11 11:12:37,403 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:12:37,403 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:37,424 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:12:37,424 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:37,453 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:12:37,453 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:37,469 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:37,657 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:37,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 313 treesize of output 313 [2018-04-11 11:12:37,660 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:12:37,660 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:37,687 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 21 treesize of output 1 [2018-04-11 11:12:37,687 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:37,711 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:37,901 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:37,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 218 [2018-04-11 11:12:37,905 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:12:37,905 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:37,926 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:12:37,926 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:37,952 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:38,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 21 dim-0 vars, 5 dim-2 vars, End of recursive call: 21 dim-0 vars, and 6 xjuncts. [2018-04-11 11:12:38,129 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 26 variables, input treesize:1352, output treesize:1386 [2018-04-11 11:12:38,394 WARN L151 SmtUtils]: Spent 141ms on a formula simplification. DAG size of input: 259 DAG size of output 176 [2018-04-11 11:12:38,527 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:38,528 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:38,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 156 [2018-04-11 11:12:38,533 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 54 [2018-04-11 11:12:38,534 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:12:38,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 47 [2018-04-11 11:12:38,556 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:12:38,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:12:38,638 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:38,639 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:38,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 129 [2018-04-11 11:12:38,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2018-04-11 11:12:38,642 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:38,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 22 [2018-04-11 11:12:38,656 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:38,668 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 26 treesize of output 18 [2018-04-11 11:12:38,668 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:12:38,679 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:12:38,761 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 61 treesize of output 57 [2018-04-11 11:12:38,762 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:12:38,762 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:38,771 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:38,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 79 [2018-04-11 11:12:38,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 5 [2018-04-11 11:12:38,829 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:38,842 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:12:38,842 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:38,854 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:38,907 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:38,908 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:38,912 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 273 treesize of output 207 [2018-04-11 11:12:38,918 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 199 treesize of output 194 [2018-04-11 11:12:38,919 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 11:12:38,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 199 treesize of output 129 [2018-04-11 11:12:38,986 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:12:39,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 109 [2018-04-11 11:12:39,036 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:12:39,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 109 treesize of output 94 [2018-04-11 11:12:39,089 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:39,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 115 [2018-04-11 11:12:39,139 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 11:12:39,193 INFO L267 ElimStorePlain]: Start of recursive call 14: 5 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-11 11:12:39,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 96 [2018-04-11 11:12:39,272 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:12:39,272 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:39,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, 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 6 [2018-04-11 11:12:39,292 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:39,315 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:39,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 88 [2018-04-11 11:12:39,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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:12:39,319 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:39,336 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:12:39,337 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:39,353 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:39,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 6 dim-2 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2018-04-11 11:12:39,431 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 18 variables, input treesize:660, output treesize:125 [2018-04-11 11:12:39,619 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:12:39,637 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:12:39,637 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 32] total 51 [2018-04-11 11:12:39,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-04-11 11:12:39,637 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-04-11 11:12:39,637 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=2464, Unknown=1, NotChecked=0, Total=2652 [2018-04-11 11:12:39,637 INFO L87 Difference]: Start difference. First operand 420 states and 491 transitions. Second operand 52 states. [2018-04-11 11:12:45,712 WARN L151 SmtUtils]: Spent 213ms on a formula simplification. DAG size of input: 208 DAG size of output 146 [2018-04-11 11:12:46,562 WARN L151 SmtUtils]: Spent 572ms on a formula simplification. DAG size of input: 292 DAG size of output 257 [2018-04-11 11:12:46,932 WARN L151 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 214 DAG size of output 210 [2018-04-11 11:12:47,371 WARN L151 SmtUtils]: Spent 192ms on a formula simplification. DAG size of input: 270 DAG size of output 266 [2018-04-11 11:12:47,950 WARN L151 SmtUtils]: Spent 285ms on a formula simplification. DAG size of input: 430 DAG size of output 263 [2018-04-11 11:12:48,818 WARN L151 SmtUtils]: Spent 453ms on a formula simplification. DAG size of input: 462 DAG size of output 276 [2018-04-11 11:12:49,501 WARN L151 SmtUtils]: Spent 430ms on a formula simplification. DAG size of input: 456 DAG size of output 270 [2018-04-11 11:12:50,254 WARN L151 SmtUtils]: Spent 452ms on a formula simplification. DAG size of input: 469 DAG size of output 275 [2018-04-11 11:12:50,640 WARN L151 SmtUtils]: Spent 201ms on a formula simplification. DAG size of input: 274 DAG size of output 269 [2018-04-11 11:12:51,187 WARN L151 SmtUtils]: Spent 160ms on a formula simplification. DAG size of input: 255 DAG size of output 251 [2018-04-11 11:12:52,992 WARN L151 SmtUtils]: Spent 267ms on a formula simplification. DAG size of input: 430 DAG size of output 259 [2018-04-11 11:12:53,590 WARN L151 SmtUtils]: Spent 280ms on a formula simplification. DAG size of input: 444 DAG size of output 263 [2018-04-11 11:12:54,245 WARN L151 SmtUtils]: Spent 266ms on a formula simplification. DAG size of input: 446 DAG size of output 261 [2018-04-11 11:12:54,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:12:54,544 INFO L93 Difference]: Finished difference Result 599 states and 690 transitions. [2018-04-11 11:12:54,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-11 11:12:54,544 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 71 [2018-04-11 11:12:54,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:12:54,545 INFO L225 Difference]: With dead ends: 599 [2018-04-11 11:12:54,545 INFO L226 Difference]: Without dead ends: 597 [2018-04-11 11:12:54,546 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2418 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=965, Invalid=8735, Unknown=2, NotChecked=0, Total=9702 [2018-04-11 11:12:54,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2018-04-11 11:12:54,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 420. [2018-04-11 11:12:54,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2018-04-11 11:12:54,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 490 transitions. [2018-04-11 11:12:54,548 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 490 transitions. Word has length 71 [2018-04-11 11:12:54,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:12:54,548 INFO L459 AbstractCegarLoop]: Abstraction has 420 states and 490 transitions. [2018-04-11 11:12:54,548 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-04-11 11:12:54,548 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 490 transitions. [2018-04-11 11:12:54,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-04-11 11:12:54,549 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:12:54,549 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:12:54,549 INFO L408 AbstractCegarLoop]: === Iteration 63 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 11:12:54,549 INFO L82 PathProgramCache]: Analyzing trace with hash -612195881, now seen corresponding path program 8 times [2018-04-11 11:12:54,549 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:12:54,549 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:12:54,550 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:12:54,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 11:12:54,550 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:12:54,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:12:54,559 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:12:54,964 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:12:54,964 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:12:54,964 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 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:12:54,969 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 11:12:54,989 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 11:12:54,989 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 11:12:54,991 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:12:54,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:12:54,993 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:54,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:54,995 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:12:55,024 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:55,024 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:55,024 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:12:55,025 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:55,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:55,031 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-11 11:12:55,079 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:12:55,080 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:12:55,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:55,081 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:55,088 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:12:55,088 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:36 [2018-04-11 11:12:55,153 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:55,154 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:55,154 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:55,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-11 11:12:55,154 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:55,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:55,158 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:31 [2018-04-11 11:12:55,201 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:55,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2018-04-11 11:12:55,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 11:12:55,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:55,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:55,213 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:12:55,213 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:48 [2018-04-11 11:12:55,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 11:12:55,308 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:55,315 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:12:55,315 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:75, output treesize:74 [2018-04-11 11:12:55,384 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 20 [2018-04-11 11:12:55,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:12:55,386 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:55,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:55,399 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:55,400 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:12:55,404 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 95 treesize of output 95 [2018-04-11 11:12:55,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:12:55,406 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:55,415 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:55,423 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:12:55,424 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:97, output treesize:86 [2018-04-11 11:12:55,544 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 24 [2018-04-11 11:12:55,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 39 [2018-04-11 11:12:55,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:55,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:55,558 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:12:55,558 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:142, output treesize:170 [2018-04-11 11:12:55,613 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 0 case distinctions, treesize of input 37 treesize of output 36 [2018-04-11 11:12:55,613 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:55,628 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:12:55,628 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:179, output treesize:178 [2018-04-11 11:12:55,763 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 3 case distinctions, treesize of input 91 treesize of output 147 [2018-04-11 11:12:55,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 133 [2018-04-11 11:12:55,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:55,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:55,851 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 6 new quantified variables, introduced 9 case distinctions, treesize of input 184 treesize of output 172 [2018-04-11 11:12:55,852 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-11 11:12:55,871 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:12:55,872 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 180 treesize of output 158 [2018-04-11 11:12:55,873 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:12:56,565 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 2 case distinctions, treesize of input 127 treesize of output 111 [2018-04-11 11:12:56,565 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:12:56,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 180 [2018-04-11 11:12:56,844 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:57,610 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 148 treesize of output 149 [2018-04-11 11:12:57,611 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-11 11:12:58,108 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:12:58,273 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:12:58,449 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:12:58,635 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:12:58,816 INFO L267 ElimStorePlain]: Start of recursive call 4: 14 dim-1 vars, End of recursive call: 6 dim-0 vars, and 8 xjuncts. [2018-04-11 11:12:59,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 24 dim-0 vars, and 8 xjuncts. [2018-04-11 11:12:59,016 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:206, output treesize:1301 [2018-04-11 11:12:59,335 WARN L151 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 276 DAG size of output 128 [2018-04-11 11:12:59,340 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 198 treesize of output 150 [2018-04-11 11:12:59,341 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 43 treesize of output 24 [2018-04-11 11:12:59,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:59,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:59,428 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 1 case distinctions, treesize of input 298 treesize of output 224 [2018-04-11 11:12:59,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 220 treesize of output 185 [2018-04-11 11:12:59,430 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:59,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 157 [2018-04-11 11:12:59,465 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:59,493 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:59,568 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 155 [2018-04-11 11:12:59,570 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 23 treesize of output 3 [2018-04-11 11:12:59,570 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:59,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 36 [2018-04-11 11:12:59,585 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:59,597 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:59,669 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 138 [2018-04-11 11:12:59,670 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 23 treesize of output 3 [2018-04-11 11:12:59,670 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:59,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 38 [2018-04-11 11:12:59,684 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 11:12:59,693 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:12:59,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 4 dim-2 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2018-04-11 11:12:59,750 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 13 variables, input treesize:848, output treesize:456 [2018-04-11 11:13:00,033 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:13:00,042 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 3 case distinctions, treesize of input 143 treesize of output 196 [2018-04-11 11:13:00,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 185 [2018-04-11 11:13:00,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:13:00,076 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:13:00,076 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 112 treesize of output 106 [2018-04-11 11:13:00,077 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:13:00,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:13:00,182 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:13:00,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 173 treesize of output 244 [2018-04-11 11:13:00,192 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 177 treesize of output 165 [2018-04-11 11:13:00,193 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:13:00,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 149 [2018-04-11 11:13:00,239 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:13:00,268 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:13:00,359 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:13:00,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 147 [2018-04-11 11:13:00,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 134 treesize of output 136 [2018-04-11 11:13:00,370 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 11:13:00,411 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:13:00,411 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 93 treesize of output 87 [2018-04-11 11:13:00,411 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 11:13:00,439 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:13:00,544 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:13:00,552 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 3 case distinctions, treesize of input 101 treesize of output 140 [2018-04-11 11:13:00,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 93 [2018-04-11 11:13:00,555 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 11:13:00,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 81 [2018-04-11 11:13:00,593 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 11:13:00,616 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:13:00,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: 16 dim-0 vars, and 8 xjuncts. [2018-04-11 11:13:00,732 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 12 variables, input treesize:518, output treesize:861 [2018-04-11 11:13:01,039 WARN L151 SmtUtils]: Spent 166ms on a formula simplification. DAG size of input: 192 DAG size of output 176 [2018-04-11 11:13:01,245 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:13:01,249 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:13:01,250 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 101 [2018-04-11 11:13:01,264 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 10 treesize of output 15 [2018-04-11 11:13:01,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:13:01,335 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:13:01,335 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:13:01,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:13:01,504 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:13:01,506 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 147 treesize of output 147 [2018-04-11 11:13:01,507 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:13:01,507 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:13:01,518 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:13:01,618 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 93 [2018-04-11 11:13:01,619 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:13:01,619 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 11:13:01,630 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:13:01,744 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:13:01,745 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 87 treesize of output 87 [2018-04-11 11:13:01,746 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:13:01,746 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 11:13:01,754 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:13:01,848 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:13:01,849 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:13:01,851 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:13:01,854 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 116 [2018-04-11 11:13:01,856 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 98 treesize of output 93 [2018-04-11 11:13:01,857 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 11:13:01,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 79 [2018-04-11 11:13:01,901 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 11:13:01,925 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 79 treesize of output 74 [2018-04-11 11:13:01,925 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 11:13:01,945 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:13:02,046 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:13:02,048 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:13:02,054 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 2 case distinctions, treesize of input 156 treesize of output 210 [2018-04-11 11:13:02,057 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 188 treesize of output 183 [2018-04-11 11:13:02,057 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 11:13:02,115 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 174 treesize of output 169 [2018-04-11 11:13:02,115 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-11 11:13:02,161 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 178 treesize of output 171 [2018-04-11 11:13:02,162 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-11 11:13:02,208 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 169 treesize of output 162 [2018-04-11 11:13:02,208 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-11 11:13:02,252 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 171 treesize of output 166 [2018-04-11 11:13:02,252 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-11 11:13:02,295 INFO L267 ElimStorePlain]: Start of recursive call 15: 5 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 11:13:02,431 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:13:02,433 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:13:02,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 156 [2018-04-11 11:13:02,441 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 134 treesize of output 139 [2018-04-11 11:13:02,441 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 11:13:02,471 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 138 treesize of output 133 [2018-04-11 11:13:02,471 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-11 11:13:02,497 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 125 treesize of output 118 [2018-04-11 11:13:02,498 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-11 11:13:02,527 INFO L267 ElimStorePlain]: Start of recursive call 21: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:13:02,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 15 dim-0 vars, 7 dim-2 vars, End of recursive call: 22 dim-0 vars, and 11 xjuncts. [2018-04-11 11:13:02,685 INFO L202 ElimStorePlain]: Needed 24 recursive calls to eliminate 22 variables, input treesize:804, output treesize:1262 [2018-04-11 11:13:03,094 WARN L151 SmtUtils]: Spent 281ms on a formula simplification. DAG size of input: 248 DAG size of output 224 [2018-04-11 11:13:03,240 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:13:03,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 93 [2018-04-11 11:13:03,251 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 83 treesize of output 74 [2018-04-11 11:13:03,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:13:03,288 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 74 treesize of output 62 [2018-04-11 11:13:03,289 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:13:03,324 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 75 treesize of output 60 [2018-04-11 11:13:03,325 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:13:03,358 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 44 treesize of output 35 [2018-04-11 11:13:03,358 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:13:03,391 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 35 treesize of output 23 [2018-04-11 11:13:03,392 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:13:03,423 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 60 treesize of output 49 [2018-04-11 11:13:03,423 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 11:13:03,455 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2018-04-11 11:13:03,455 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:13:03,483 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 71 treesize of output 63 [2018-04-11 11:13:03,483 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 11:13:03,512 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 35 [2018-04-11 11:13:03,513 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:13:03,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2018-04-11 11:13:03,537 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 11:13:03,568 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 63 [2018-04-11 11:13:03,569 INFO L267 ElimStorePlain]: Start of recursive call 13: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-04-11 11:13:03,613 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 42 treesize of output 33 [2018-04-11 11:13:03,613 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 11:13:03,614 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 40 treesize of output 29 [2018-04-11 11:13:03,614 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 11:13:03,615 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:13:03,615 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 11:13:03,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 31 [2018-04-11 11:13:03,616 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-11 11:13:03,653 INFO L267 ElimStorePlain]: Start of recursive call 2: 12 dim-1 vars, End of recursive call: 7 dim-0 vars, and 7 xjuncts. [2018-04-11 11:13:03,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 187 treesize of output 107 [2018-04-11 11:13:03,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 66 [2018-04-11 11:13:03,765 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-11 11:13:03,819 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 69 [2018-04-11 11:13:03,819 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:13:03,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 78 [2018-04-11 11:13:03,881 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-11 11:13:03,935 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 68 [2018-04-11 11:13:03,936 INFO L267 ElimStorePlain]: Start of recursive call 22: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-04-11 11:13:04,011 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 70 [2018-04-11 11:13:04,012 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 11:13:04,094 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 97 treesize of output 86 [2018-04-11 11:13:04,095 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-11 11:13:04,194 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 50 treesize of output 38 [2018-04-11 11:13:04,194 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:13:04,195 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 48 treesize of output 36 [2018-04-11 11:13:04,195 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:13:04,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 66 [2018-04-11 11:13:04,272 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:13:04,348 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 66 treesize of output 54 [2018-04-11 11:13:04,349 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-11 11:13:04,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 61 [2018-04-11 11:13:04,421 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-11 11:13:04,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2018-04-11 11:13:04,491 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:13:04,561 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 51 treesize of output 42 [2018-04-11 11:13:04,561 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-11 11:13:04,627 INFO L267 ElimStorePlain]: Start of recursive call 18: 12 dim-1 vars, End of recursive call: 14 dim-0 vars, and 7 xjuncts. [2018-04-11 11:13:04,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 76 [2018-04-11 11:13:04,807 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 29 treesize of output 18 [2018-04-11 11:13:04,808 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-11 11:13:04,814 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 36 treesize of output 20 [2018-04-11 11:13:04,815 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:13:04,821 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 20 treesize of output 14 [2018-04-11 11:13:04,822 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:13:04,828 INFO L267 ElimStorePlain]: Start of recursive call 32: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 11:13:04,993 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:13:04,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, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 55 [2018-04-11 11:13:04,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 9 treesize of output 1 [2018-04-11 11:13:04,996 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-04-11 11:13:05,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 6 [2018-04-11 11:13:05,002 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-04-11 11:13:05,007 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 25 treesize of output 14 [2018-04-11 11:13:05,007 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-04-11 11:13:05,010 INFO L267 ElimStorePlain]: Start of recursive call 36: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:13:05,166 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:13:05,167 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:13:05,168 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:13:05,169 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 87 treesize of output 77 [2018-04-11 11:13:05,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2018-04-11 11:13:05,170 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-04-11 11:13:05,178 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 22 treesize of output 16 [2018-04-11 11:13:05,178 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:13:05,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 18 [2018-04-11 11:13:05,186 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-04-11 11:13:05,192 INFO L267 ElimStorePlain]: Start of recursive call 40: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:13:05,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 14 dim-0 vars, 5 dim-2 vars, End of recursive call: 24 dim-0 vars, and 17 xjuncts. [2018-04-11 11:13:05,343 INFO L202 ElimStorePlain]: Needed 43 recursive calls to eliminate 19 variables, input treesize:598, output treesize:302 [2018-04-11 11:13:05,419 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:13:05,437 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:13:05,438 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 31] total 56 [2018-04-11 11:13:05,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-04-11 11:13:05,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-04-11 11:13:05,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=371, Invalid=2821, Unknown=0, NotChecked=0, Total=3192 [2018-04-11 11:13:05,438 INFO L87 Difference]: Start difference. First operand 420 states and 490 transitions. Second operand 57 states. [2018-04-11 11:13:07,944 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 151 DAG size of output 116 [2018-04-11 11:13:08,363 WARN L151 SmtUtils]: Spent 220ms on a formula simplification. DAG size of input: 205 DAG size of output 185 [2018-04-11 11:13:08,615 WARN L151 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 133 DAG size of output 129 [2018-04-11 11:13:08,898 WARN L151 SmtUtils]: Spent 159ms on a formula simplification. DAG size of input: 199 DAG size of output 195 [2018-04-11 11:13:09,262 WARN L151 SmtUtils]: Spent 189ms on a formula simplification. DAG size of input: 298 DAG size of output 189 [2018-04-11 11:13:12,238 WARN L151 SmtUtils]: Spent 2732ms on a formula simplification. DAG size of input: 392 DAG size of output 283 Received shutdown request... [2018-04-11 11:13:12,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-04-11 11:13:12,940 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 11:13:12,943 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 11:13:12,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 11:13:12 BoogieIcfgContainer [2018-04-11 11:13:12,944 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 11:13:12,944 INFO L168 Benchmark]: Toolchain (without parser) took 177401.09 ms. Allocated memory was 402.7 MB in the beginning and 702.0 MB in the end (delta: 299.4 MB). Free memory was 337.2 MB in the beginning and 579.4 MB in the end (delta: -242.1 MB). Peak memory consumption was 269.1 MB. Max. memory is 5.3 GB. [2018-04-11 11:13:12,945 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 402.7 MB. Free memory is still 363.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 11:13:12,945 INFO L168 Benchmark]: CACSL2BoogieTranslator took 269.68 ms. Allocated memory is still 402.7 MB. Free memory was 335.9 MB in the beginning and 310.8 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 5.3 GB. [2018-04-11 11:13:12,945 INFO L168 Benchmark]: Boogie Preprocessor took 43.31 ms. Allocated memory is still 402.7 MB. Free memory was 310.8 MB in the beginning and 308.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-11 11:13:12,946 INFO L168 Benchmark]: RCFGBuilder took 449.45 ms. Allocated memory was 402.7 MB in the beginning and 615.0 MB in the end (delta: 212.3 MB). Free memory was 308.1 MB in the beginning and 540.3 MB in the end (delta: -232.2 MB). Peak memory consumption was 23.5 MB. Max. memory is 5.3 GB. [2018-04-11 11:13:12,946 INFO L168 Benchmark]: TraceAbstraction took 176635.91 ms. Allocated memory was 615.0 MB in the beginning and 702.0 MB in the end (delta: 87.0 MB). Free memory was 540.3 MB in the beginning and 579.4 MB in the end (delta: -39.0 MB). Peak memory consumption was 259.9 MB. Max. memory is 5.3 GB. [2018-04-11 11:13:12,947 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.13 ms. Allocated memory is still 402.7 MB. Free memory is still 363.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 269.68 ms. Allocated memory is still 402.7 MB. Free memory was 335.9 MB in the beginning and 310.8 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 43.31 ms. Allocated memory is still 402.7 MB. Free memory was 310.8 MB in the beginning and 308.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 449.45 ms. Allocated memory was 402.7 MB in the beginning and 615.0 MB in the end (delta: 212.3 MB). Free memory was 308.1 MB in the beginning and 540.3 MB in the end (delta: -232.2 MB). Peak memory consumption was 23.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 176635.91 ms. Allocated memory was 615.0 MB in the beginning and 702.0 MB in the end (delta: 87.0 MB). Free memory was 540.3 MB in the beginning and 579.4 MB in the end (delta: -39.0 MB). Peak memory consumption was 259.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 639]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 51 states, 57 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 359. - TimeoutResultAtElement [Line: 649]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 51 states, 57 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 359. - TimeoutResultAtElement [Line: 666]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 51 states, 57 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 359. - TimeoutResultAtElement [Line: 665]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 51 states, 57 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 359. - TimeoutResultAtElement [Line: 657]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 51 states, 57 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 359. - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 51 states, 57 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 359. - TimeoutResultAtElement [Line: 635]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 51 states, 57 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 359. - TimeoutResultAtElement [Line: 659]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 51 states, 57 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 359. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 51 states, 57 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 359. - TimeoutResultAtElement [Line: 653]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 51 states, 57 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 359. - TimeoutResultAtElement [Line: 655]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 51 states, 57 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 359. - TimeoutResultAtElement [Line: 664]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 664). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 51 states, 57 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 359. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 51 states, 57 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 359. - TimeoutResultAtElement [Line: 649]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 51 states, 57 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 359. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 51 states, 57 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 359. - TimeoutResultAtElement [Line: 657]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 51 states, 57 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 359. - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 51 states, 57 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 359. - TimeoutResultAtElement [Line: 665]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 51 states, 57 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 359. - TimeoutResultAtElement [Line: 635]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 51 states, 57 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 359. - TimeoutResultAtElement [Line: 669]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 669). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 51 states, 57 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 359. - TimeoutResultAtElement [Line: 655]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 51 states, 57 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 359. - TimeoutResultAtElement [Line: 646]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 51 states, 57 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 359. - TimeoutResultAtElement [Line: 626]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 626). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 51 states, 57 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 359. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 51 states, 57 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 359. - TimeoutResultAtElement [Line: 659]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 51 states, 57 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 359. - TimeoutResultAtElement [Line: 669]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 669). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 51 states, 57 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 359. - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 51 states, 57 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 359. - TimeoutResultAtElement [Line: 664]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 664). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 51 states, 57 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 359. - TimeoutResultAtElement [Line: 666]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 51 states, 57 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 359. - TimeoutResultAtElement [Line: 646]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 51 states, 57 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 359. - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 51 states, 57 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 359. - TimeoutResultAtElement [Line: 639]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 51 states, 57 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 359. - TimeoutResultAtElement [Line: 653]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 51 states, 57 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 359. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 105 locations, 33 error locations. TIMEOUT Result, 176.5s OverallTime, 63 OverallIterations, 4 TraceHistogramMax, 109.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5634 SDtfs, 39812 SDslu, 80082 SDs, 0 SdLazy, 94287 SolverSat, 5917 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 43.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5483 GetRequests, 2194 SyntacticMatches, 194 SemanticMatches, 3094 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55544 ImplicationChecksByTransitivity, 94.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=426occurred in iteration=56, 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, 62 MinimizatonAttempts, 5197 StatesRemovedByMinimization, 60 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 62.6s InterpolantComputationTime, 6343 NumberOfCodeBlocks, 6310 NumberOfCodeBlocksAsserted, 165 NumberOfCheckSat, 6227 ConstructedInterpolants, 587 QuantifiedInterpolants, 11805520 SizeOfPredicates, 1063 NumberOfNonLiveVariables, 11743 ConjunctsInSsa, 2583 ConjunctsInUnsatCore, 116 InterpolantComputations, 10 PerfectInterpolantSequences, 247/2778 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list-ext_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_11-13-12-951.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list-ext_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_11-13-12-951.csv Completed graceful shutdown