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 -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-optional_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-10 16:24:52,954 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-10 16:24:52,955 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-10 16:24:52,966 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-10 16:24:52,966 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-10 16:24:52,967 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-10 16:24:52,967 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-10 16:24:52,969 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-10 16:24:52,970 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-10 16:24:52,971 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-10 16:24:52,972 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-10 16:24:52,972 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-10 16:24:52,973 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-10 16:24:52,974 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-10 16:24:52,974 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-10 16:24:52,976 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-10 16:24:52,977 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-10 16:24:52,979 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-10 16:24:52,979 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-10 16:24:52,980 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-10 16:24:52,982 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-10 16:24:52,982 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-10 16:24:52,982 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-10 16:24:52,983 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-10 16:24:52,984 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-10 16:24:52,985 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-10 16:24:52,985 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-10 16:24:52,985 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-10 16:24:52,986 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-10 16:24:52,986 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-10 16:24:52,987 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-10 16:24:52,987 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-04-10 16:24:53,005 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-10 16:24:53,005 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-10 16:24:53,006 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-10 16:24:53,006 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-10 16:24:53,006 INFO L133 SettingsManager]: * Use SBE=true [2018-04-10 16:24:53,007 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-10 16:24:53,007 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-10 16:24:53,007 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-10 16:24:53,007 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-10 16:24:53,007 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-10 16:24:53,007 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-10 16:24:53,007 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-10 16:24:53,008 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-10 16:24:53,008 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-10 16:24:53,008 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-10 16:24:53,008 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-10 16:24:53,008 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-10 16:24:53,008 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-10 16:24:53,009 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-10 16:24:53,009 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 16:24:53,009 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-10 16:24:53,009 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-10 16:24:53,009 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-10 16:24:53,009 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-04-10 16:24:53,037 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-10 16:24:53,047 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-10 16:24:53,050 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-10 16:24:53,051 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-10 16:24:53,051 INFO L276 PluginConnector]: CDTParser initialized [2018-04-10 16:24:53,052 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,366 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG76517cf55 [2018-04-10 16:24:53,481 INFO L287 CDTParser]: IsIndexed: true [2018-04-10 16:24:53,482 INFO L288 CDTParser]: Found 1 translation units. [2018-04-10 16:24:53,483 INFO L168 CDTParser]: Scanning dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,490 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-10 16:24:53,490 INFO L215 ultiparseSymbolTable]: [2018-04-10 16:24:53,490 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-10 16:24:53,490 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,490 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-10 16:24:53,490 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____ino_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,490 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____u_quad_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,491 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____pid_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,491 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____syscall_slong_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,491 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__pthread_barrier_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,491 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__u_long in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,491 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____ino64_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,491 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____gid_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,491 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__int64_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,491 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__suseconds_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,491 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____fsid_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,491 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____off_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,491 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____sigset_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,491 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____quad_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,492 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__fd_mask in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,492 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__pthread_rwlockattr_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,492 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____uint8_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,492 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____key_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,492 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__ushort in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,492 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__SLL in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,492 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__clockid_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,492 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__clock_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,492 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____daddr_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,492 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____uint16_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,492 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__fsid_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,493 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__daddr_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,493 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____fd_mask in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,493 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__u_int32_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,493 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____clock_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,493 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__pthread_condattr_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,493 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__u_int8_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,493 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____loff_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,493 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__pthread_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,493 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____uid_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,493 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____sig_atomic_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,493 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____uint64_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,494 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____fsblkcnt_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,494 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____blksize_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,494 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____qaddr_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,494 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__nlink_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,494 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____fsword_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,494 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____int64_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,494 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__loff_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,494 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__uint in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,494 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__u_quad_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,494 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__ssize_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,494 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__time_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,494 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____u_int in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,495 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__dev_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,495 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____useconds_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,495 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__id_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,495 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____fsfilcnt64_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,495 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__pthread_barrierattr_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,495 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__register_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,495 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__sigset_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,495 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__pthread_rwlock_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,495 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__pthread_key_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,495 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____blkcnt_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,495 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____timer_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,496 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____time_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,496 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____fsfilcnt_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,496 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__key_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,496 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____u_short in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,496 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__pthread_mutexattr_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,496 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____mode_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,496 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__idtype_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,496 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____rlim_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,496 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__int32_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,496 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__caddr_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,496 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__ino_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,496 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__u_int64_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,496 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__fsfilcnt_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,497 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__pthread_mutex_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,497 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__pid_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,497 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__int8_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,497 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__ldiv_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,497 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__gid_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,497 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__fsblkcnt_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,497 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____suseconds_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,497 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____pthread_slist_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,497 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____blkcnt64_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,497 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____nlink_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,497 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__mode_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,497 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____rlim64_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,498 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__u_int in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,498 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____id_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,498 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____ssize_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,498 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__timer_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,498 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____int8_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,498 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____int32_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,498 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____syscall_ulong_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,498 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__pthread_attr_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,498 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____off64_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,498 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____caddr_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,498 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____dev_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,498 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__blksize_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,498 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__int16_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,499 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__wchar_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,499 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____fsblkcnt64_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,499 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__fd_set in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,499 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____u_char in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,499 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__ulong in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,499 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____int16_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,499 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__u_short in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,499 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__off_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,499 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__div_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,499 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____u_long in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,499 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____clockid_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,499 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__pthread_spinlock_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,499 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__uid_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,499 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__lldiv_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,500 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____socklen_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,500 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__blkcnt_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,500 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__quad_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,500 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____uint32_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,500 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__pthread_once_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,500 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__u_char in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,500 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__u_int16_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,500 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i____intptr_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,500 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__pthread_cond_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,500 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_optional_true_unreach_call_true_valid_memsafety_i__size_t in dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:53,516 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG76517cf55 [2018-04-10 16:24:53,520 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-10 16:24:53,521 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-10 16:24:53,521 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-10 16:24:53,522 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-10 16:24:53,525 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-10 16:24:53,526 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 04:24:53" (1/1) ... [2018-04-10 16:24:53,527 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7382c1a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:24:53, skipping insertion in model container [2018-04-10 16:24:53,527 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 04:24:53" (1/1) ... [2018-04-10 16:24:53,537 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 16:24:53,564 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 16:24:53,687 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 16:24:53,721 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 16:24:53,727 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 115 non ball SCCs. Number of states in SCCs 115. [2018-04-10 16:24:53,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:24:53 WrapperNode [2018-04-10 16:24:53,763 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-10 16:24:53,763 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-10 16:24:53,763 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-10 16:24:53,764 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-10 16:24:53,775 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:24:53" (1/1) ... [2018-04-10 16:24:53,775 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:24:53" (1/1) ... [2018-04-10 16:24:53,788 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:24:53" (1/1) ... [2018-04-10 16:24:53,788 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:24:53" (1/1) ... [2018-04-10 16:24:53,797 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:24:53" (1/1) ... [2018-04-10 16:24:53,802 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:24:53" (1/1) ... [2018-04-10 16:24:53,805 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:24:53" (1/1) ... [2018-04-10 16:24:53,808 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-10 16:24:53,809 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-10 16:24:53,809 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-10 16:24:53,809 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-10 16:24:53,809 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:24:53" (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-10 16:24:53,892 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-10 16:24:53,892 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-10 16:24:53,892 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-10 16:24:53,892 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-10 16:24:53,892 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-10 16:24:53,892 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-10 16:24:53,893 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-10 16:24:53,893 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-10 16:24:53,893 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-10 16:24:53,893 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-10 16:24:53,893 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-10 16:24:53,893 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-10 16:24:53,893 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-10 16:24:53,893 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-10 16:24:53,893 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-10 16:24:53,893 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-10 16:24:53,893 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-10 16:24:53,893 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-10 16:24:53,893 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-10 16:24:53,893 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-10 16:24:53,893 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-10 16:24:53,893 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-10 16:24:53,894 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-10 16:24:53,894 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-10 16:24:53,894 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-10 16:24:53,894 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-10 16:24:53,894 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-10 16:24:53,894 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-10 16:24:53,894 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-10 16:24:53,894 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-10 16:24:53,894 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-10 16:24:53,894 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-10 16:24:53,894 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-10 16:24:53,894 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-10 16:24:53,894 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-10 16:24:53,894 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-10 16:24:53,894 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-10 16:24:53,894 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-10 16:24:53,894 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-10 16:24:53,895 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-10 16:24:53,895 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-10 16:24:53,895 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-10 16:24:53,895 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-10 16:24:53,895 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-10 16:24:53,895 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-10 16:24:53,895 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-10 16:24:53,895 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-10 16:24:53,895 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-10 16:24:53,896 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-10 16:24:53,896 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-10 16:24:53,896 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-10 16:24:53,896 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-10 16:24:53,896 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-10 16:24:53,896 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-10 16:24:53,896 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-10 16:24:53,896 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-10 16:24:53,896 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-10 16:24:53,897 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-10 16:24:53,897 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-10 16:24:53,897 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-10 16:24:53,897 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-10 16:24:53,897 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-10 16:24:53,897 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-10 16:24:53,897 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-10 16:24:53,897 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-10 16:24:53,897 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-10 16:24:53,897 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-10 16:24:53,898 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-10 16:24:53,898 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-10 16:24:53,898 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-10 16:24:53,898 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-10 16:24:53,898 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-10 16:24:53,898 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-10 16:24:53,898 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-10 16:24:53,898 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-10 16:24:53,898 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-10 16:24:53,898 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-10 16:24:53,899 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-10 16:24:53,899 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-10 16:24:53,899 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-10 16:24:53,899 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-10 16:24:53,899 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-10 16:24:53,899 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-10 16:24:53,899 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-10 16:24:53,899 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-10 16:24:53,899 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-10 16:24:53,899 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-10 16:24:53,900 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-10 16:24:53,900 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-10 16:24:53,900 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-10 16:24:53,900 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-10 16:24:53,900 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-10 16:24:53,900 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-10 16:24:53,900 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-10 16:24:53,900 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-10 16:24:53,900 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-10 16:24:53,900 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-10 16:24:53,901 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-10 16:24:53,901 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-10 16:24:53,901 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-10 16:24:53,901 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-10 16:24:53,901 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-10 16:24:53,901 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-10 16:24:53,901 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-10 16:24:53,901 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-10 16:24:53,901 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-10 16:24:53,901 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-10 16:24:53,902 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-10 16:24:53,902 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-10 16:24:53,902 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-10 16:24:53,902 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-10 16:24:53,902 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-10 16:24:53,902 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-10 16:24:53,902 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-10 16:24:53,902 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-10 16:24:53,902 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-10 16:24:53,902 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-10 16:24:53,903 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-10 16:24:54,316 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-10 16:24:54,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 04:24:54 BoogieIcfgContainer [2018-04-10 16:24:54,316 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-10 16:24:54,317 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-10 16:24:54,317 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-10 16:24:54,320 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-10 16:24:54,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.04 04:24:53" (1/3) ... [2018-04-10 16:24:54,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51b408b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 04:24:54, skipping insertion in model container [2018-04-10 16:24:54,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:24:53" (2/3) ... [2018-04-10 16:24:54,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51b408b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 04:24:54, skipping insertion in model container [2018-04-10 16:24:54,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 04:24:54" (3/3) ... [2018-04-10 16:24:54,323 INFO L107 eAbstractionObserver]: Analyzing ICFG dll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:54,330 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-10 16:24:54,337 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 69 error locations. [2018-04-10 16:24:54,370 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-10 16:24:54,371 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-10 16:24:54,371 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-10 16:24:54,371 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-10 16:24:54,371 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-10 16:24:54,371 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-10 16:24:54,371 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-10 16:24:54,371 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-10 16:24:54,371 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-10 16:24:54,372 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-10 16:24:54,383 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states. [2018-04-10 16:24:54,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-10 16:24:54,388 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:24:54,389 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:24:54,389 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-10 16:24:54,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1857371026, now seen corresponding path program 1 times [2018-04-10 16:24:54,392 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:24:54,393 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:24:54,424 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:24:54,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:24:54,424 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:24:54,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:24:54,456 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:24:54,506 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-10 16:24:54,508 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:24:54,508 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 16:24:54,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 16:24:54,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 16:24:54,522 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 16:24:54,524 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 4 states. [2018-04-10 16:24:54,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:24:54,709 INFO L93 Difference]: Finished difference Result 177 states and 189 transitions. [2018-04-10 16:24:54,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:24:54,710 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-10 16:24:54,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:24:54,725 INFO L225 Difference]: With dead ends: 177 [2018-04-10 16:24:54,725 INFO L226 Difference]: Without dead ends: 173 [2018-04-10 16:24:54,726 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:24:54,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-04-10 16:24:54,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 147. [2018-04-10 16:24:54,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-04-10 16:24:54,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 158 transitions. [2018-04-10 16:24:54,761 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 158 transitions. Word has length 8 [2018-04-10 16:24:54,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:24:54,762 INFO L459 AbstractCegarLoop]: Abstraction has 147 states and 158 transitions. [2018-04-10 16:24:54,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 16:24:54,762 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 158 transitions. [2018-04-10 16:24:54,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-10 16:24:54,762 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:24:54,762 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:24:54,762 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-10 16:24:54,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1857371027, now seen corresponding path program 1 times [2018-04-10 16:24:54,762 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:24:54,762 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:24:54,763 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:24:54,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:24:54,764 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:24:54,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:24:54,772 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:24:54,813 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-10 16:24:54,813 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:24:54,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 16:24:54,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 16:24:54,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 16:24:54,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 16:24:54,815 INFO L87 Difference]: Start difference. First operand 147 states and 158 transitions. Second operand 4 states. [2018-04-10 16:24:54,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:24:54,929 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2018-04-10 16:24:54,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 16:24:54,930 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-10 16:24:54,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:24:54,930 INFO L225 Difference]: With dead ends: 143 [2018-04-10 16:24:54,930 INFO L226 Difference]: Without dead ends: 143 [2018-04-10 16:24:54,931 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:24:54,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-04-10 16:24:54,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 138. [2018-04-10 16:24:54,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-04-10 16:24:54,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 149 transitions. [2018-04-10 16:24:54,936 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 149 transitions. Word has length 8 [2018-04-10 16:24:54,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:24:54,936 INFO L459 AbstractCegarLoop]: Abstraction has 138 states and 149 transitions. [2018-04-10 16:24:54,936 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 16:24:54,936 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2018-04-10 16:24:54,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-10 16:24:54,936 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:24:54,936 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:24:54,936 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-10 16:24:54,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1456476454, now seen corresponding path program 1 times [2018-04-10 16:24:54,937 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:24:54,937 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:24:54,938 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:24:54,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:24:54,938 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:24:54,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:24:54,950 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:24:54,983 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-10 16:24:54,984 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:24:54,984 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:24:54,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:24:54,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:24:54,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:24:54,985 INFO L87 Difference]: Start difference. First operand 138 states and 149 transitions. Second operand 5 states. [2018-04-10 16:24:55,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:24:55,283 INFO L93 Difference]: Finished difference Result 294 states and 318 transitions. [2018-04-10 16:24:55,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 16:24:55,283 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-04-10 16:24:55,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:24:55,285 INFO L225 Difference]: With dead ends: 294 [2018-04-10 16:24:55,285 INFO L226 Difference]: Without dead ends: 294 [2018-04-10 16:24:55,286 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-10 16:24:55,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-04-10 16:24:55,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 137. [2018-04-10 16:24:55,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-04-10 16:24:55,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 148 transitions. [2018-04-10 16:24:55,293 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 148 transitions. Word has length 16 [2018-04-10 16:24:55,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:24:55,293 INFO L459 AbstractCegarLoop]: Abstraction has 137 states and 148 transitions. [2018-04-10 16:24:55,294 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:24:55,294 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 148 transitions. [2018-04-10 16:24:55,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-10 16:24:55,294 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:24:55,294 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:24:55,294 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-10 16:24:55,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1456476453, now seen corresponding path program 1 times [2018-04-10 16:24:55,295 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:24:55,295 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:24:55,296 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:24:55,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:24:55,296 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:24:55,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:24:55,317 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:24:55,361 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-10 16:24:55,361 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:24:55,361 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:24:55,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:24:55,362 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:24:55,362 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:24:55,362 INFO L87 Difference]: Start difference. First operand 137 states and 148 transitions. Second operand 5 states. [2018-04-10 16:24:55,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:24:55,545 INFO L93 Difference]: Finished difference Result 250 states and 270 transitions. [2018-04-10 16:24:55,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 16:24:55,545 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-04-10 16:24:55,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:24:55,547 INFO L225 Difference]: With dead ends: 250 [2018-04-10 16:24:55,547 INFO L226 Difference]: Without dead ends: 250 [2018-04-10 16:24:55,547 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-10 16:24:55,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-04-10 16:24:55,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 136. [2018-04-10 16:24:55,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-04-10 16:24:55,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2018-04-10 16:24:55,554 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 16 [2018-04-10 16:24:55,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:24:55,554 INFO L459 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2018-04-10 16:24:55,554 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:24:55,554 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2018-04-10 16:24:55,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-10 16:24:55,555 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:24:55,555 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] [2018-04-10 16:24:55,555 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-10 16:24:55,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1227125051, now seen corresponding path program 1 times [2018-04-10 16:24:55,555 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:24:55,555 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:24:55,557 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:24:55,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:24:55,557 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:24:55,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:24:55,570 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:24:55,575 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:24:55,575 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:24:55,575 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:24:55,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:24:55,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:24:55,602 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:24:55,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:24:55,626 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:24:55,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:24:55,627 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-10 16:24:55,644 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:24:55,645 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:24:55,646 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-10 16:24:55,646 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:24:55,650 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-10 16:24:55,650 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-10 16:24:55,661 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-10 16:24:55,662 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:24:55,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 16:24:55,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 16:24:55,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 16:24:55,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-10 16:24:55,662 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand 6 states. [2018-04-10 16:24:55,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:24:55,847 INFO L93 Difference]: Finished difference Result 194 states and 211 transitions. [2018-04-10 16:24:55,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 16:24:55,847 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-04-10 16:24:55,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:24:55,847 INFO L225 Difference]: With dead ends: 194 [2018-04-10 16:24:55,848 INFO L226 Difference]: Without dead ends: 194 [2018-04-10 16:24:55,848 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-04-10 16:24:55,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-04-10 16:24:55,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 131. [2018-04-10 16:24:55,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-04-10 16:24:55,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 147 transitions. [2018-04-10 16:24:55,851 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 147 transitions. Word has length 20 [2018-04-10 16:24:55,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:24:55,851 INFO L459 AbstractCegarLoop]: Abstraction has 131 states and 147 transitions. [2018-04-10 16:24:55,851 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 16:24:55,851 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 147 transitions. [2018-04-10 16:24:55,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-10 16:24:55,851 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:24:55,852 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] [2018-04-10 16:24:55,852 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-10 16:24:55,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1227125050, now seen corresponding path program 1 times [2018-04-10 16:24:55,852 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:24:55,852 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:24:55,853 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:24:55,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:24:55,853 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:24:55,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:24:55,859 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:24:55,863 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:24:55,863 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:24:55,863 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:24:55,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:24:55,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:24:55,886 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:24:55,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:24:55,892 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:24:55,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:24:55,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:24:55,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:24:55,900 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-10 16:24:55,931 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:24:55,932 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:24:55,933 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-10 16:24:55,933 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:24:55,939 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-10 16:24:55,940 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:24:55,945 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-10 16:24:55,945 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:21 [2018-04-10 16:24:55,956 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-10 16:24:55,957 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:24:55,957 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-10 16:24:55,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 16:24:55,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 16:24:55,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-10 16:24:55,957 INFO L87 Difference]: Start difference. First operand 131 states and 147 transitions. Second operand 7 states. [2018-04-10 16:24:56,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:24:56,207 INFO L93 Difference]: Finished difference Result 177 states and 194 transitions. [2018-04-10 16:24:56,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 16:24:56,207 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-04-10 16:24:56,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:24:56,208 INFO L225 Difference]: With dead ends: 177 [2018-04-10 16:24:56,208 INFO L226 Difference]: Without dead ends: 177 [2018-04-10 16:24:56,208 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-04-10 16:24:56,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-04-10 16:24:56,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 159. [2018-04-10 16:24:56,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-04-10 16:24:56,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 181 transitions. [2018-04-10 16:24:56,213 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 181 transitions. Word has length 20 [2018-04-10 16:24:56,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:24:56,213 INFO L459 AbstractCegarLoop]: Abstraction has 159 states and 181 transitions. [2018-04-10 16:24:56,213 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 16:24:56,213 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 181 transitions. [2018-04-10 16:24:56,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-10 16:24:56,214 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:24:56,214 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:24:56,214 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-10 16:24:56,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1848833480, now seen corresponding path program 1 times [2018-04-10 16:24:56,214 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:24:56,214 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:24:56,215 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:24:56,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:24:56,216 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:24:56,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:24:56,224 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:24:56,256 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-10 16:24:56,256 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:24:56,256 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:24:56,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:24:56,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:24:56,257 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:24:56,257 INFO L87 Difference]: Start difference. First operand 159 states and 181 transitions. Second operand 5 states. [2018-04-10 16:24:56,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:24:56,402 INFO L93 Difference]: Finished difference Result 227 states and 259 transitions. [2018-04-10 16:24:56,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:24:56,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-04-10 16:24:56,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:24:56,403 INFO L225 Difference]: With dead ends: 227 [2018-04-10 16:24:56,404 INFO L226 Difference]: Without dead ends: 227 [2018-04-10 16:24:56,404 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-10 16:24:56,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-04-10 16:24:56,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 158. [2018-04-10 16:24:56,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-10 16:24:56,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 179 transitions. [2018-04-10 16:24:56,407 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 179 transitions. Word has length 22 [2018-04-10 16:24:56,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:24:56,407 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 179 transitions. [2018-04-10 16:24:56,407 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:24:56,407 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 179 transitions. [2018-04-10 16:24:56,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-10 16:24:56,408 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:24:56,408 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:24:56,408 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-10 16:24:56,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1848833481, now seen corresponding path program 1 times [2018-04-10 16:24:56,408 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:24:56,408 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:24:56,409 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:24:56,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:24:56,409 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:24:56,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:24:56,418 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:24:56,460 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-10 16:24:56,460 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:24:56,460 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:24:56,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:24:56,461 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:24:56,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:24:56,461 INFO L87 Difference]: Start difference. First operand 158 states and 179 transitions. Second operand 5 states. [2018-04-10 16:24:56,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:24:56,679 INFO L93 Difference]: Finished difference Result 244 states and 278 transitions. [2018-04-10 16:24:56,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 16:24:56,680 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-04-10 16:24:56,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:24:56,681 INFO L225 Difference]: With dead ends: 244 [2018-04-10 16:24:56,681 INFO L226 Difference]: Without dead ends: 244 [2018-04-10 16:24:56,681 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-10 16:24:56,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-04-10 16:24:56,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 157. [2018-04-10 16:24:56,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-04-10 16:24:56,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 177 transitions. [2018-04-10 16:24:56,685 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 177 transitions. Word has length 22 [2018-04-10 16:24:56,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:24:56,685 INFO L459 AbstractCegarLoop]: Abstraction has 157 states and 177 transitions. [2018-04-10 16:24:56,685 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:24:56,685 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 177 transitions. [2018-04-10 16:24:56,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-10 16:24:56,686 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:24:56,686 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:24:56,686 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-10 16:24:56,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1751147858, now seen corresponding path program 1 times [2018-04-10 16:24:56,687 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:24:56,687 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:24:56,688 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:24:56,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:24:56,688 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:24:56,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:24:56,694 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:24:56,722 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-10 16:24:56,722 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:24:56,722 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 16:24:56,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:24:56,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:24:56,723 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:24:56,723 INFO L87 Difference]: Start difference. First operand 157 states and 177 transitions. Second operand 5 states. [2018-04-10 16:24:56,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:24:56,820 INFO L93 Difference]: Finished difference Result 178 states and 195 transitions. [2018-04-10 16:24:56,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:24:56,821 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-04-10 16:24:56,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:24:56,821 INFO L225 Difference]: With dead ends: 178 [2018-04-10 16:24:56,822 INFO L226 Difference]: Without dead ends: 178 [2018-04-10 16:24:56,822 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-10 16:24:56,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-04-10 16:24:56,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 157. [2018-04-10 16:24:56,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-04-10 16:24:56,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 175 transitions. [2018-04-10 16:24:56,825 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 175 transitions. Word has length 26 [2018-04-10 16:24:56,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:24:56,825 INFO L459 AbstractCegarLoop]: Abstraction has 157 states and 175 transitions. [2018-04-10 16:24:56,826 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:24:56,826 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 175 transitions. [2018-04-10 16:24:56,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-10 16:24:56,826 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:24:56,826 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:24:56,826 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-10 16:24:56,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1933205494, now seen corresponding path program 1 times [2018-04-10 16:24:56,827 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:24:56,827 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:24:56,828 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:24:56,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:24:56,828 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:24:56,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:24:56,838 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:24:56,841 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:24:56,842 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:24:56,842 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:24:56,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:24:56,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:24:56,871 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:24:56,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 6 treesize of output 5 [2018-04-10 16:24:56,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:24:56,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:24:56,889 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-10 16:24:56,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, 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-10 16:24:56,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 8 treesize of output 7 [2018-04-10 16:24:56,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:24:56,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:24:56,914 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-10 16:24:56,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:24:56,916 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:24:56,918 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:24:56,924 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-10 16:24:56,925 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:34, output treesize:20 [2018-04-10 16:24:56,937 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-10 16:24:56,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 16:24:56,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:24:56,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:24:56,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:24:56,945 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:16 [2018-04-10 16:24:56,974 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 23 treesize of output 35 [2018-04-10 16:24:56,978 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:24:56,980 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 21 treesize of output 28 [2018-04-10 16:24:56,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:24:56,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:24:56,998 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:24:57,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:24:57,011 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-10 16:24:57,011 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:29, output treesize:25 [2018-04-10 16:24:57,039 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2018-04-10 16:24:57,043 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 21 treesize of output 17 [2018-04-10 16:24:57,043 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:24:57,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-10 16:24:57,056 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:24:57,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:24:57,092 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-10 16:24:57,092 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:5 [2018-04-10 16:24:57,107 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-10 16:24:57,108 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:24:57,108 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-10 16:24:57,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 16:24:57,108 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 16:24:57,108 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-04-10 16:24:57,108 INFO L87 Difference]: Start difference. First operand 157 states and 175 transitions. Second operand 11 states. [2018-04-10 16:24:57,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:24:57,487 INFO L93 Difference]: Finished difference Result 172 states and 188 transitions. [2018-04-10 16:24:57,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-10 16:24:57,487 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-04-10 16:24:57,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:24:57,488 INFO L225 Difference]: With dead ends: 172 [2018-04-10 16:24:57,488 INFO L226 Difference]: Without dead ends: 172 [2018-04-10 16:24:57,488 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=317, Unknown=0, NotChecked=0, Total=462 [2018-04-10 16:24:57,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-04-10 16:24:57,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 159. [2018-04-10 16:24:57,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-04-10 16:24:57,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 178 transitions. [2018-04-10 16:24:57,492 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 178 transitions. Word has length 26 [2018-04-10 16:24:57,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:24:57,492 INFO L459 AbstractCegarLoop]: Abstraction has 159 states and 178 transitions. [2018-04-10 16:24:57,492 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 16:24:57,492 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 178 transitions. [2018-04-10 16:24:57,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-10 16:24:57,493 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:24:57,493 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:24:57,493 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-10 16:24:57,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1933205493, now seen corresponding path program 1 times [2018-04-10 16:24:57,493 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:24:57,493 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:24:57,494 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:24:57,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:24:57,497 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:24:57,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:24:57,506 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:24:57,510 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:24:57,510 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:24:57,511 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:24:57,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:24:57,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:24:57,534 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:24:57,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 6 treesize of output 5 [2018-04-10 16:24:57,561 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:24:57,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:24:57,564 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-10 16:24:57,573 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-10 16:24:57,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:24:57,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:24:57,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:24:57,584 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-10 16:24:57,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:24:57,585 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:24:57,587 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:24:57,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:24:57,591 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:20 [2018-04-10 16:24:57,633 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 28 treesize of output 38 [2018-04-10 16:24:57,637 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:24:57,638 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 24 treesize of output 33 [2018-04-10 16:24:57,639 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:24:57,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-04-10 16:24:57,657 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:24:57,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:24:57,693 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 23 treesize of output 35 [2018-04-10 16:24:57,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-10 16:24:57,699 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:24:57,714 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:24:57,732 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-10 16:24:57,732 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:53, output treesize:45 [2018-04-10 16:24:57,760 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 91 [2018-04-10 16:24:57,763 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 84 treesize of output 68 [2018-04-10 16:24:57,763 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-10 16:24:57,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 49 [2018-04-10 16:24:57,782 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:24:57,798 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:24:57,800 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 76 treesize of output 57 [2018-04-10 16:24:57,800 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-10 16:24:57,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-10 16:24:57,841 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 54 treesize of output 48 [2018-04-10 16:24:57,847 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:24:57,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 24 [2018-04-10 16:24:57,848 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:24:57,858 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:24:57,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 44 [2018-04-10 16:24:57,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 7 [2018-04-10 16:24:57,862 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:24:57,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-04-10 16:24:57,868 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 16:24:57,872 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:24:57,878 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-10 16:24:57,879 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:107, output treesize:9 [2018-04-10 16:24:57,894 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-10 16:24:57,894 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:24:57,894 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-10 16:24:57,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 16:24:57,895 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 16:24:57,895 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-04-10 16:24:57,895 INFO L87 Difference]: Start difference. First operand 159 states and 178 transitions. Second operand 11 states. [2018-04-10 16:24:58,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:24:58,394 INFO L93 Difference]: Finished difference Result 183 states and 202 transitions. [2018-04-10 16:24:58,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-10 16:24:58,394 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-04-10 16:24:58,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:24:58,395 INFO L225 Difference]: With dead ends: 183 [2018-04-10 16:24:58,395 INFO L226 Difference]: Without dead ends: 183 [2018-04-10 16:24:58,395 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=202, Invalid=398, Unknown=0, NotChecked=0, Total=600 [2018-04-10 16:24:58,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-04-10 16:24:58,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 148. [2018-04-10 16:24:58,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-04-10 16:24:58,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 166 transitions. [2018-04-10 16:24:58,398 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 166 transitions. Word has length 26 [2018-04-10 16:24:58,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:24:58,398 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 166 transitions. [2018-04-10 16:24:58,398 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 16:24:58,398 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 166 transitions. [2018-04-10 16:24:58,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-10 16:24:58,398 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:24:58,398 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:24:58,398 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-10 16:24:58,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1353466829, now seen corresponding path program 1 times [2018-04-10 16:24:58,399 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:24:58,399 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:24:58,400 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:24:58,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:24:58,400 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:24:58,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:24:58,408 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:24:58,435 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-10 16:24:58,436 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:24:58,436 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:24:58,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 16:24:58,436 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 16:24:58,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 16:24:58,437 INFO L87 Difference]: Start difference. First operand 148 states and 166 transitions. Second operand 4 states. [2018-04-10 16:24:58,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:24:58,462 INFO L93 Difference]: Finished difference Result 174 states and 196 transitions. [2018-04-10 16:24:58,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:24:58,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-04-10 16:24:58,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:24:58,464 INFO L225 Difference]: With dead ends: 174 [2018-04-10 16:24:58,464 INFO L226 Difference]: Without dead ends: 174 [2018-04-10 16:24:58,464 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:24:58,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-04-10 16:24:58,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 152. [2018-04-10 16:24:58,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-04-10 16:24:58,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 170 transitions. [2018-04-10 16:24:58,467 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 170 transitions. Word has length 29 [2018-04-10 16:24:58,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:24:58,467 INFO L459 AbstractCegarLoop]: Abstraction has 152 states and 170 transitions. [2018-04-10 16:24:58,467 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 16:24:58,467 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 170 transitions. [2018-04-10 16:24:58,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-10 16:24:58,468 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:24:58,468 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:24:58,468 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-10 16:24:58,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1930510614, now seen corresponding path program 1 times [2018-04-10 16:24:58,469 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:24:58,469 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:24:58,470 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:24:58,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:24:58,470 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:24:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:24:58,478 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:24:58,635 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-10 16:24:58,636 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:24:58,636 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-10 16:24:58,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 16:24:58,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 16:24:58,637 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-04-10 16:24:58,637 INFO L87 Difference]: Start difference. First operand 152 states and 170 transitions. Second operand 10 states. [2018-04-10 16:24:58,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:24:58,908 INFO L93 Difference]: Finished difference Result 264 states and 296 transitions. [2018-04-10 16:24:58,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 16:24:58,908 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-04-10 16:24:58,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:24:58,908 INFO L225 Difference]: With dead ends: 264 [2018-04-10 16:24:58,908 INFO L226 Difference]: Without dead ends: 264 [2018-04-10 16:24:58,909 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2018-04-10 16:24:58,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-04-10 16:24:58,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 215. [2018-04-10 16:24:58,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-04-10 16:24:58,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 253 transitions. [2018-04-10 16:24:58,911 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 253 transitions. Word has length 31 [2018-04-10 16:24:58,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:24:58,911 INFO L459 AbstractCegarLoop]: Abstraction has 215 states and 253 transitions. [2018-04-10 16:24:58,912 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 16:24:58,912 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 253 transitions. [2018-04-10 16:24:58,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-10 16:24:58,912 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:24:58,912 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:24:58,912 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-10 16:24:58,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1930510613, now seen corresponding path program 1 times [2018-04-10 16:24:58,912 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:24:58,912 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:24:58,913 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:24:58,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:24:58,913 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:24:58,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:24:58,922 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:24:59,038 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-10 16:24:59,038 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:24:59,038 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-10 16:24:59,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 16:24:59,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 16:24:59,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-04-10 16:24:59,039 INFO L87 Difference]: Start difference. First operand 215 states and 253 transitions. Second operand 9 states. [2018-04-10 16:24:59,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:24:59,344 INFO L93 Difference]: Finished difference Result 245 states and 272 transitions. [2018-04-10 16:24:59,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 16:24:59,345 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-04-10 16:24:59,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:24:59,345 INFO L225 Difference]: With dead ends: 245 [2018-04-10 16:24:59,345 INFO L226 Difference]: Without dead ends: 245 [2018-04-10 16:24:59,345 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2018-04-10 16:24:59,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-04-10 16:24:59,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 210. [2018-04-10 16:24:59,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-04-10 16:24:59,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 246 transitions. [2018-04-10 16:24:59,348 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 246 transitions. Word has length 31 [2018-04-10 16:24:59,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:24:59,348 INFO L459 AbstractCegarLoop]: Abstraction has 210 states and 246 transitions. [2018-04-10 16:24:59,348 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 16:24:59,348 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 246 transitions. [2018-04-10 16:24:59,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-10 16:24:59,349 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:24:59,349 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:24:59,349 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-10 16:24:59,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1952774965, now seen corresponding path program 1 times [2018-04-10 16:24:59,349 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:24:59,349 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:24:59,350 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:24:59,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:24:59,350 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:24:59,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:24:59,355 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:24:59,373 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-10 16:24:59,373 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:24:59,374 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:24:59,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:24:59,374 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:24:59,374 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:24:59,374 INFO L87 Difference]: Start difference. First operand 210 states and 246 transitions. Second operand 5 states. [2018-04-10 16:24:59,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:24:59,577 INFO L93 Difference]: Finished difference Result 312 states and 362 transitions. [2018-04-10 16:24:59,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 16:24:59,577 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-04-10 16:24:59,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:24:59,579 INFO L225 Difference]: With dead ends: 312 [2018-04-10 16:24:59,579 INFO L226 Difference]: Without dead ends: 312 [2018-04-10 16:24:59,579 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-10 16:24:59,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-04-10 16:24:59,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 209. [2018-04-10 16:24:59,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-04-10 16:24:59,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 245 transitions. [2018-04-10 16:24:59,584 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 245 transitions. Word has length 33 [2018-04-10 16:24:59,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:24:59,584 INFO L459 AbstractCegarLoop]: Abstraction has 209 states and 245 transitions. [2018-04-10 16:24:59,584 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:24:59,584 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 245 transitions. [2018-04-10 16:24:59,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-10 16:24:59,585 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:24:59,585 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:24:59,585 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-10 16:24:59,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1952774964, now seen corresponding path program 1 times [2018-04-10 16:24:59,585 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:24:59,585 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:24:59,586 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:24:59,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:24:59,587 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:24:59,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:24:59,596 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:24:59,646 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-10 16:24:59,646 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:24:59,646 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:24:59,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:24:59,647 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:24:59,647 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:24:59,647 INFO L87 Difference]: Start difference. First operand 209 states and 245 transitions. Second operand 5 states. [2018-04-10 16:24:59,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:24:59,837 INFO L93 Difference]: Finished difference Result 320 states and 371 transitions. [2018-04-10 16:24:59,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 16:24:59,837 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-04-10 16:24:59,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:24:59,838 INFO L225 Difference]: With dead ends: 320 [2018-04-10 16:24:59,838 INFO L226 Difference]: Without dead ends: 320 [2018-04-10 16:24:59,838 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-10 16:24:59,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-04-10 16:24:59,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 208. [2018-04-10 16:24:59,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-04-10 16:24:59,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 244 transitions. [2018-04-10 16:24:59,842 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 244 transitions. Word has length 33 [2018-04-10 16:24:59,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:24:59,843 INFO L459 AbstractCegarLoop]: Abstraction has 208 states and 244 transitions. [2018-04-10 16:24:59,843 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:24:59,843 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 244 transitions. [2018-04-10 16:24:59,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-10 16:24:59,843 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:24:59,843 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:24:59,844 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-10 16:24:59,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1611197246, now seen corresponding path program 1 times [2018-04-10 16:24:59,844 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:24:59,844 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:24:59,845 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:24:59,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:24:59,845 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:24:59,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:24:59,856 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:24:59,860 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:24:59,861 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:24:59,861 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:24:59,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:24:59,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:24:59,893 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:24:59,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:24:59,896 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:24:59,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:24:59,900 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:24:59,911 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:24:59,912 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:24:59,914 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-10 16:24:59,915 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:24:59,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:24:59,922 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-04-10 16:24:59,934 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-10 16:24:59,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-10 16:24:59,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:24:59,938 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:24:59,945 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-10 16:24:59,945 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-04-10 16:24:59,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-04-10 16:24:59,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-10 16:24:59,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:24:59,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:24:59,996 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-10 16:24:59,996 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:43 [2018-04-10 16:25:00,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2018-04-10 16:25:00,072 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-10 16:25:00,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:00,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10 16:25:00,079 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:00,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:00,087 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-10 16:25:00,087 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:15 [2018-04-10 16:25:00,106 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-10 16:25:00,107 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:25:00,107 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-10 16:25:00,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 16:25:00,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 16:25:00,107 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-04-10 16:25:00,108 INFO L87 Difference]: Start difference. First operand 208 states and 244 transitions. Second operand 10 states. [2018-04-10 16:25:00,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:25:00,911 INFO L93 Difference]: Finished difference Result 399 states and 459 transitions. [2018-04-10 16:25:00,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-10 16:25:00,911 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-04-10 16:25:00,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:25:00,912 INFO L225 Difference]: With dead ends: 399 [2018-04-10 16:25:00,912 INFO L226 Difference]: Without dead ends: 399 [2018-04-10 16:25:00,913 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=348, Unknown=0, NotChecked=0, Total=506 [2018-04-10 16:25:00,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-04-10 16:25:00,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 221. [2018-04-10 16:25:00,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-04-10 16:25:00,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 260 transitions. [2018-04-10 16:25:00,918 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 260 transitions. Word has length 34 [2018-04-10 16:25:00,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:25:00,918 INFO L459 AbstractCegarLoop]: Abstraction has 221 states and 260 transitions. [2018-04-10 16:25:00,918 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 16:25:00,918 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 260 transitions. [2018-04-10 16:25:00,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-10 16:25:00,919 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:25:00,919 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:25:00,919 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-10 16:25:00,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1611197245, now seen corresponding path program 1 times [2018-04-10 16:25:00,919 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:25:00,919 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:25:00,920 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:00,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:25:00,920 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:00,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:25:00,928 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:25:00,932 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:25:00,933 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:25:00,933 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:25:00,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:25:00,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:25:00,958 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:25:00,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 6 treesize of output 5 [2018-04-10 16:25:00,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:00,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:00,972 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-10 16:25:00,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 13 treesize of output 10 [2018-04-10 16:25:00,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 16:25:00,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:00,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:00,998 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-10 16:25:00,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 10 treesize of output 9 [2018-04-10 16:25:01,000 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:01,001 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:01,006 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-10 16:25:01,006 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:35, output treesize:24 [2018-04-10 16:25:01,053 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 23 treesize of output 35 [2018-04-10 16:25:01,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-04-10 16:25:01,056 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:01,081 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:01,142 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 30 treesize of output 40 [2018-04-10 16:25:01,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2018-04-10 16:25:01,146 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:01,169 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:01,175 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-10 16:25:01,176 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:55, output treesize:47 [2018-04-10 16:25:01,238 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 24 treesize of output 26 [2018-04-10 16:25:01,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 15 [2018-04-10 16:25:01,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:01,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 10 [2018-04-10 16:25:01,256 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:01,268 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:01,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-10 16:25:01,270 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:01,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:01,283 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 29 treesize of output 29 [2018-04-10 16:25:01,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, 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 20 [2018-04-10 16:25:01,288 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:01,299 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:01,299 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 11 [2018-04-10 16:25:01,299 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:01,308 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:01,311 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-10 16:25:01,311 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:52, output treesize:9 [2018-04-10 16:25:01,321 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-10 16:25:01,321 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:25:01,321 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-10 16:25:01,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 16:25:01,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 16:25:01,322 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=65, Unknown=2, NotChecked=0, Total=90 [2018-04-10 16:25:01,322 INFO L87 Difference]: Start difference. First operand 221 states and 260 transitions. Second operand 10 states. [2018-04-10 16:25:02,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:25:02,000 INFO L93 Difference]: Finished difference Result 383 states and 440 transitions. [2018-04-10 16:25:02,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 16:25:02,001 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-04-10 16:25:02,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:25:02,001 INFO L225 Difference]: With dead ends: 383 [2018-04-10 16:25:02,002 INFO L226 Difference]: Without dead ends: 383 [2018-04-10 16:25:02,002 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=204, Unknown=2, NotChecked=0, Total=306 [2018-04-10 16:25:02,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-04-10 16:25:02,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 222. [2018-04-10 16:25:02,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-04-10 16:25:02,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 260 transitions. [2018-04-10 16:25:02,006 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 260 transitions. Word has length 34 [2018-04-10 16:25:02,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:25:02,007 INFO L459 AbstractCegarLoop]: Abstraction has 222 states and 260 transitions. [2018-04-10 16:25:02,007 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 16:25:02,007 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 260 transitions. [2018-04-10 16:25:02,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-10 16:25:02,007 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:25:02,007 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:25:02,007 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-10 16:25:02,008 INFO L82 PathProgramCache]: Analyzing trace with hash 152582500, now seen corresponding path program 1 times [2018-04-10 16:25:02,008 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:25:02,008 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:25:02,009 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:02,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:25:02,009 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:02,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:25:02,015 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:25:02,138 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-10 16:25:02,138 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:25:02,138 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 16:25:02,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:25:02,139 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:25:02,139 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:25:02,139 INFO L87 Difference]: Start difference. First operand 222 states and 260 transitions. Second operand 5 states. [2018-04-10 16:25:02,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:25:02,164 INFO L93 Difference]: Finished difference Result 266 states and 306 transitions. [2018-04-10 16:25:02,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 16:25:02,175 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-04-10 16:25:02,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:25:02,176 INFO L225 Difference]: With dead ends: 266 [2018-04-10 16:25:02,176 INFO L226 Difference]: Without dead ends: 266 [2018-04-10 16:25:02,176 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-10 16:25:02,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-04-10 16:25:02,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 230. [2018-04-10 16:25:02,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-04-10 16:25:02,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 268 transitions. [2018-04-10 16:25:02,179 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 268 transitions. Word has length 37 [2018-04-10 16:25:02,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:25:02,179 INFO L459 AbstractCegarLoop]: Abstraction has 230 states and 268 transitions. [2018-04-10 16:25:02,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:25:02,179 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 268 transitions. [2018-04-10 16:25:02,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-10 16:25:02,180 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:25:02,180 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:25:02,180 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-10 16:25:02,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1914757033, now seen corresponding path program 1 times [2018-04-10 16:25:02,180 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:25:02,180 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:25:02,181 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:02,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:25:02,181 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:02,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:25:02,187 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:25:02,188 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:25:02,188 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:25:02,188 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:25:02,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:25:02,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:25:02,202 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:25:02,214 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-10 16:25:02,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:25:02,219 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:02,223 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:02,230 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-10 16:25:02,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:25:02,232 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:02,233 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:02,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:02,237 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-04-10 16:25:02,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-10 16:25:02,249 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:02,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 16:25:02,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:02,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:02,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-10 16:25:02,265 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:02,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 16:25:02,266 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:02,269 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:02,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:02,276 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-04-10 16:25:02,290 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 30 treesize of output 23 [2018-04-10 16:25:02,292 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:02,293 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:02,294 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:02,296 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 23 treesize of output 46 [2018-04-10 16:25:02,296 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:02,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:02,316 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 30 treesize of output 23 [2018-04-10 16:25:02,318 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:02,318 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:02,319 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:02,319 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:25:02,320 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 23 treesize of output 55 [2018-04-10 16:25:02,320 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:02,327 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:02,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:02,335 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:65, output treesize:57 [2018-04-10 16:25:02,506 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 42 treesize of output 32 [2018-04-10 16:25:02,510 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:02,511 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:02,512 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:02,512 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:25:02,513 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:02,513 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:25:02,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 40 [2018-04-10 16:25:02,521 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:02,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:02,541 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-10 16:25:02,543 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:02,544 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:02,545 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:25:02,545 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:02,546 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:25:02,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2018-04-10 16:25:02,547 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:02,554 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:02,560 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-10 16:25:02,561 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:86, output treesize:7 [2018-04-10 16:25:02,593 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:25:02,593 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:25:02,594 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-10 16:25:02,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-10 16:25:02,594 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-10 16:25:02,594 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-04-10 16:25:02,594 INFO L87 Difference]: Start difference. First operand 230 states and 268 transitions. Second operand 13 states. [2018-04-10 16:25:03,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:25:03,237 INFO L93 Difference]: Finished difference Result 268 states and 299 transitions. [2018-04-10 16:25:03,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-10 16:25:03,237 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2018-04-10 16:25:03,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:25:03,238 INFO L225 Difference]: With dead ends: 268 [2018-04-10 16:25:03,238 INFO L226 Difference]: Without dead ends: 268 [2018-04-10 16:25:03,238 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2018-04-10 16:25:03,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-04-10 16:25:03,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 242. [2018-04-10 16:25:03,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-04-10 16:25:03,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 280 transitions. [2018-04-10 16:25:03,241 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 280 transitions. Word has length 39 [2018-04-10 16:25:03,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:25:03,241 INFO L459 AbstractCegarLoop]: Abstraction has 242 states and 280 transitions. [2018-04-10 16:25:03,241 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-10 16:25:03,241 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 280 transitions. [2018-04-10 16:25:03,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-10 16:25:03,241 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:25:03,242 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:25:03,242 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-10 16:25:03,242 INFO L82 PathProgramCache]: Analyzing trace with hash -809378431, now seen corresponding path program 1 times [2018-04-10 16:25:03,242 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:25:03,242 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:25:03,243 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:03,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:25:03,243 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:03,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:25:03,252 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:25:03,254 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:25:03,254 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:25:03,254 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:25:03,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:25:03,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:25:03,273 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:25:03,296 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-10 16:25:03,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:25:03,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:03,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:03,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:03,304 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-04-10 16:25:03,322 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-10 16:25:03,323 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:25:03,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 13 treesize of output 9 [2018-04-10 16:25:03,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:03,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:03,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:03,329 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:7 [2018-04-10 16:25:03,347 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-10 16:25:03,347 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:25:03,347 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-10 16:25:03,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 16:25:03,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 16:25:03,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-04-10 16:25:03,348 INFO L87 Difference]: Start difference. First operand 242 states and 280 transitions. Second operand 8 states. [2018-04-10 16:25:03,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:25:03,587 INFO L93 Difference]: Finished difference Result 369 states and 419 transitions. [2018-04-10 16:25:03,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 16:25:03,588 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-04-10 16:25:03,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:25:03,588 INFO L225 Difference]: With dead ends: 369 [2018-04-10 16:25:03,589 INFO L226 Difference]: Without dead ends: 369 [2018-04-10 16:25:03,589 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-04-10 16:25:03,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-04-10 16:25:03,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 280. [2018-04-10 16:25:03,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-04-10 16:25:03,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 323 transitions. [2018-04-10 16:25:03,592 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 323 transitions. Word has length 42 [2018-04-10 16:25:03,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:25:03,592 INFO L459 AbstractCegarLoop]: Abstraction has 280 states and 323 transitions. [2018-04-10 16:25:03,592 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 16:25:03,592 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 323 transitions. [2018-04-10 16:25:03,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-10 16:25:03,592 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:25:03,593 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] [2018-04-10 16:25:03,593 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-10 16:25:03,593 INFO L82 PathProgramCache]: Analyzing trace with hash -185310155, now seen corresponding path program 1 times [2018-04-10 16:25:03,593 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:25:03,593 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:25:03,594 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:03,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:25:03,594 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:03,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:25:03,605 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:25:03,608 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:25:03,608 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:25:03,608 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:25:03,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:25:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:25:03,650 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:25:03,659 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:03,660 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:03,661 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:03,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-04-10 16:25:03,663 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:03,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:03,670 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-10 16:25:03,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:25:03,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:25:03,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:03,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:03,689 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-10 16:25:03,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-04-10 16:25:03,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-04-10 16:25:03,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 14 treesize of output 13 [2018-04-10 16:25:03,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:03,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:03,731 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-10 16:25:03,731 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-04-10 16:25:03,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2018-04-10 16:25:03,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-10 16:25:03,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:03,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10 16:25:03,758 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:03,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:03,763 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-10 16:25:03,763 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:43, output treesize:15 [2018-04-10 16:25:03,779 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:25:03,779 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:25:03,779 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-10 16:25:03,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 16:25:03,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 16:25:03,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-04-10 16:25:03,780 INFO L87 Difference]: Start difference. First operand 280 states and 323 transitions. Second operand 9 states. [2018-04-10 16:25:20,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:25:20,121 INFO L93 Difference]: Finished difference Result 279 states and 321 transitions. [2018-04-10 16:25:20,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-10 16:25:20,121 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2018-04-10 16:25:20,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:25:20,122 INFO L225 Difference]: With dead ends: 279 [2018-04-10 16:25:20,122 INFO L226 Difference]: Without dead ends: 279 [2018-04-10 16:25:20,122 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-04-10 16:25:20,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-04-10 16:25:20,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 263. [2018-04-10 16:25:20,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-04-10 16:25:20,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 305 transitions. [2018-04-10 16:25:20,126 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 305 transitions. Word has length 42 [2018-04-10 16:25:20,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:25:20,126 INFO L459 AbstractCegarLoop]: Abstraction has 263 states and 305 transitions. [2018-04-10 16:25:20,126 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 16:25:20,126 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 305 transitions. [2018-04-10 16:25:20,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-10 16:25:20,127 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:25:20,127 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:25:20,127 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-10 16:25:20,127 INFO L82 PathProgramCache]: Analyzing trace with hash -49888674, now seen corresponding path program 1 times [2018-04-10 16:25:20,127 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:25:20,127 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:25:20,128 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:20,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:25:20,128 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:20,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:25:20,136 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:25:20,138 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:25:20,138 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:25:20,138 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:25:20,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:25:20,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:25:20,156 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:25:20,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:25:20,164 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:20,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:20,168 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:25:20,182 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:20,183 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:20,183 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 11 treesize of output 12 [2018-04-10 16:25:20,184 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:20,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:20,188 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-10 16:25:20,197 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-10 16:25:20,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, 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-10 16:25:20,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:20,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:20,212 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-10 16:25:20,213 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2018-04-10 16:25:20,246 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 34 treesize of output 28 [2018-04-10 16:25:20,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:25:20,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:20,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:20,252 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-10 16:25:20,253 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:27 [2018-04-10 16:25:20,296 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 29 treesize of output 24 [2018-04-10 16:25:20,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10 16:25:20,299 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:20,303 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:25:20,304 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 14 treesize of output 10 [2018-04-10 16:25:20,304 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:20,306 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:20,308 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-10 16:25:20,309 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:32, output treesize:8 [2018-04-10 16:25:20,339 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-10 16:25:20,339 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:25:20,339 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-04-10 16:25:20,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-10 16:25:20,339 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-10 16:25:20,340 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-04-10 16:25:20,340 INFO L87 Difference]: Start difference. First operand 263 states and 305 transitions. Second operand 12 states. [2018-04-10 16:25:21,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:25:21,063 INFO L93 Difference]: Finished difference Result 430 states and 489 transitions. [2018-04-10 16:25:21,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-10 16:25:21,063 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 44 [2018-04-10 16:25:21,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:25:21,064 INFO L225 Difference]: With dead ends: 430 [2018-04-10 16:25:21,064 INFO L226 Difference]: Without dead ends: 430 [2018-04-10 16:25:21,065 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=258, Invalid=734, Unknown=0, NotChecked=0, Total=992 [2018-04-10 16:25:21,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2018-04-10 16:25:21,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 263. [2018-04-10 16:25:21,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-04-10 16:25:21,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 304 transitions. [2018-04-10 16:25:21,069 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 304 transitions. Word has length 44 [2018-04-10 16:25:21,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:25:21,069 INFO L459 AbstractCegarLoop]: Abstraction has 263 states and 304 transitions. [2018-04-10 16:25:21,069 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-10 16:25:21,069 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 304 transitions. [2018-04-10 16:25:21,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-10 16:25:21,070 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:25:21,070 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:25:21,070 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-10 16:25:21,070 INFO L82 PathProgramCache]: Analyzing trace with hash -864090993, now seen corresponding path program 1 times [2018-04-10 16:25:21,070 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:25:21,070 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:25:21,071 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:21,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:25:21,071 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:21,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:25:21,079 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:25:21,081 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:25:21,081 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:25:21,081 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:25:21,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:25:21,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:25:21,100 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:25:21,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-10 16:25:21,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-10 16:25:21,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:21,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:21,137 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-10 16:25:21,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:25:21,139 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:21,141 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:21,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:21,145 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-04-10 16:25:21,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-10 16:25:21,155 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:21,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 16:25:21,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:21,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:21,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-10 16:25:21,171 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:21,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 16:25:21,172 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:21,175 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:21,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:21,181 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-04-10 16:25:21,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-04-10 16:25:21,216 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:21,217 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:21,218 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:21,221 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 23 treesize of output 46 [2018-04-10 16:25:21,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:21,238 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:21,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-04-10 16:25:21,259 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:21,260 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:21,260 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:21,263 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 23 treesize of output 46 [2018-04-10 16:25:21,264 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:21,271 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:21,283 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-10 16:25:21,283 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:65, output treesize:39 [2018-04-10 16:25:21,301 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 28 treesize of output 38 [2018-04-10 16:25:21,305 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:21,308 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 24 treesize of output 33 [2018-04-10 16:25:21,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:21,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-04-10 16:25:21,327 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:21,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:21,365 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 28 treesize of output 38 [2018-04-10 16:25:21,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-04-10 16:25:21,368 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:21,394 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:21,407 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-10 16:25:21,408 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:61, output treesize:53 [2018-04-10 16:25:21,437 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 24 treesize of output 18 [2018-04-10 16:25:21,439 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:21,440 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:25:21,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-04-10 16:25:21,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:21,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:21,456 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 24 treesize of output 18 [2018-04-10 16:25:21,458 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:21,458 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:25:21,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-04-10 16:25:21,459 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:21,461 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:21,466 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-10 16:25:21,466 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:59, output treesize:7 [2018-04-10 16:25:21,489 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:25:21,489 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:25:21,489 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-10 16:25:21,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 16:25:21,490 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 16:25:21,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-04-10 16:25:21,490 INFO L87 Difference]: Start difference. First operand 263 states and 304 transitions. Second operand 9 states. [2018-04-10 16:25:21,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:25:21,788 INFO L93 Difference]: Finished difference Result 294 states and 337 transitions. [2018-04-10 16:25:21,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 16:25:21,788 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2018-04-10 16:25:21,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:25:21,789 INFO L225 Difference]: With dead ends: 294 [2018-04-10 16:25:21,789 INFO L226 Difference]: Without dead ends: 294 [2018-04-10 16:25:21,789 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2018-04-10 16:25:21,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-04-10 16:25:21,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 266. [2018-04-10 16:25:21,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-04-10 16:25:21,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 308 transitions. [2018-04-10 16:25:21,791 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 308 transitions. Word has length 45 [2018-04-10 16:25:21,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:25:21,791 INFO L459 AbstractCegarLoop]: Abstraction has 266 states and 308 transitions. [2018-04-10 16:25:21,792 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 16:25:21,792 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 308 transitions. [2018-04-10 16:25:21,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-10 16:25:21,792 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:25:21,792 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:25:21,792 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-10 16:25:21,792 INFO L82 PathProgramCache]: Analyzing trace with hash 820020174, now seen corresponding path program 1 times [2018-04-10 16:25:21,792 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:25:21,792 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:25:21,793 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:21,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:25:21,793 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:21,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:25:21,797 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:25:21,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-10 16:25:21,854 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:25:21,854 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 16:25:21,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 16:25:21,854 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 16:25:21,854 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-10 16:25:21,854 INFO L87 Difference]: Start difference. First operand 266 states and 308 transitions. Second operand 8 states. [2018-04-10 16:25:22,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:25:22,018 INFO L93 Difference]: Finished difference Result 395 states and 450 transitions. [2018-04-10 16:25:22,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 16:25:22,019 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-04-10 16:25:22,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:25:22,020 INFO L225 Difference]: With dead ends: 395 [2018-04-10 16:25:22,020 INFO L226 Difference]: Without dead ends: 395 [2018-04-10 16:25:22,020 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-04-10 16:25:22,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-04-10 16:25:22,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 351. [2018-04-10 16:25:22,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-04-10 16:25:22,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 414 transitions. [2018-04-10 16:25:22,024 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 414 transitions. Word has length 46 [2018-04-10 16:25:22,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:25:22,024 INFO L459 AbstractCegarLoop]: Abstraction has 351 states and 414 transitions. [2018-04-10 16:25:22,024 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 16:25:22,024 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 414 transitions. [2018-04-10 16:25:22,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-10 16:25:22,024 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:25:22,025 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:25:22,025 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-10 16:25:22,025 INFO L82 PathProgramCache]: Analyzing trace with hash -349178131, now seen corresponding path program 1 times [2018-04-10 16:25:22,025 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:25:22,025 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:25:22,025 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:22,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:25:22,026 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:22,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:25:22,030 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:25:22,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:25:22,200 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:25:22,200 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:25:22,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:25:22,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:25:22,217 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:25:22,334 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 16 treesize of output 12 [2018-04-10 16:25:22,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-04-10 16:25:22,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:22,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:22,337 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-10 16:25:22,338 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-04-10 16:25:22,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:25:22,348 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:25:22,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2018-04-10 16:25:22,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-10 16:25:22,349 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-10 16:25:22,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-04-10 16:25:22,349 INFO L87 Difference]: Start difference. First operand 351 states and 414 transitions. Second operand 13 states. [2018-04-10 16:25:22,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:25:22,678 INFO L93 Difference]: Finished difference Result 439 states and 500 transitions. [2018-04-10 16:25:22,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-10 16:25:22,679 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2018-04-10 16:25:22,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:25:22,680 INFO L225 Difference]: With dead ends: 439 [2018-04-10 16:25:22,680 INFO L226 Difference]: Without dead ends: 439 [2018-04-10 16:25:22,680 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 41 SyntacticMatches, 8 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=398, Unknown=0, NotChecked=0, Total=552 [2018-04-10 16:25:22,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-04-10 16:25:22,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 287. [2018-04-10 16:25:22,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-04-10 16:25:22,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 326 transitions. [2018-04-10 16:25:22,684 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 326 transitions. Word has length 47 [2018-04-10 16:25:22,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:25:22,685 INFO L459 AbstractCegarLoop]: Abstraction has 287 states and 326 transitions. [2018-04-10 16:25:22,685 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-10 16:25:22,685 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 326 transitions. [2018-04-10 16:25:22,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-10 16:25:22,685 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:25:22,685 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:25:22,686 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-10 16:25:22,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1238139767, now seen corresponding path program 1 times [2018-04-10 16:25:22,686 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:25:22,686 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:25:22,687 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:22,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:25:22,687 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:22,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:25:22,701 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:25:22,704 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:25:22,704 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:25:22,704 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:25:22,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:25:22,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:25:22,756 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:25:22,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:25:22,771 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:22,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:25:22,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:22,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:22,800 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-10 16:25:22,810 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:22,810 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-10 16:25:22,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:22,817 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:22,817 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:22,818 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-10 16:25:22,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:22,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:22,823 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:28 [2018-04-10 16:25:22,834 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-10 16:25:22,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-10 16:25:22,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:22,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:22,842 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-10 16:25:22,842 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:46 [2018-04-10 16:25:22,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2018-04-10 16:25:22,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:25:22,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:22,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:22,874 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-10 16:25:22,874 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:59 [2018-04-10 16:25:22,922 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:22,923 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:22,923 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 23 treesize of output 46 [2018-04-10 16:25:22,923 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:22,941 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:22,942 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:22,942 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:22,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 52 [2018-04-10 16:25:22,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:22,957 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-10 16:25:22,958 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:82, output treesize:89 [2018-04-10 16:25:22,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 68 [2018-04-10 16:25:22,996 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:22,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 79 [2018-04-10 16:25:22,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:23,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:23,024 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-10 16:25:23,024 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:100, output treesize:105 [2018-04-10 16:25:23,086 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 107 treesize of output 106 [2018-04-10 16:25:23,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:25:23,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:23,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:23,116 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-10 16:25:23,116 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:123, output treesize:115 [2018-04-10 16:25:23,191 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 110 treesize of output 140 [2018-04-10 16:25:23,191 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-10 16:25:23,222 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 120 treesize of output 121 [2018-04-10 16:25:23,222 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:24,463 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-10 16:25:24,683 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-10 16:25:24,896 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 104 treesize of output 111 [2018-04-10 16:25:24,896 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-10 16:25:25,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 90 treesize of output 91 [2018-04-10 16:25:25,108 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-04-10 16:25:25,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 106 [2018-04-10 16:25:25,332 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:25,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, 12 dim-1 vars, End of recursive call: 5 dim-0 vars, and 7 xjuncts. [2018-04-10 16:25:25,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 24 dim-0 vars, and 7 xjuncts. [2018-04-10 16:25:25,871 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:129, output treesize:865 [2018-04-10 16:25:26,181 WARN L151 SmtUtils]: Spent 250ms on a formula simplification. DAG size of input: 240 DAG size of output 136 [2018-04-10 16:25:26,195 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-10 16:25:26,195 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:26,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 104 [2018-04-10 16:25:26,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:26,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 145 treesize of output 166 [2018-04-10 16:25:26,347 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-10 16:25:26,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 110 [2018-04-10 16:25:26,435 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:26,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 97 [2018-04-10 16:25:26,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 16:25:26,529 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:26,543 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:26,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 135 treesize of output 132 [2018-04-10 16:25:26,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 10 treesize of output 9 [2018-04-10 16:25:26,547 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:26,566 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:26,568 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 106 treesize of output 107 [2018-04-10 16:25:26,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-10 16:25:26,570 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:26,584 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:26,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 113 [2018-04-10 16:25:26,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-10 16:25:26,588 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:26,603 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:26,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-1 vars, 1 dim-2 vars, End of recursive call: 11 dim-0 vars, and 4 xjuncts. [2018-04-10 16:25:26,684 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 17 variables, input treesize:529, output treesize:446 [2018-04-10 16:25:26,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 145 [2018-04-10 16:25:26,822 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:26,823 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 16 treesize of output 23 [2018-04-10 16:25:26,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:26,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:27,027 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 125 treesize of output 157 [2018-04-10 16:25:27,027 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-10 16:25:27,040 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:27,047 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 3 case distinctions, treesize of input 135 treesize of output 152 [2018-04-10 16:25:27,047 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-10 16:25:27,487 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:27,488 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 120 treesize of output 127 [2018-04-10 16:25:27,489 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:27,715 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:27,716 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:27,716 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:27,716 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:25:27,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 125 [2018-04-10 16:25:27,720 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-10 16:25:27,943 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:27,949 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 2 case distinctions, treesize of input 109 treesize of output 124 [2018-04-10 16:25:27,949 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-10 16:25:28,821 INFO L267 ElimStorePlain]: Start of recursive call 4: 5 dim-0 vars, 8 dim-1 vars, End of recursive call: 4 dim-0 vars, and 7 xjuncts. [2018-04-10 16:25:29,175 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:29,176 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 132 treesize of output 140 [2018-04-10 16:25:29,178 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:29,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 47 [2018-04-10 16:25:29,179 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:29,195 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:29,518 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:29,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 104 [2018-04-10 16:25:29,522 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:29,522 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:29,522 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:25:29,525 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2018-04-10 16:25:29,525 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-10 16:25:29,542 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:25:29,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 17 dim-0 vars, 4 dim-2 vars, End of recursive call: 42 dim-0 vars, and 10 xjuncts. [2018-04-10 16:25:29,797 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 21 variables, input treesize:508, output treesize:1173 [2018-04-10 16:25:30,231 WARN L151 SmtUtils]: Spent 333ms on a formula simplification. DAG size of input: 358 DAG size of output 160 [2018-04-10 16:25:30,410 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:30,412 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 127 treesize of output 127 [2018-04-10 16:25:30,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 7 treesize of output 3 [2018-04-10 16:25:30,415 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:30,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10 16:25:30,434 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:30,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:30,525 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 84 treesize of output 80 [2018-04-10 16:25:30,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-10 16:25:30,527 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:30,538 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:30,608 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 149 treesize of output 145 [2018-04-10 16:25:30,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 7 treesize of output 3 [2018-04-10 16:25:30,610 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:30,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10 16:25:30,629 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:30,644 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:30,712 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:30,713 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 130 treesize of output 130 [2018-04-10 16:25:30,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10 16:25:30,715 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:30,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 7 treesize of output 3 [2018-04-10 16:25:30,731 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:30,744 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:30,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 17 dim-0 vars, 4 dim-2 vars, End of recursive call: 17 dim-0 vars, and 4 xjuncts. [2018-04-10 16:25:30,804 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 21 variables, input treesize:491, output treesize:418 [2018-04-10 16:25:30,971 WARN L148 SmtUtils]: Spent 119ms on a formula simplification that was a NOOP. DAG size: 144 [2018-04-10 16:25:31,170 WARN L148 SmtUtils]: Spent 130ms on a formula simplification that was a NOOP. DAG size: 144 [2018-04-10 16:25:31,386 WARN L148 SmtUtils]: Spent 147ms on a formula simplification that was a NOOP. DAG size: 114 [2018-04-10 16:25:31,400 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:31,411 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 5 new quantified variables, introduced 2 case distinctions, treesize of input 108 treesize of output 103 [2018-04-10 16:25:31,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 87 [2018-04-10 16:25:31,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:31,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 81 [2018-04-10 16:25:31,493 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:31,560 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 81 treesize of output 68 [2018-04-10 16:25:31,561 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-10 16:25:31,630 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:31,631 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:31,631 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:31,635 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 1 case distinctions, treesize of input 64 treesize of output 69 [2018-04-10 16:25:31,635 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-10 16:25:31,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 80 [2018-04-10 16:25:31,725 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:31,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, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 65 [2018-04-10 16:25:31,810 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-10 16:25:31,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 81 [2018-04-10 16:25:31,890 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:31,996 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:31,997 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 61 treesize of output 55 [2018-04-10 16:25:31,997 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:32,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 66 [2018-04-10 16:25:32,073 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-10 16:25:32,144 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 82 treesize of output 69 [2018-04-10 16:25:32,145 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-10 16:25:32,215 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:32,217 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:32,218 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:32,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 85 [2018-04-10 16:25:32,231 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts. [2018-04-10 16:25:32,337 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:32,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 61 [2018-04-10 16:25:32,340 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-04-10 16:25:32,459 INFO L267 ElimStorePlain]: Start of recursive call 2: 12 dim-1 vars, End of recursive call: 8 dim-0 vars, and 8 xjuncts. [2018-04-10 16:25:32,640 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:32,641 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:32,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, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 84 [2018-04-10 16:25:32,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 16:25:32,644 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:32,657 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2018-04-10 16:25:32,657 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:32,668 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:32,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-04-10 16:25:32,669 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:25:32,681 INFO L267 ElimStorePlain]: Start of recursive call 15: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:25:32,868 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 125 treesize of output 100 [2018-04-10 16:25:32,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:25:32,870 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:32,885 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:32,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-10 16:25:32,886 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:32,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 35 [2018-04-10 16:25:32,900 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-10 16:25:32,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 16:25:32,911 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:32,920 INFO L267 ElimStorePlain]: Start of recursive call 19: 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:25:33,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 3 dim-2 vars, End of recursive call: 18 dim-0 vars, and 10 xjuncts. [2018-04-10 16:25:33,063 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 19 variables, input treesize:335, output treesize:293 [2018-04-10 16:25:33,176 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:25:33,176 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:25:33,176 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-10 16:25:33,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-10 16:25:33,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-10 16:25:33,177 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=354, Unknown=1, NotChecked=0, Total=420 [2018-04-10 16:25:33,177 INFO L87 Difference]: Start difference. First operand 287 states and 326 transitions. Second operand 21 states. [2018-04-10 16:25:34,717 WARN L151 SmtUtils]: Spent 227ms on a formula simplification. DAG size of input: 151 DAG size of output 151 [2018-04-10 16:25:35,088 WARN L151 SmtUtils]: Spent 191ms on a formula simplification. DAG size of input: 151 DAG size of output 136 [2018-04-10 16:25:35,604 WARN L151 SmtUtils]: Spent 351ms on a formula simplification. DAG size of input: 197 DAG size of output 136 [2018-04-10 16:25:36,023 WARN L151 SmtUtils]: Spent 288ms on a formula simplification. DAG size of input: 179 DAG size of output 179 [2018-04-10 16:25:37,126 WARN L151 SmtUtils]: Spent 970ms on a formula simplification. DAG size of input: 269 DAG size of output 269 [2018-04-10 16:25:38,360 WARN L151 SmtUtils]: Spent 1068ms on a formula simplification. DAG size of input: 282 DAG size of output 272 [2018-04-10 16:25:40,224 WARN L151 SmtUtils]: Spent 1787ms on a formula simplification. DAG size of input: 286 DAG size of output 285 [2018-04-10 16:25:41,212 WARN L151 SmtUtils]: Spent 889ms on a formula simplification. DAG size of input: 279 DAG size of output 253 [2018-04-10 16:25:42,165 WARN L151 SmtUtils]: Spent 800ms on a formula simplification. DAG size of input: 296 DAG size of output 256 [2018-04-10 16:25:42,905 WARN L148 SmtUtils]: Spent 360ms on a formula simplification that was a NOOP. DAG size: 260 [2018-04-10 16:25:43,080 WARN L148 SmtUtils]: Spent 101ms on a formula simplification that was a NOOP. DAG size: 170 [2018-04-10 16:25:43,465 WARN L151 SmtUtils]: Spent 244ms on a formula simplification. DAG size of input: 196 DAG size of output 182 [2018-04-10 16:25:43,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:25:43,596 INFO L93 Difference]: Finished difference Result 563 states and 648 transitions. [2018-04-10 16:25:43,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-10 16:25:43,596 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 50 [2018-04-10 16:25:43,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:25:43,597 INFO L225 Difference]: With dead ends: 563 [2018-04-10 16:25:43,597 INFO L226 Difference]: Without dead ends: 563 [2018-04-10 16:25:43,598 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=376, Invalid=1687, Unknown=7, NotChecked=0, Total=2070 [2018-04-10 16:25:43,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2018-04-10 16:25:43,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 316. [2018-04-10 16:25:43,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-04-10 16:25:43,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 361 transitions. [2018-04-10 16:25:43,603 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 361 transitions. Word has length 50 [2018-04-10 16:25:43,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:25:43,603 INFO L459 AbstractCegarLoop]: Abstraction has 316 states and 361 transitions. [2018-04-10 16:25:43,603 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-10 16:25:43,603 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 361 transitions. [2018-04-10 16:25:43,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-10 16:25:43,604 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:25:43,604 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:25:43,604 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-10 16:25:43,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1238139768, now seen corresponding path program 1 times [2018-04-10 16:25:43,604 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:25:43,604 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:25:43,605 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:43,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:25:43,605 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:43,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:25:43,619 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:25:43,623 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:25:43,623 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:25:43,623 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:25:43,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:25:43,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:25:43,664 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:25:43,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:25:43,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:43,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:25:43,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:43,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:43,685 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-10 16:25:43,699 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:43,700 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:43,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-10 16:25:43,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:43,712 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-10 16:25:43,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:43,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:43,721 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:31 [2018-04-10 16:25:43,737 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-10 16:25:43,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:25:43,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:43,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:43,751 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-10 16:25:43,752 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-10 16:25:43,752 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:43,753 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:43,759 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-10 16:25:43,759 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:54, output treesize:55 [2018-04-10 16:25:43,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-04-10 16:25:43,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:25:43,784 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:43,787 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:43,799 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 69 treesize of output 63 [2018-04-10 16:25:43,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 14 treesize of output 13 [2018-04-10 16:25:43,800 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:43,805 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:43,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:25:43,814 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:101, output treesize:81 [2018-04-10 16:25:43,850 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:43,850 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:43,851 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:43,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 32 [2018-04-10 16:25:43,851 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:43,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-10 16:25:43,866 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:43,879 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-10 16:25:43,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:101, output treesize:93 [2018-04-10 16:25:43,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 42 [2018-04-10 16:25:43,908 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:43,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 16:25:43,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:43,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:43,934 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 69 treesize of output 70 [2018-04-10 16:25:43,936 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:43,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 81 [2018-04-10 16:25:43,937 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:43,945 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:43,959 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-10 16:25:43,959 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:112, output treesize:109 [2018-04-10 16:25:44,017 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 121 treesize of output 120 [2018-04-10 16:25:44,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:25:44,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:44,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:44,053 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 58 treesize of output 83 [2018-04-10 16:25:44,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:25:44,055 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:44,062 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:44,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 16:25:44,078 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:155, output treesize:139 [2018-04-10 16:25:44,153 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 116 treesize of output 146 [2018-04-10 16:25:44,154 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-10 16:25:44,162 WARN L288 Elim1Store]: Array PQE input equivalent to false [2018-04-10 16:25:44,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:44,499 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 110 treesize of output 117 [2018-04-10 16:25:44,499 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-10 16:25:44,693 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-10 16:25:45,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 96 treesize of output 97 [2018-04-10 16:25:45,247 INFO L267 ElimStorePlain]: Start of recursive call 6: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-04-10 16:25:45,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 112 [2018-04-10 16:25:45,919 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:46,221 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-10 16:25:46,529 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-10 16:25:46,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 13 dim-1 vars, End of recursive call: 5 dim-0 vars, and 7 xjuncts. [2018-04-10 16:25:46,827 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:25:46,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 138 [2018-04-10 16:25:46,833 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:46,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 47 [2018-04-10 16:25:46,834 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:46,852 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:46,883 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 4 new quantified variables, introduced 9 case distinctions, treesize of input 146 treesize of output 204 [2018-04-10 16:25:46,883 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-10 16:25:46,898 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 158 treesize of output 165 [2018-04-10 16:25:46,899 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-04-10 16:25: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 143 treesize of output 142 [2018-04-10 16:25:47,341 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:47,562 INFO L267 ElimStorePlain]: Start of recursive call 12: 8 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:25:47,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 183 [2018-04-10 16:25:47,574 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:47,577 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 32 treesize of output 51 [2018-04-10 16:25:47,577 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:47,609 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:47,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 160 [2018-04-10 16:25:47,621 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:47,623 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 32 treesize of output 51 [2018-04-10 16:25:47,623 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:47,647 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:47,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 140 [2018-04-10 16:25:47,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 17 [2018-04-10 16:25:47,658 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:47,680 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:47,683 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:25:47,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 138 [2018-04-10 16:25:47,689 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:47,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 61 [2018-04-10 16:25:47,689 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:47,708 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:47,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 172 [2018-04-10 16:25:47,719 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:47,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 63 [2018-04-10 16:25:47,721 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:47,743 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:47,961 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 7 xjuncts. [2018-04-10 16:25:47,962 INFO L202 ElimStorePlain]: Needed 24 recursive calls to eliminate 5 variables, input treesize:164, output treesize:1171 [2018-04-10 16:25:48,196 WARN L151 SmtUtils]: Spent 173ms on a formula simplification. DAG size of input: 305 DAG size of output 170 [2018-04-10 16:25:48,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 173 [2018-04-10 16:25:48,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:25:48,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:48,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:48,242 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-10 16:25:48,242 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:48,244 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-10 16:25:48,244 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:48,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 169 [2018-04-10 16:25:48,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:25:48,248 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:48,275 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:48,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-04-10 16:25:48,331 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 13 variables, input treesize:677, output treesize:332 [2018-04-10 16:25:48,423 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:48,427 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 215 treesize of output 217 [2018-04-10 16:25:48,429 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:48,430 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:25:48,432 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 87 [2018-04-10 16:25:48,433 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-10 16:25:48,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:25:48,561 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:25:48,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 197 [2018-04-10 16:25:48,568 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:48,568 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:48,569 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:25:48,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 99 [2018-04-10 16:25:48,569 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:48,593 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:48,722 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 198 treesize of output 226 [2018-04-10 16:25:48,722 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-10 16:25:48,735 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:48,737 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:48,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 208 treesize of output 231 [2018-04-10 16:25:48,747 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-10 16:25:50,355 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-10 16:25:51,768 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:51,769 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 193 treesize of output 200 [2018-04-10 16:25:51,769 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:52,805 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:52,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 188 treesize of output 203 [2018-04-10 16:25:52,814 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-04-10 16:25:54,074 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:54,075 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:54,075 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:54,076 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:25:54,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 176 treesize of output 192 [2018-04-10 16:25:54,080 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-10 16:25:54,505 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-10 16:25:54,913 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:25:55,758 INFO L267 ElimStorePlain]: Start of recursive call 6: 13 dim-1 vars, End of recursive call: 4 dim-0 vars, and 7 xjuncts. [2018-04-10 16:25:56,312 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:56,315 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:25:56,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 199 treesize of output 213 [2018-04-10 16:25:56,323 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:56,323 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:56,324 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:25:56,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 93 [2018-04-10 16:25:56,325 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:56,361 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:56,364 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:25:56,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 197 [2018-04-10 16:25:56,371 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:56,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 43 [2018-04-10 16:25:56,372 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:56,402 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:56,404 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:56,407 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:25:56,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 230 [2018-04-10 16:25:56,415 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:56,415 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:56,416 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:25:56,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 93 [2018-04-10 16:25:56,417 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:56,452 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:56,456 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:25:56,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 227 [2018-04-10 16:25:56,463 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:56,464 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:56,464 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:25:56,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 93 [2018-04-10 16:25:56,465 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:56,505 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:56,507 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:56,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 187 [2018-04-10 16:25:56,518 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:56,518 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:25:56,520 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:25:56,520 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 27 treesize of output 59 [2018-04-10 16:25:56,520 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:56,550 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:56,552 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:56,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 243 [2018-04-10 16:25:56,588 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:56,589 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 211 treesize of output 218 [2018-04-10 16:25:56,589 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:56,771 INFO L267 ElimStorePlain]: Start of recursive call 24: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:56,774 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:25:56,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 185 [2018-04-10 16:25:56,787 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:56,788 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:56,788 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:25:56,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 93 [2018-04-10 16:25:56,791 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:56,832 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:57,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: 30 dim-0 vars, and 8 xjuncts. [2018-04-10 16:25:57,175 INFO L202 ElimStorePlain]: Needed 27 recursive calls to eliminate 12 variables, input treesize:414, output treesize:1590 [2018-04-10 16:25:57,483 WARN L151 SmtUtils]: Spent 209ms on a formula simplification. DAG size of input: 385 DAG size of output 215 [2018-04-10 16:25:57,662 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 183 treesize of output 179 [2018-04-10 16:25:57,664 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:25:57,665 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-10 16:25:57,665 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:57,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:57,818 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:57,820 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 199 treesize of output 199 [2018-04-10 16:25:57,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-04-10 16:25:57,821 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:57,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:25:57,851 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:57,875 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:58,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 180 [2018-04-10 16:25:58,009 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:25:58,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 13 treesize of output 9 [2018-04-10 16:25:58,009 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:58,032 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:58,147 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:58,148 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 239 treesize of output 239 [2018-04-10 16:25:58,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 7 treesize of output 3 [2018-04-10 16:25:58,150 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:58,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 1 [2018-04-10 16:25:58,180 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:58,198 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:58,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 4 dim-2 vars, End of recursive call: 16 dim-0 vars, and 4 xjuncts. [2018-04-10 16:25:58,307 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 20 variables, input treesize:806, output treesize:728 [2018-04-10 16:25:58,781 WARN L151 SmtUtils]: Spent 204ms on a formula simplification. DAG size of input: 282 DAG size of output 199 [2018-04-10 16:25:58,900 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:58,918 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 5 new quantified variables, introduced 2 case distinctions, treesize of input 180 treesize of output 171 [2018-04-10 16:25:58,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 137 [2018-04-10 16:25:58,921 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-10 16:25:59,060 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 150 treesize of output 133 [2018-04-10 16:25:59,060 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-10 16:25:59,192 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:59,193 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:59,194 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:59,199 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 1 case distinctions, treesize of input 133 treesize of output 138 [2018-04-10 16:25:59,199 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-10 16:25:59,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 153 [2018-04-10 16:25:59,384 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:59,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 134 [2018-04-10 16:25:59,559 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-10 16:25:59,736 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:59,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 124 [2018-04-10 16:25:59,738 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:59,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 125 treesize of output 120 [2018-04-10 16:25:59,908 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:59,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 123 [2018-04-10 16:25:59,910 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:00,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 113 [2018-04-10 16:26:00,068 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:00,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 149 [2018-04-10 16:26:00,219 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:00,370 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:00,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 148 [2018-04-10 16:26:00,375 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-04-10 16:26:00,565 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:00,566 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:00,568 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:00,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 129 treesize of output 149 [2018-04-10 16:26:00,583 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 4 xjuncts. [2018-04-10 16:26:00,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 116 [2018-04-10 16:26:00,845 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:26:00,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 119 [2018-04-10 16:26:00,847 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-10 16:26:01,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 12 dim-1 vars, End of recursive call: 8 dim-0 vars, and 8 xjuncts. [2018-04-10 16:26:01,391 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:01,392 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:01,393 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 173 [2018-04-10 16:26:01,417 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 121 [2018-04-10 16:26:01,419 INFO L267 ElimStorePlain]: Start of recursive call 18: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-04-10 16:26:01,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, 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-10 16:26:01,614 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:01,680 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:01,689 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 105 treesize of output 142 [2018-04-10 16:26:01,690 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 4 xjuncts. [2018-04-10 16:26:01,692 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:01,693 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 95 treesize of output 89 [2018-04-10 16:26:01,693 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:01,695 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:01,701 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 1 case distinctions, treesize of input 101 treesize of output 125 [2018-04-10 16:26:01,701 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-04-10 16:26:01,812 INFO L267 ElimStorePlain]: Start of recursive call 17: 3 dim-1 vars, End of recursive call: 5 dim-0 vars, and 5 xjuncts. [2018-04-10 16:26:02,246 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 110 treesize of output 90 [2018-04-10 16:26:02,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10 16:26:02,248 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:02,261 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:02,262 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 40 treesize of output 25 [2018-04-10 16:26:02,262 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:02,273 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:02,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-04-10 16:26:02,274 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:02,283 INFO L267 ElimStorePlain]: Start of recursive call 23: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:02,286 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 110 treesize of output 90 [2018-04-10 16:26:02,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10 16:26:02,288 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:02,302 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:02,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 25 [2018-04-10 16:26:02,302 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:02,315 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:02,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-04-10 16:26:02,315 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:02,324 INFO L267 ElimStorePlain]: Start of recursive call 27: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:02,327 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 100 treesize of output 82 [2018-04-10 16:26:02,329 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:02,329 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 32 treesize of output 19 [2018-04-10 16:26:02,329 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:02,342 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:02,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-04-10 16:26:02,343 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:02,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10 16:26:02,353 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:02,364 INFO L267 ElimStorePlain]: Start of recursive call 31: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:02,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, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 82 [2018-04-10 16:26:02,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10 16:26:02,368 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:02,381 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:02,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2018-04-10 16:26:02,381 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:02,391 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:02,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-04-10 16:26:02,391 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:02,399 INFO L267 ElimStorePlain]: Start of recursive call 35: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:02,402 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 100 treesize of output 82 [2018-04-10 16:26:02,404 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:02,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-04-10 16:26:02,404 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:02,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10 16:26:02,417 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:02,428 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:02,429 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 32 treesize of output 19 [2018-04-10 16:26:02,429 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:02,436 INFO L267 ElimStorePlain]: Start of recursive call 39: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:02,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 112 [2018-04-10 16:26:02,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 103 [2018-04-10 16:26:02,757 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:02,816 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:02,817 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:02,822 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 1 case distinctions, treesize of input 104 treesize of output 101 [2018-04-10 16:26:02,822 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 2 xjuncts. [2018-04-10 16:26:02,901 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:02,902 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 85 treesize of output 75 [2018-04-10 16:26:02,902 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:02,904 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:02,904 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 91 treesize of output 81 [2018-04-10 16:26:02,904 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:02,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 77 treesize of output 72 [2018-04-10 16:26:02,973 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:02,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 66 [2018-04-10 16:26:02,975 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:03,038 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:03,038 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 99 treesize of output 89 [2018-04-10 16:26:03,039 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:03,103 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:03,104 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 85 treesize of output 79 [2018-04-10 16:26:03,105 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:03,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 66 [2018-04-10 16:26:03,162 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:03,188 INFO L267 ElimStorePlain]: Start of recursive call 43: 7 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:03,200 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 122 treesize of output 122 [2018-04-10 16:26:03,203 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:03,204 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 110 treesize of output 100 [2018-04-10 16:26:03,204 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:03,341 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:03,341 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:03,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 106 treesize of output 108 [2018-04-10 16:26:03,353 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 2 xjuncts. [2018-04-10 16:26:03,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 109 [2018-04-10 16:26:03,523 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:03,666 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:03,666 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 82 treesize of output 72 [2018-04-10 16:26:03,666 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:03,668 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:03,668 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 94 treesize of output 84 [2018-04-10 16:26:03,669 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:03,801 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:03,801 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 109 treesize of output 99 [2018-04-10 16:26:03,801 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:03,926 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:03,927 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 95 treesize of output 89 [2018-04-10 16:26:03,928 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:04,047 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 110 treesize of output 105 [2018-04-10 16:26:04,047 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:04,162 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:04,164 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 96 treesize of output 85 [2018-04-10 16:26:04,165 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:04,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, 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 72 [2018-04-10 16:26:04,286 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:04,457 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:04,457 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:04,462 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 1 case distinctions, treesize of input 101 treesize of output 98 [2018-04-10 16:26:04,463 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 2 xjuncts. [2018-04-10 16:26:04,544 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:04,544 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 82 treesize of output 72 [2018-04-10 16:26:04,545 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:04,580 INFO L267 ElimStorePlain]: Start of recursive call 53: 12 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:04,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 131 treesize of output 131 [2018-04-10 16:26:04,595 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:04,595 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 119 treesize of output 109 [2018-04-10 16:26:04,596 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:04,729 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:04,730 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:04,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 92 [2018-04-10 16:26:04,732 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:04,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 116 [2018-04-10 16:26:04,847 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:04,960 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 116 treesize of output 111 [2018-04-10 16:26:04,960 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:05,079 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:05,080 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 111 treesize of output 101 [2018-04-10 16:26:05,080 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:05,201 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 86 treesize of output 81 [2018-04-10 16:26:05,201 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:05,376 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:05,377 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 115 treesize of output 105 [2018-04-10 16:26:05,377 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:05,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 108 [2018-04-10 16:26:05,462 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:05,543 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:05,543 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:05,547 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 101 treesize of output 83 [2018-04-10 16:26:05,548 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:05,611 INFO L267 ElimStorePlain]: Start of recursive call 66: 12 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:05,623 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 128 treesize of output 128 [2018-04-10 16:26:05,626 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:05,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 110 [2018-04-10 16:26:05,627 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:05,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 109 [2018-04-10 16:26:05,763 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:05,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 99 [2018-04-10 16:26:05,885 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:06,013 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:06,013 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 109 treesize of output 99 [2018-04-10 16:26:06,014 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:06,141 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:06,142 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 112 treesize of output 102 [2018-04-10 16:26:06,142 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:06,259 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:06,261 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:06,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 90 [2018-04-10 16:26:06,267 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 2 xjuncts. [2018-04-10 16:26:06,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 107 [2018-04-10 16:26:06,378 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:06,476 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:06,476 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:06,479 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 107 treesize of output 94 [2018-04-10 16:26:06,479 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:06,576 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:06,576 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 88 treesize of output 78 [2018-04-10 16:26:06,577 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:06,659 INFO L267 ElimStorePlain]: Start of recursive call 76: 12 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:06,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 107 [2018-04-10 16:26:06,669 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:06,671 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 99 treesize of output 88 [2018-04-10 16:26:06,672 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:06,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 75 [2018-04-10 16:26:06,725 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:06,784 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:06,784 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 75 treesize of output 65 [2018-04-10 16:26:06,785 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:06,860 INFO L267 ElimStorePlain]: Start of recursive call 86: 7 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:06,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 97 [2018-04-10 16:26:06,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10 16:26:06,867 INFO L267 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:06,887 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:06,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-10 16:26:06,888 INFO L267 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:06,906 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:06,906 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 11 [2018-04-10 16:26:06,906 INFO L267 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:06,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10 16:26:06,928 INFO L267 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:06,941 INFO L267 ElimStorePlain]: Start of recursive call 90: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:06,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 104 [2018-04-10 16:26:06,951 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:06,952 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 100 treesize of output 90 [2018-04-10 16:26:06,952 INFO L267 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:07,007 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:07,008 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 86 treesize of output 80 [2018-04-10 16:26:07,008 INFO L267 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:07,065 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:07,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 86 [2018-04-10 16:26:07,066 INFO L267 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:07,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 69 [2018-04-10 16:26:07,114 INFO L267 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:07,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 62 [2018-04-10 16:26:07,160 INFO L267 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:07,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 75 [2018-04-10 16:26:07,207 INFO L267 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:07,250 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:07,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 74 [2018-04-10 16:26:07,254 INFO L267 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 2 xjuncts. [2018-04-10 16:26:07,280 INFO L267 ElimStorePlain]: Start of recursive call 95: 7 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:07,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 115 [2018-04-10 16:26:07,292 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:07,292 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 107 treesize of output 97 [2018-04-10 16:26:07,292 INFO L267 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:07,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 88 [2018-04-10 16:26:07,353 INFO L267 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:07,407 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:07,407 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:07,409 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 88 treesize of output 75 [2018-04-10 16:26:07,409 INFO L267 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:07,492 INFO L267 ElimStorePlain]: Start of recursive call 103: 7 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:07,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 4 dim-2 vars, End of recursive call: 30 dim-0 vars, and 13 xjuncts. [2018-04-10 16:26:07,714 INFO L202 ElimStorePlain]: Needed 106 recursive calls to eliminate 14 variables, input treesize:387, output treesize:508 [2018-04-10 16:26:07,893 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:26:07,893 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:26:07,893 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-10 16:26:07,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-10 16:26:07,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-10 16:26:07,893 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=366, Unknown=2, NotChecked=0, Total=420 [2018-04-10 16:26:07,894 INFO L87 Difference]: Start difference. First operand 316 states and 361 transitions. Second operand 21 states. [2018-04-10 16:26:09,778 WARN L151 SmtUtils]: Spent 203ms on a formula simplification. DAG size of input: 191 DAG size of output 191 [2018-04-10 16:26:10,261 WARN L151 SmtUtils]: Spent 147ms on a formula simplification. DAG size of input: 133 DAG size of output 133 [2018-04-10 16:26:10,672 WARN L151 SmtUtils]: Spent 227ms on a formula simplification. DAG size of input: 235 DAG size of output 234 [2018-04-10 16:26:11,919 WARN L151 SmtUtils]: Spent 976ms on a formula simplification. DAG size of input: 376 DAG size of output 362 [2018-04-10 16:26:13,074 WARN L151 SmtUtils]: Spent 857ms on a formula simplification. DAG size of input: 389 DAG size of output 359 [2018-04-10 16:26:14,793 WARN L151 SmtUtils]: Spent 1565ms on a formula simplification. DAG size of input: 428 DAG size of output 363 [2018-04-10 16:26:15,616 WARN L151 SmtUtils]: Spent 639ms on a formula simplification. DAG size of input: 414 DAG size of output 307 [2018-04-10 16:26:16,590 WARN L151 SmtUtils]: Spent 707ms on a formula simplification. DAG size of input: 433 DAG size of output 312 [2018-04-10 16:26:17,847 WARN L151 SmtUtils]: Spent 658ms on a formula simplification. DAG size of input: 365 DAG size of output 352 [2018-04-10 16:26:18,104 WARN L148 SmtUtils]: Spent 121ms on a formula simplification that was a NOOP. DAG size: 224 [2018-04-10 16:26:18,425 WARN L151 SmtUtils]: Spent 238ms on a formula simplification. DAG size of input: 226 DAG size of output 225 [2018-04-10 16:26:18,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:26:18,780 INFO L93 Difference]: Finished difference Result 564 states and 648 transitions. [2018-04-10 16:26:18,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-10 16:26:18,781 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 50 [2018-04-10 16:26:18,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:26:18,782 INFO L225 Difference]: With dead ends: 564 [2018-04-10 16:26:18,782 INFO L226 Difference]: Without dead ends: 564 [2018-04-10 16:26:18,782 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=346, Invalid=1632, Unknown=2, NotChecked=0, Total=1980 [2018-04-10 16:26:18,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2018-04-10 16:26:18,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 316. [2018-04-10 16:26:18,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-04-10 16:26:18,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 360 transitions. [2018-04-10 16:26:18,787 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 360 transitions. Word has length 50 [2018-04-10 16:26:18,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:26:18,787 INFO L459 AbstractCegarLoop]: Abstraction has 316 states and 360 transitions. [2018-04-10 16:26:18,787 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-10 16:26:18,787 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 360 transitions. [2018-04-10 16:26:18,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-10 16:26:18,788 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:26:18,788 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:26:18,788 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-10 16:26:18,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1627230847, now seen corresponding path program 1 times [2018-04-10 16:26:18,788 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:26:18,788 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:26:18,789 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:26:18,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:26:18,789 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:26:18,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:26:18,803 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:26:18,806 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:26:18,807 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:26:18,807 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:26:18,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:26:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:26:18,864 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:26:18,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:26:18,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:18,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:18,870 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:26:18,894 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:18,895 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-10 16:26:18,895 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:18,907 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:18,907 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:18,908 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-10 16:26:18,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:18,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:18,917 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:28 [2018-04-10 16:26:18,932 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-10 16:26:18,935 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-10 16:26:18,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:18,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:18,946 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-10 16:26:18,946 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:46 [2018-04-10 16:26:18,983 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 56 treesize of output 50 [2018-04-10 16:26:18,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 14 treesize of output 13 [2018-04-10 16:26:18,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:18,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:18,996 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-10 16:26:18,996 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:59 [2018-04-10 16:26:19,040 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:19,041 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:19,042 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:19,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 52 [2018-04-10 16:26:19,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:19,070 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 23 treesize of output 46 [2018-04-10 16:26:19,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:19,093 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-10 16:26:19,093 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:85, output treesize:92 [2018-04-10 16:26:19,128 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 67 treesize of output 68 [2018-04-10 16:26:19,131 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:19,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 79 [2018-04-10 16:26:19,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:19,141 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:19,177 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-10 16:26:19,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:26:19,178 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:19,180 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:19,200 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-10 16:26:19,200 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:114, output treesize:112 [2018-04-10 16:26:19,233 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-10 16:26:19,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 16:26:19,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:19,236 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:19,254 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-10 16:26:19,255 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:126, output treesize:115 [2018-04-10 16:26:19,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 3 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 124 [2018-04-10 16:26:19,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:26:19,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:19,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:19,349 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-10 16:26:19,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:129, output treesize:121 [2018-04-10 16:26:19,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 125 [2018-04-10 16:26:19,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 16:26:19,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:26:19,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:26:19,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-10 16:26:19,525 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:139, output treesize:246 [2018-04-10 16:26:19,635 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-10 16:26:19,635 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:19,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2018-04-10 16:26:19,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:19,679 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 14 [2018-04-10 16:26:19,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:26:19,681 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:19,682 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:19,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 16:26:19,700 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:283, output treesize:118 [2018-04-10 16:26:19,734 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:19,737 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 128 treesize of output 130 [2018-04-10 16:26:19,739 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:19,739 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:19,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 74 [2018-04-10 16:26:19,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:26:19,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:26:19,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-04-10 16:26:19,800 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:148, output treesize:254 [2018-04-10 16:26:19,899 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:19,900 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 23 treesize of output 23 [2018-04-10 16:26:19,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10 16:26:19,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:19,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10 16:26:19,905 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:19,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:19,917 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-10 16:26:19,917 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:122, output treesize:97 [2018-04-10 16:26:19,953 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:19,954 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:19,955 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 70 [2018-04-10 16:26:19,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 16:26:19,956 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:19,965 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:19,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-04-10 16:26:19,966 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:19,971 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 40 treesize of output 27 [2018-04-10 16:26:19,972 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-10 16:26:19,978 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-10 16:26:19,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:26:19,984 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:101, output treesize:28 [2018-04-10 16:26:20,023 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:26:20,023 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:26:20,023 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-10 16:26:20,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-10 16:26:20,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-10 16:26:20,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2018-04-10 16:26:20,023 INFO L87 Difference]: Start difference. First operand 316 states and 360 transitions. Second operand 22 states. [2018-04-10 16:26:22,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:26:22,607 INFO L93 Difference]: Finished difference Result 671 states and 778 transitions. [2018-04-10 16:26:22,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-10 16:26:22,609 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 50 [2018-04-10 16:26:22,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:26:22,610 INFO L225 Difference]: With dead ends: 671 [2018-04-10 16:26:22,610 INFO L226 Difference]: Without dead ends: 671 [2018-04-10 16:26:22,611 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=424, Invalid=1464, Unknown=4, NotChecked=0, Total=1892 [2018-04-10 16:26:22,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2018-04-10 16:26:22,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 334. [2018-04-10 16:26:22,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-04-10 16:26:22,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 382 transitions. [2018-04-10 16:26:22,616 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 382 transitions. Word has length 50 [2018-04-10 16:26:22,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:26:22,616 INFO L459 AbstractCegarLoop]: Abstraction has 334 states and 382 transitions. [2018-04-10 16:26:22,616 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-10 16:26:22,616 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 382 transitions. [2018-04-10 16:26:22,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-10 16:26:22,617 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:26:22,617 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:26:22,617 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-10 16:26:22,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1627230848, now seen corresponding path program 1 times [2018-04-10 16:26:22,617 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:26:22,617 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:26:22,618 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:26:22,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:26:22,618 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:26:22,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:26:22,631 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:26:22,635 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:26:22,635 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:26:22,635 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:26:22,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:26:22,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:26:22,679 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:26:22,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:26:22,683 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:22,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 6 treesize of output 5 [2018-04-10 16:26:22,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:22,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:22,692 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-10 16:26:22,706 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:22,707 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:22,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-10 16:26:22,708 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:22,726 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-10 16:26:22,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:22,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:22,734 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:31 [2018-04-10 16:26:22,749 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-10 16:26:22,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 16:26:22,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:22,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:22,767 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-10 16:26:22,769 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-10 16:26:22,769 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:22,771 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:22,782 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-10 16:26:22,783 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:57, output treesize:55 [2018-04-10 16:26:22,818 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-10 16:26:22,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:26:22,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:22,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:22,843 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 69 treesize of output 63 [2018-04-10 16:26:22,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:26:22,844 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:22,850 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:22,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:26:22,863 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:113, output treesize:93 [2018-04-10 16:26:22,919 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:22,920 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:22,921 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:22,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 32 [2018-04-10 16:26:22,922 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:22,942 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 23 treesize of output 46 [2018-04-10 16:26:22,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:22,960 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-10 16:26:22,960 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:113, output treesize:105 [2018-04-10 16:26:22,991 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 43 treesize of output 49 [2018-04-10 16:26:22,994 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:22,994 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:26:22,994 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 23 treesize of output 41 [2018-04-10 16:26:22,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:23,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:23,030 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 69 treesize of output 70 [2018-04-10 16:26:23,032 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:23,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 81 [2018-04-10 16:26:23,033 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:23,042 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:23,066 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-10 16:26:23,066 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:124, output treesize:121 [2018-04-10 16:26:23,137 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 89 treesize of output 114 [2018-04-10 16:26:23,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:26:23,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:23,150 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:23,180 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 121 treesize of output 138 [2018-04-10 16:26:23,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:26:23,183 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:23,198 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:23,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:26:23,220 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:171, output treesize:155 [2018-04-10 16:26:23,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 110 [2018-04-10 16:26:23,336 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:26:23,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2018-04-10 16:26:23,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:23,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:23,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 150 [2018-04-10 16:26:23,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-04-10 16:26:23,393 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-10 16:26:23,417 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:26:23,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-10 16:26:23,487 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:181, output treesize:310 [2018-04-10 16:26:23,630 WARN L151 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 70 DAG size of output 70 [2018-04-10 16:26:23,636 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-10 16:26:23,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:23,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 186 [2018-04-10 16:26:23,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 14 treesize of output 13 [2018-04-10 16:26:23,640 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:23,667 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:23,693 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-10 16:26:23,693 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:347, output treesize:185 [2018-04-10 16:26:23,747 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 105 treesize of output 118 [2018-04-10 16:26:23,749 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:23,750 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:23,751 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:23,751 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:26:23,751 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 31 treesize of output 87 [2018-04-10 16:26:23,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:23,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:23,806 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:23,807 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 197 treesize of output 199 [2018-04-10 16:26:23,810 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:23,810 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:23,811 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:23,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 86 [2018-04-10 16:26:23,813 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:23,835 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:23,862 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-10 16:26:23,862 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:244, output treesize:220 [2018-04-10 16:26:23,970 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:23,971 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 23 treesize of output 23 [2018-04-10 16:26:23,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 7 treesize of output 3 [2018-04-10 16:26:23,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:23,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10 16:26:23,977 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:23,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:24,002 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-10 16:26:24,002 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:215, output treesize:193 [2018-04-10 16:26:24,076 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:24,077 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:24,079 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 132 [2018-04-10 16:26:24,081 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:24,082 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:24,082 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:24,085 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:24,093 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 75 [2018-04-10 16:26:24,094 INFO L267 ElimStorePlain]: Start of recursive call 3: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 6 xjuncts. [2018-04-10 16:26:24,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 5 treesize of output 1 [2018-04-10 16:26:24,122 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:24,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, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 66 [2018-04-10 16:26:24,135 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-10 16:26:24,144 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-10 16:26:24,167 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 59 [2018-04-10 16:26:24,168 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:24,169 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:24,169 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:24,170 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:26:24,170 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 28 [2018-04-10 16:26:24,170 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:24,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10 16:26:24,180 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:24,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2018-04-10 16:26:24,185 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:24,187 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:24,196 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-10 16:26:24,196 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:204, output treesize:39 [2018-04-10 16:26:24,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:26:24,255 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:26:24,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-10 16:26:24,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-10 16:26:24,256 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-10 16:26:24,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2018-04-10 16:26:24,256 INFO L87 Difference]: Start difference. First operand 334 states and 382 transitions. Second operand 21 states. [2018-04-10 16:26:25,686 WARN L151 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 94 DAG size of output 93 [2018-04-10 16:26:27,144 WARN L151 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 198 DAG size of output 107 [2018-04-10 16:26:27,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:26:27,933 INFO L93 Difference]: Finished difference Result 691 states and 796 transitions. [2018-04-10 16:26:27,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-10 16:26:27,933 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 50 [2018-04-10 16:26:27,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:26:27,934 INFO L225 Difference]: With dead ends: 691 [2018-04-10 16:26:27,934 INFO L226 Difference]: Without dead ends: 691 [2018-04-10 16:26:27,935 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=389, Invalid=1503, Unknown=0, NotChecked=0, Total=1892 [2018-04-10 16:26:27,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2018-04-10 16:26:27,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 318. [2018-04-10 16:26:27,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-04-10 16:26:27,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 362 transitions. [2018-04-10 16:26:27,938 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 362 transitions. Word has length 50 [2018-04-10 16:26:27,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:26:27,939 INFO L459 AbstractCegarLoop]: Abstraction has 318 states and 362 transitions. [2018-04-10 16:26:27,939 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-10 16:26:27,939 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 362 transitions. [2018-04-10 16:26:27,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-10 16:26:27,939 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:26:27,940 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:26:27,940 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-10 16:26:27,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1600558393, now seen corresponding path program 1 times [2018-04-10 16:26:27,940 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:26:27,940 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:26:27,941 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:26:27,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:26:27,941 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:26:27,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:26:27,947 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:26:28,027 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:26:28,027 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:26:28,027 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:26:28,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:26:28,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:26:28,040 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:26:28,275 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-10 16:26:28,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:26:28,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:26:28,281 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:26:28,288 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-10 16:26:28,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:26:28,291 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-10 16:26:28,293 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:26:28,300 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-10 16:26:28,300 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:41, output treesize:18 [2018-04-10 16:26:28,352 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:26:28,352 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:26:28,353 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 19 [2018-04-10 16:26:28,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-10 16:26:28,353 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-10 16:26:28,353 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=304, Unknown=2, NotChecked=0, Total=342 [2018-04-10 16:26:28,353 INFO L87 Difference]: Start difference. First operand 318 states and 362 transitions. Second operand 19 states. [2018-04-10 16:26:29,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:26:29,235 INFO L93 Difference]: Finished difference Result 421 states and 477 transitions. [2018-04-10 16:26:29,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-10 16:26:29,235 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 50 [2018-04-10 16:26:29,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:26:29,236 INFO L225 Difference]: With dead ends: 421 [2018-04-10 16:26:29,236 INFO L226 Difference]: Without dead ends: 421 [2018-04-10 16:26:29,237 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=200, Invalid=911, Unknown=11, NotChecked=0, Total=1122 [2018-04-10 16:26:29,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2018-04-10 16:26:29,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 350. [2018-04-10 16:26:29,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-04-10 16:26:29,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 400 transitions. [2018-04-10 16:26:29,239 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 400 transitions. Word has length 50 [2018-04-10 16:26:29,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:26:29,239 INFO L459 AbstractCegarLoop]: Abstraction has 350 states and 400 transitions. [2018-04-10 16:26:29,239 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-10 16:26:29,239 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 400 transitions. [2018-04-10 16:26:29,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-10 16:26:29,240 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:26:29,240 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:26:29,240 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-10 16:26:29,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1133470839, now seen corresponding path program 1 times [2018-04-10 16:26:29,240 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:26:29,240 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:26:29,241 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:26:29,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:26:29,241 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:26:29,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:26:29,248 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:26:29,250 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:26:29,250 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:26:29,250 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:26:29,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:26:29,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:26:29,268 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:26:29,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-10 16:26:29,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:26:29,278 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:29,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:29,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:29,291 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-04-10 16:26:29,305 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:29,306 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:29,306 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-10 16:26:29,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:29,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:29,310 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2018-04-10 16:26:29,337 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-10 16:26:29,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:26:29,339 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:29,341 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:29,348 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-10 16:26:29,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-04-10 16:26:29,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 34 [2018-04-10 16:26:29,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:26:29,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:29,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:29,390 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-10 16:26:29,390 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:37 [2018-04-10 16:26:29,405 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 29 treesize of output 19 [2018-04-10 16:26:29,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10 16:26:29,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:29,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-04-10 16:26:29,410 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:29,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:29,414 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-10 16:26:29,414 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:17 [2018-04-10 16:26:29,443 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-10 16:26:29,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:26:29,445 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:29,449 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:29,455 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-10 16:26:29,455 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-04-10 16:26:29,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-04-10 16:26:29,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10 16:26:29,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:29,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10 16:26:29,510 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:29,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:29,513 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-10 16:26:29,513 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2018-04-10 16:26:29,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:26:29,534 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:26:29,534 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-10 16:26:29,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-10 16:26:29,535 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-10 16:26:29,535 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2018-04-10 16:26:29,535 INFO L87 Difference]: Start difference. First operand 350 states and 400 transitions. Second operand 17 states. [2018-04-10 16:26:30,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:26:30,488 INFO L93 Difference]: Finished difference Result 681 states and 772 transitions. [2018-04-10 16:26:30,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-10 16:26:30,488 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 50 [2018-04-10 16:26:30,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:26:30,489 INFO L225 Difference]: With dead ends: 681 [2018-04-10 16:26:30,489 INFO L226 Difference]: Without dead ends: 681 [2018-04-10 16:26:30,490 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=313, Invalid=1093, Unknown=0, NotChecked=0, Total=1406 [2018-04-10 16:26:30,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2018-04-10 16:26:30,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 373. [2018-04-10 16:26:30,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-04-10 16:26:30,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 426 transitions. [2018-04-10 16:26:30,494 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 426 transitions. Word has length 50 [2018-04-10 16:26:30,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:26:30,494 INFO L459 AbstractCegarLoop]: Abstraction has 373 states and 426 transitions. [2018-04-10 16:26:30,494 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-10 16:26:30,494 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 426 transitions. [2018-04-10 16:26:30,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-10 16:26:30,494 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:26:30,495 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:26:30,495 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-10 16:26:30,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1404316015, now seen corresponding path program 1 times [2018-04-10 16:26:30,495 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:26:30,495 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:26:30,495 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:26:30,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:26:30,496 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:26:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:26:30,503 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:26:30,508 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:26:30,508 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:26:30,508 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:26:30,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:26:30,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:26:30,524 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:26:30,543 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-10 16:26:30,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-10 16:26:30,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:30,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:30,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:30,548 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-04-10 16:26:30,563 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:30,563 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:30,564 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-10 16:26:30,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:30,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:30,568 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2018-04-10 16:26:30,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-10 16:26:30,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:26:30,587 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:30,588 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:30,593 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-10 16:26:30,593 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-04-10 16:26:30,647 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 30 treesize of output 34 [2018-04-10 16:26:30,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:26:30,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:30,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:30,657 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-10 16:26:30,657 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:37 [2018-04-10 16:26:30,673 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 29 treesize of output 19 [2018-04-10 16:26:30,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10 16:26:30,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:30,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-04-10 16:26:30,677 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:30,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:30,682 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-10 16:26:30,682 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:17 [2018-04-10 16:26:30,704 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-10 16:26:30,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:26:30,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:30,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:30,713 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-10 16:26:30,713 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-04-10 16:26:30,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-04-10 16:26:30,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10 16:26:30,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:30,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10 16:26:30,774 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:30,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:30,778 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-10 16:26:30,778 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2018-04-10 16:26:30,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:26:30,814 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:26:30,814 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-10 16:26:30,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-10 16:26:30,815 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-10 16:26:30,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2018-04-10 16:26:30,815 INFO L87 Difference]: Start difference. First operand 373 states and 426 transitions. Second operand 17 states. [2018-04-10 16:26:31,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:26:31,669 INFO L93 Difference]: Finished difference Result 700 states and 793 transitions. [2018-04-10 16:26:31,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-10 16:26:31,670 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 50 [2018-04-10 16:26:31,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:26:31,671 INFO L225 Difference]: With dead ends: 700 [2018-04-10 16:26:31,671 INFO L226 Difference]: Without dead ends: 700 [2018-04-10 16:26:31,671 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=313, Invalid=1093, Unknown=0, NotChecked=0, Total=1406 [2018-04-10 16:26:31,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2018-04-10 16:26:31,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 369. [2018-04-10 16:26:31,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-04-10 16:26:31,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 421 transitions. [2018-04-10 16:26:31,674 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 421 transitions. Word has length 50 [2018-04-10 16:26:31,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:26:31,675 INFO L459 AbstractCegarLoop]: Abstraction has 369 states and 421 transitions. [2018-04-10 16:26:31,675 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-10 16:26:31,675 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 421 transitions. [2018-04-10 16:26:31,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-10 16:26:31,675 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:26:31,675 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:26:31,676 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-10 16:26:31,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1922298155, now seen corresponding path program 1 times [2018-04-10 16:26:31,676 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:26:31,676 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:26:31,676 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:26:31,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:26:31,676 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:26:31,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:26:31,682 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:26:31,683 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:26:31,683 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:26:31,683 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:26:31,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:26:31,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:26:31,696 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:26:31,755 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-10 16:26:31,756 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:26:31,756 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-10 16:26:31,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 16:26:31,756 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 16:26:31,756 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=27, Unknown=3, NotChecked=0, Total=42 [2018-04-10 16:26:31,756 INFO L87 Difference]: Start difference. First operand 369 states and 421 transitions. Second operand 7 states. [2018-04-10 16:26:31,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:26:31,918 INFO L93 Difference]: Finished difference Result 383 states and 434 transitions. [2018-04-10 16:26:31,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 16:26:31,918 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-04-10 16:26:31,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:26:31,919 INFO L225 Difference]: With dead ends: 383 [2018-04-10 16:26:31,919 INFO L226 Difference]: Without dead ends: 350 [2018-04-10 16:26:31,919 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=47, Unknown=3, NotChecked=0, Total=72 [2018-04-10 16:26:31,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-04-10 16:26:31,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2018-04-10 16:26:31,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-04-10 16:26:31,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 401 transitions. [2018-04-10 16:26:31,921 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 401 transitions. Word has length 51 [2018-04-10 16:26:31,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:26:31,921 INFO L459 AbstractCegarLoop]: Abstraction has 350 states and 401 transitions. [2018-04-10 16:26:31,921 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 16:26:31,921 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 401 transitions. [2018-04-10 16:26:31,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-10 16:26:31,922 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:26:31,922 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:26:31,922 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-10 16:26:31,922 INFO L82 PathProgramCache]: Analyzing trace with hash 257962024, now seen corresponding path program 1 times [2018-04-10 16:26:31,922 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:26:31,922 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:26:31,923 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:26:31,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:26:31,923 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:26:31,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:26:31,929 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:26:31,936 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:26:31,936 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:26:31,936 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:26:31,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:26:31,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:26:31,954 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:26:31,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:26:31,960 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:31,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:31,961 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-10 16:26:31,967 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:31,968 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:31,969 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 11 treesize of output 12 [2018-04-10 16:26:31,969 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:31,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:31,972 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-10 16:26:31,981 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-10 16:26:31,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:26:31,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:31,984 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:31,989 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-10 16:26:31,990 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-10 16:26:31,990 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:31,991 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:31,995 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-10 16:26:31,995 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:20 [2018-04-10 16:26:32,002 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-10 16:26:32,003 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-10 16:26:32,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:32,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:32,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:32,006 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:14 [2018-04-10 16:26:32,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-04-10 16:26:32,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:26:32,017 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:32,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:32,023 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-10 16:26:32,023 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:21 [2018-04-10 16:26:32,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2018-04-10 16:26:32,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-10 16:26:32,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:32,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10 16:26:32,066 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:32,067 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:32,068 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-10 16:26:32,068 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:30, output treesize:3 [2018-04-10 16:26:32,079 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-10 16:26:32,079 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:26:32,079 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-10 16:26:32,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 16:26:32,079 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 16:26:32,079 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-04-10 16:26:32,079 INFO L87 Difference]: Start difference. First operand 350 states and 401 transitions. Second operand 10 states. [2018-04-10 16:26:32,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:26:32,562 INFO L93 Difference]: Finished difference Result 514 states and 588 transitions. [2018-04-10 16:26:32,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-10 16:26:32,562 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2018-04-10 16:26:32,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:26:32,564 INFO L225 Difference]: With dead ends: 514 [2018-04-10 16:26:32,564 INFO L226 Difference]: Without dead ends: 514 [2018-04-10 16:26:32,564 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=460, Unknown=0, NotChecked=0, Total=600 [2018-04-10 16:26:32,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2018-04-10 16:26:32,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 359. [2018-04-10 16:26:32,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-04-10 16:26:32,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 411 transitions. [2018-04-10 16:26:32,568 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 411 transitions. Word has length 52 [2018-04-10 16:26:32,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:26:32,569 INFO L459 AbstractCegarLoop]: Abstraction has 359 states and 411 transitions. [2018-04-10 16:26:32,569 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 16:26:32,569 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 411 transitions. [2018-04-10 16:26:32,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-10 16:26:32,569 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:26:32,570 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:26:32,570 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-10 16:26:32,570 INFO L82 PathProgramCache]: Analyzing trace with hash -593111597, now seen corresponding path program 1 times [2018-04-10 16:26:32,570 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:26:32,570 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:26:32,571 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:26:32,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:26:32,571 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:26:32,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:26:32,578 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:26:32,586 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:26:32,586 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:26:32,586 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:26:32,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:26:32,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:26:32,608 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:26:32,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:26:32,622 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:32,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:32,624 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-10 16:26:32,630 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:32,631 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:32,632 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-10 16:26:32,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:32,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:32,637 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-10 16:26:32,646 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-10 16:26:32,648 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-10 16:26:32,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:32,649 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:32,654 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-10 16:26:32,655 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-04-10 16:26:32,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-04-10 16:26:32,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:26:32,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:32,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:32,689 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-10 16:26:32,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:40 [2018-04-10 16:26:32,728 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 44 treesize of output 30 [2018-04-10 16:26:32,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2018-04-10 16:26:32,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:32,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10 16:26:32,734 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:32,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:32,741 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-10 16:26:32,741 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:49, output treesize:15 [2018-04-10 16:26:32,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-10 16:26:32,775 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:26:32,775 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-10 16:26:32,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 16:26:32,775 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 16:26:32,775 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-04-10 16:26:32,775 INFO L87 Difference]: Start difference. First operand 359 states and 411 transitions. Second operand 10 states. [2018-04-10 16:26:33,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:26:33,222 INFO L93 Difference]: Finished difference Result 503 states and 578 transitions. [2018-04-10 16:26:33,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-10 16:26:33,247 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2018-04-10 16:26:33,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:26:33,248 INFO L225 Difference]: With dead ends: 503 [2018-04-10 16:26:33,248 INFO L226 Difference]: Without dead ends: 503 [2018-04-10 16:26:33,249 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2018-04-10 16:26:33,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2018-04-10 16:26:33,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 360. [2018-04-10 16:26:33,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-04-10 16:26:33,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 412 transitions. [2018-04-10 16:26:33,251 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 412 transitions. Word has length 53 [2018-04-10 16:26:33,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:26:33,251 INFO L459 AbstractCegarLoop]: Abstraction has 360 states and 412 transitions. [2018-04-10 16:26:33,251 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 16:26:33,251 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 412 transitions. [2018-04-10 16:26:33,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-10 16:26:33,252 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:26:33,252 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:26:33,252 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-10 16:26:33,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1457322319, now seen corresponding path program 1 times [2018-04-10 16:26:33,252 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:26:33,252 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:26:33,253 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:26:33,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:26:33,253 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:26:33,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:26:33,267 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:26:33,270 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:26:33,270 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:26:33,270 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:26:33,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:26:33,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:26:33,311 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:26:33,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:26:33,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:33,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:33,317 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:26:33,327 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:33,328 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:33,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-10 16:26:33,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:33,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:33,334 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-04-10 16:26:33,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-10 16:26:33,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-10 16:26:33,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:33,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:33,354 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-10 16:26:33,355 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-04-10 16:26:33,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-04-10 16:26:33,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:26:33,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:33,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:33,395 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-10 16:26:33,396 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:43 [2018-04-10 16:26:33,435 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:33,436 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:33,437 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:33,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 52 [2018-04-10 16:26:33,438 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:33,453 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-10 16:26:33,453 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:68 [2018-04-10 16:26:33,490 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 56 treesize of output 59 [2018-04-10 16:26:33,494 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:33,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 68 [2018-04-10 16:26:33,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:33,510 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:33,527 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-10 16:26:33,527 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:79, output treesize:80 [2018-04-10 16:26:33,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 104 [2018-04-10 16:26: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 14 treesize of output 13 [2018-04-10 16:26:33,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:33,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:33,608 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-10 16:26:33,608 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:101, output treesize:93 [2018-04-10 16:26:33,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 105 [2018-04-10 16:26:33,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 16:26:33,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:26:33,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:26:33,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-10 16:26:33,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:108, output treesize:184 [2018-04-10 16:26:33,787 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:33,788 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:33,788 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:33,789 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:33,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 91 [2018-04-10 16:26:33,789 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:33,806 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-10 16:26:33,807 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:98, output treesize:118 [2018-04-10 16:26:33,839 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:33,843 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 111 treesize of output 123 [2018-04-10 16:26:33,845 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:33,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-10 16:26:33,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:33,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:33,874 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-10 16:26:33,875 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:131, output treesize:142 [2018-04-10 16:26:33,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 175 treesize of output 151 [2018-04-10 16:26:33,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:26:33,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:33,991 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:34,007 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-10 16:26:34,007 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:186, output treesize:172 [2018-04-10 16:26:34,124 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 6 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 104 [2018-04-10 16:26:34,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 16:26:34,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:34,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 43 [2018-04-10 16:26:34,137 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-10 16:26:34,148 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:34,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, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 24 [2018-04-10 16:26:34,149 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-10 16:26:34,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 16:26:34,157 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:34,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:26:34,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 16:26:34,172 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:166, output treesize:45 [2018-04-10 16:26:34,211 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:26:34,211 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:26:34,211 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-10 16:26:34,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-10 16:26:34,211 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-10 16:26:34,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2018-04-10 16:26:34,212 INFO L87 Difference]: Start difference. First operand 360 states and 412 transitions. Second operand 22 states. [2018-04-10 16:26:36,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:26:36,480 INFO L93 Difference]: Finished difference Result 706 states and 813 transitions. [2018-04-10 16:26:36,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-10 16:26:36,480 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 53 [2018-04-10 16:26:36,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:26:36,481 INFO L225 Difference]: With dead ends: 706 [2018-04-10 16:26:36,481 INFO L226 Difference]: Without dead ends: 706 [2018-04-10 16:26:36,482 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=430, Invalid=1640, Unknown=0, NotChecked=0, Total=2070 [2018-04-10 16:26:36,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2018-04-10 16:26:36,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 382. [2018-04-10 16:26:36,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-04-10 16:26:36,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 437 transitions. [2018-04-10 16:26:36,484 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 437 transitions. Word has length 53 [2018-04-10 16:26:36,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:26:36,485 INFO L459 AbstractCegarLoop]: Abstraction has 382 states and 437 transitions. [2018-04-10 16:26:36,485 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-10 16:26:36,485 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 437 transitions. [2018-04-10 16:26:36,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-10 16:26:36,485 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:26:36,485 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:26:36,485 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-10 16:26:36,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1457322318, now seen corresponding path program 1 times [2018-04-10 16:26:36,485 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:26:36,485 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:26:36,486 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:26:36,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:26:36,486 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:26:36,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:26:36,493 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:26:36,496 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:26:36,496 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:26:36,496 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:26:36,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:26:36,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:26:36,525 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:26:36,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:26:36,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:36,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:26:36,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:36,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:36,536 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-10 16:26:36,546 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:36,547 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-10 16:26:36,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:36,575 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:36,575 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:36,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-10 16:26:36,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:36,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:36,582 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:31 [2018-04-10 16:26:36,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-10 16:26:36,596 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-10 16:26:36,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:36,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:36,609 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-10 16:26:36,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:26:36,610 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:36,611 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:36,621 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-10 16:26:36,621 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:57, output treesize:55 [2018-04-10 16:26:36,653 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 79 treesize of output 73 [2018-04-10 16:26:36,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:26:36,655 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:36,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:36,676 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-10 16:26:36,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:26:36,677 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:36,681 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:36,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:26:36,693 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:113, output treesize:93 [2018-04-10 16:26:36,737 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:36,738 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:36,738 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:36,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 52 [2018-04-10 16:26:36,739 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:36,764 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 23 treesize of output 46 [2018-04-10 16:26:36,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:36,785 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-10 16:26:36,786 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:119, output treesize:126 [2018-04-10 16:26:36,824 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 80 treesize of output 79 [2018-04-10 16:26:36,826 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:36,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 92 [2018-04-10 16:26:36,827 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:36,838 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:36,868 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 43 treesize of output 49 [2018-04-10 16:26:36,870 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:36,871 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:26:36,871 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 23 treesize of output 41 [2018-04-10 16:26:36,871 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:36,878 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:36,899 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-10 16:26:36,900 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:145, output treesize:146 [2018-04-10 16:26:36,976 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 60 treesize of output 85 [2018-04-10 16:26:36,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:26:36,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:36,986 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:37,016 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 133 treesize of output 150 [2018-04-10 16:26:37,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:26:37,018 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:37,031 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:37,056 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-10 16:26:37,056 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:188, output treesize:172 [2018-04-10 16:26:37,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 97 [2018-04-10 16:26:37,186 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 20 treesize of output 31 [2018-04-10 16:26:37,186 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:26:37,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:26:37,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 165 [2018-04-10 16:26:37,264 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 13 [2018-04-10 16:26:37,265 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:37,285 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:37,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 173 [2018-04-10 16:26:37,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 16:26:37,301 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-10 16:26:37,326 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:26:37,389 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-10 16:26:37,389 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:203, output treesize:359 [2018-04-10 16:26:37,470 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:37,471 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:37,472 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:37,472 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:37,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 95 [2018-04-10 16:26:37,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:37,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 85 [2018-04-10 16:26:37,510 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:37,551 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-10 16:26:37,551 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:185, output treesize:200 [2018-04-10 16:26:37,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 50 [2018-04-10 16:26:37,604 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:37,644 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:37,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 147 [2018-04-10 16:26:37,652 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:37,653 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 16 treesize of output 23 [2018-04-10 16:26:37,653 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:37,672 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:37,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 89 [2018-04-10 16:26:37,714 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:37,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-10 16:26:37,716 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:37,726 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:37,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:26:37,757 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:231, output treesize:190 [2018-04-10 16:26:37,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 198 [2018-04-10 16:26:37,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:26:37,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:37,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:37,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 152 [2018-04-10 16:26:37,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:26:37,911 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:37,922 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:37,949 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-10 16:26:37,949 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:269, output treesize:241 [2018-04-10 16:26:38,268 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 6 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 133 [2018-04-10 16:26:38,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 57 [2018-04-10 16:26:38,297 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-10 16:26:38,316 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:38,317 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 50 treesize of output 31 [2018-04-10 16:26:38,318 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-10 16:26:38,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 16:26:38,335 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:38,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, 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-10 16:26:38,358 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:38,369 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:26:38,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 60 [2018-04-10 16:26:38,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10 16:26:38,394 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:38,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10 16:26:38,405 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:38,411 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:38,411 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 11 [2018-04-10 16:26:38,411 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:38,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 16:26:38,416 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:38,418 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:38,430 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 1 xjuncts. [2018-04-10 16:26:38,430 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:236, output treesize:51 [2018-04-10 16:26:38,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:26:38,495 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:26:38,495 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-10 16:26:38,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-10 16:26:38,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-10 16:26:38,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2018-04-10 16:26:38,495 INFO L87 Difference]: Start difference. First operand 382 states and 437 transitions. Second operand 22 states. [2018-04-10 16:26:39,391 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 118 DAG size of output 98 [2018-04-10 16:26:39,689 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 138 DAG size of output 117 [2018-04-10 16:26:42,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:26:42,259 INFO L93 Difference]: Finished difference Result 717 states and 825 transitions. [2018-04-10 16:26:42,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-10 16:26:42,260 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 53 [2018-04-10 16:26:42,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:26:42,261 INFO L225 Difference]: With dead ends: 717 [2018-04-10 16:26:42,261 INFO L226 Difference]: Without dead ends: 717 [2018-04-10 16:26:42,261 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=405, Invalid=1575, Unknown=0, NotChecked=0, Total=1980 [2018-04-10 16:26:42,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-04-10 16:26:42,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 376. [2018-04-10 16:26:42,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-04-10 16:26:42,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 429 transitions. [2018-04-10 16:26:42,265 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 429 transitions. Word has length 53 [2018-04-10 16:26:42,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:26:42,265 INFO L459 AbstractCegarLoop]: Abstraction has 376 states and 429 transitions. [2018-04-10 16:26:42,265 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-10 16:26:42,265 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 429 transitions. [2018-04-10 16:26:42,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-10 16:26:42,265 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:26:42,265 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:26:42,265 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-10 16:26:42,265 INFO L82 PathProgramCache]: Analyzing trace with hash 55671134, now seen corresponding path program 1 times [2018-04-10 16:26:42,266 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:26:42,266 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:26:42,266 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:26:42,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:26:42,266 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:26:42,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:26:42,273 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:26:42,275 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:26:42,276 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:26:42,276 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:26:42,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:26:42,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:26:42,297 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:26:42,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:26:42,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:42,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-10 16:26:42,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:42,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:42,313 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-10 16:26:42,337 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:42,338 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:42,338 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-10 16:26:42,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:42,362 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-10 16:26:42,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:42,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:42,374 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:37 [2018-04-10 16:26:42,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, 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-10 16:26:42,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 8 treesize of output 7 [2018-04-10 16:26:42,405 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:42,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:42,428 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-10 16:26:42,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:26:42,430 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:42,432 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:42,447 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-10 16:26:42,447 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:62, output treesize:56 [2018-04-10 16:26:42,462 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-10 16:26:42,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 16:26:42,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:42,464 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:42,472 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-10 16:26:42,472 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:52 [2018-04-10 16:26:42,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 48 [2018-04-10 16:26:42,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2018-04-10 16:26:42,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:42,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:42,521 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-10 16:26:42,521 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:62, output treesize:58 [2018-04-10 16:26:42,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 47 treesize of output 70 [2018-04-10 16:26:42,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 60 [2018-04-10 16:26:42,569 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-10 16:26:42,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 52 [2018-04-10 16:26:42,675 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-10 16:26:42,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 49 [2018-04-10 16:26:42,754 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-10 16:26:42,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 43 [2018-04-10 16:26:42,821 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:42,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-04-10 16:26:42,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 11 treesize of output 8 [2018-04-10 16:26:42,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 8 treesize of output 7 [2018-04-10 16:26:42,933 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:42,934 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:42,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 12 dim-0 vars, and 5 xjuncts. [2018-04-10 16:26:42,992 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:83, output treesize:353 [2018-04-10 16:26:43,220 WARN L151 SmtUtils]: Spent 206ms on a formula simplification. DAG size of input: 124 DAG size of output 102 [2018-04-10 16:26:43,230 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:43,230 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:43,231 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:43,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 78 [2018-04-10 16:26:43,231 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:43,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 92 [2018-04-10 16:26:43,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:26:43,396 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 67 treesize of output 57 [2018-04-10 16:26:43,396 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:43,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 53 [2018-04-10 16:26:43,465 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:43,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 5 xjuncts. [2018-04-10 16:26:43,540 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 13 variables, input treesize:297, output treesize:315 [2018-04-10 16:26:43,662 WARN L148 SmtUtils]: Spent 105ms on a formula simplification that was a NOOP. DAG size: 118 [2018-04-10 16:26:43,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 100 [2018-04-10 16:26:43,671 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:43,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 16:26:43,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:43,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:44,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, 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 81 [2018-04-10 16:26:44,194 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:44,194 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:26:44,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 48 [2018-04-10 16:26:44,195 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:44,211 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:44,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 101 treesize of output 113 [2018-04-10 16:26:44,669 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:44,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 111 [2018-04-10 16:26:44,670 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:44,724 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:44,731 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 3 case distinctions, treesize of input 95 treesize of output 108 [2018-04-10 16:26:44,731 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-10 16:26:44,777 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:26:45,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 82 [2018-04-10 16:26:45,139 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:45,140 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:45,140 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 31 [2018-04-10 16:26:45,140 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:45,155 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:45,481 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 88 treesize of output 83 [2018-04-10 16:26:45,483 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:45,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 16:26:45,484 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:45,497 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:45,732 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 83 treesize of output 78 [2018-04-10 16:26:45,734 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:45,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 16:26:45,735 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:45,748 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:45,956 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 90 treesize of output 85 [2018-04-10 16:26:45,967 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:45,968 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:26:45,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 30 [2018-04-10 16:26:45,968 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:45,986 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:46,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 87 treesize of output 110 [2018-04-10 16:26:46,185 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:46,185 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:46,192 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 2 case distinctions, treesize of input 87 treesize of output 110 [2018-04-10 16:26:46,192 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-04-10 16:26:46,434 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:46,435 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 82 treesize of output 89 [2018-04-10 16:26:46,435 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:46,477 INFO L267 ElimStorePlain]: Start of recursive call 17: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:26:46,661 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 76 treesize of output 71 [2018-04-10 16:26:46,663 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:46,663 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:26:46,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 30 [2018-04-10 16:26:46,664 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:46,679 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:46,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 65 [2018-04-10 16:26:46,846 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:46,847 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:46,849 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 23 treesize of output 38 [2018-04-10 16:26:46,849 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:46,861 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:46,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 20 dim-0 vars, 10 dim-2 vars, End of recursive call: 26 dim-0 vars, and 7 xjuncts. [2018-04-10 16:26:46,992 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 30 variables, input treesize:439, output treesize:562 [2018-04-10 16:27:27,361 WARN L151 SmtUtils]: Spent 40268ms on a formula simplification. DAG size of input: 238 DAG size of output 163 [2018-04-10 16:27:47,540 WARN L148 SmtUtils]: Spent 20115ms on a formula simplification that was a NOOP. DAG size: 163 [2018-04-10 16:27:47,611 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 73 treesize of output 67 [2018-04-10 16:27:47,613 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:27:47,613 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:27:47,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, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-04-10 16:27:47,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:27:47,623 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:27:47,727 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 102 treesize of output 90 [2018-04-10 16:27:47,728 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:27:47,729 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 25 treesize of output 17 [2018-04-10 16:27:47,729 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:27:47,744 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:27:47,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-04-10 16:27:47,745 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:27:47,758 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:27:47,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 88 [2018-04-10 16:27:47,845 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:27:47,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 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-10 16:27:47,846 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:27:47,861 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:27:47,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-10 16:27:47,862 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:27:47,873 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:27:47,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, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 56 [2018-04-10 16:27:47,962 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:27:47,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-04-10 16:27:47,963 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 16:27:47,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 5 treesize of output 1 [2018-04-10 16:27:47,973 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 16:27:47,980 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:27:48,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 147 treesize of output 126 [2018-04-10 16:27:48,067 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:27:48,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 107 [2018-04-10 16:27:48,067 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-10 16:27:48,179 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:27:48,180 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 101 treesize of output 95 [2018-04-10 16:27:48,180 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-10 16:27:48,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 69 [2018-04-10 16:27:48,273 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-10 16:27:48,358 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:27:48,359 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 107 treesize of output 101 [2018-04-10 16:27:48,360 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-10 16:27:48,439 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:27:48,439 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:27:48,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 77 [2018-04-10 16:27:48,440 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:27:48,523 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:27:48,524 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 111 treesize of output 103 [2018-04-10 16:27:48,524 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-10 16:27:48,606 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:27:48,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 89 [2018-04-10 16:27:48,611 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-10 16:27:48,703 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:27:48,704 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:27:48,705 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:27:48,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 111 [2018-04-10 16:27:48,713 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-10 16:27:48,857 INFO L267 ElimStorePlain]: Start of recursive call 13: 8 dim-1 vars, End of recursive call: 5 dim-0 vars, and 7 xjuncts. [2018-04-10 16:27:49,066 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 79 treesize of output 73 [2018-04-10 16:27:49,068 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:27:49,069 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:27:49,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-04-10 16:27:49,069 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-10 16:27:49,085 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 5 treesize of output 1 [2018-04-10 16:27:49,085 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-10 16:27:49,097 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:27:49,099 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 73 treesize of output 67 [2018-04-10 16:27:49,100 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:27:49,101 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 13 treesize of output 6 [2018-04-10 16:27:49,101 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-10 16:27:49,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 16:27:49,114 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-10 16:27:49,124 INFO L267 ElimStorePlain]: Start of recursive call 25: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:27:49,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 73 [2018-04-10 16:27:49,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10 16:27:49,128 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-10 16:27:49,143 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:27:49,144 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 13 treesize of output 6 [2018-04-10 16:27:49,144 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-10 16:27:49,157 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:27:49,159 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 69 treesize of output 63 [2018-04-10 16:27:49,160 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:27:49,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-10 16:27:49,161 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-10 16:27:49,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 16:27:49,174 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-10 16:27:49,185 INFO L267 ElimStorePlain]: Start of recursive call 31: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:27:49,186 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 78 treesize of output 72 [2018-04-10 16:27:49,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 16:27:49,188 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-04-10 16:27:49,204 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:27:49,205 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 13 treesize of output 6 [2018-04-10 16:27:49,205 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-04-10 16:27:49,218 INFO L267 ElimStorePlain]: Start of recursive call 34: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:27:49,220 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 73 treesize of output 67 [2018-04-10 16:27:49,221 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:27:49,222 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:27:49,222 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-04-10 16:27:49,222 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-04-10 16:27:49,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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-10 16:27:49,236 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-04-10 16:27:49,245 INFO L267 ElimStorePlain]: Start of recursive call 37: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:27:49,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 59 [2018-04-10 16:27:49,249 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:27:49,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-10 16:27:49,250 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-04-10 16:27:49,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10 16:27:49,264 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-04-10 16:27:49,273 INFO L267 ElimStorePlain]: Start of recursive call 40: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:27:49,438 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 58 treesize of output 52 [2018-04-10 16:27:49,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10 16:27:49,439 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-04-10 16:27:49,449 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:27:49,450 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:27:49,450 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 13 treesize of output 11 [2018-04-10 16:27:49,450 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-04-10 16:27:49,458 INFO L267 ElimStorePlain]: Start of recursive call 43: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:27:49,619 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 88 treesize of output 86 [2018-04-10 16:27:49,620 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:27:49,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 76 [2018-04-10 16:27:49,621 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-04-10 16:27:49,656 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:27:49,657 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 70 treesize of output 64 [2018-04-10 16:27:49,657 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-04-10 16:27:49,689 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:27:49,690 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:27:49,691 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:27:49,691 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:27:49,691 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:27:49,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 87 [2018-04-10 16:27:49,693 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-04-10 16:27:49,723 INFO L267 ElimStorePlain]: Start of recursive call 46: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:27:49,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 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-10 16:27:49,908 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:27:49,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-10 16:27:49,909 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-04-10 16:27:49,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10 16:27:49,917 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-04-10 16:27:49,924 INFO L267 ElimStorePlain]: Start of recursive call 50: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:27:49,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 55 [2018-04-10 16:27:49,929 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:27:49,929 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:27:49,930 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 51 treesize of output 48 [2018-04-10 16:27:49,930 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-04-10 16:27:49,955 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:27:49,956 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:27:49,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 42 [2018-04-10 16:27:49,956 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-04-10 16:27:49,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2018-04-10 16:27:49,980 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-04-10 16:27:49,997 INFO L267 ElimStorePlain]: Start of recursive call 53: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:27:50,166 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 50 treesize of output 44 [2018-04-10 16:27:50,167 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:27:50,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-04-10 16:27:50,169 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-04-10 16:27:50,176 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:27:50,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 25 dim-0 vars, 10 dim-2 vars, End of recursive call: 11 dim-0 vars, and 11 xjuncts. [2018-04-10 16:27:50,325 INFO L202 ElimStorePlain]: Needed 58 recursive calls to eliminate 35 variables, input treesize:507, output treesize:184 [2018-04-10 16:27:50,494 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:27:50,494 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:27:50,494 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-10 16:27:50,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-10 16:27:50,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-10 16:27:50,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-04-10 16:27:50,495 INFO L87 Difference]: Start difference. First operand 376 states and 429 transitions. Second operand 16 states. [2018-04-10 16:27:51,679 WARN L151 SmtUtils]: Spent 199ms on a formula simplification. DAG size of input: 119 DAG size of output 112 [2018-04-10 16:27:52,033 WARN L151 SmtUtils]: Spent 296ms on a formula simplification. DAG size of input: 162 DAG size of output 120 Received shutdown request... [2018-04-10 16:28:12,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-10 16:28:12,124 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-10 16:28:12,129 WARN L197 ceAbstractionStarter]: Timeout [2018-04-10 16:28:12,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.04 04:28:12 BoogieIcfgContainer [2018-04-10 16:28:12,129 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-10 16:28:12,130 INFO L168 Benchmark]: Toolchain (without parser) took 198609.19 ms. Allocated memory was 403.2 MB in the beginning and 717.2 MB in the end (delta: 314.0 MB). Free memory was 338.6 MB in the beginning and 400.2 MB in the end (delta: -61.6 MB). Peak memory consumption was 252.4 MB. Max. memory is 5.3 GB. [2018-04-10 16:28:12,131 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 403.2 MB. Free memory is still 362.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-10 16:28:12,131 INFO L168 Benchmark]: CACSL2BoogieTranslator took 241.55 ms. Allocated memory is still 403.2 MB. Free memory was 337.3 MB in the beginning and 310.8 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 5.3 GB. [2018-04-10 16:28:12,131 INFO L168 Benchmark]: Boogie Preprocessor took 45.00 ms. Allocated memory is still 403.2 MB. Free memory was 310.8 MB in the beginning and 306.9 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. [2018-04-10 16:28:12,131 INFO L168 Benchmark]: RCFGBuilder took 507.83 ms. Allocated memory was 403.2 MB in the beginning and 592.4 MB in the end (delta: 189.3 MB). Free memory was 306.9 MB in the beginning and 507.7 MB in the end (delta: -200.8 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. [2018-04-10 16:28:12,132 INFO L168 Benchmark]: TraceAbstraction took 197812.11 ms. Allocated memory was 592.4 MB in the beginning and 717.2 MB in the end (delta: 124.8 MB). Free memory was 507.7 MB in the beginning and 400.2 MB in the end (delta: 107.5 MB). Peak memory consumption was 232.3 MB. Max. memory is 5.3 GB. [2018-04-10 16:28:12,133 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 403.2 MB. Free memory is still 362.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 241.55 ms. Allocated memory is still 403.2 MB. Free memory was 337.3 MB in the beginning and 310.8 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 45.00 ms. Allocated memory is still 403.2 MB. Free memory was 310.8 MB in the beginning and 306.9 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 507.83 ms. Allocated memory was 403.2 MB in the beginning and 592.4 MB in the end (delta: 189.3 MB). Free memory was 306.9 MB in the beginning and 507.7 MB in the end (delta: -200.8 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 197812.11 ms. Allocated memory was 592.4 MB in the beginning and 717.2 MB in the end (delta: 124.8 MB). Free memory was 507.7 MB in the beginning and 400.2 MB in the end (delta: 107.5 MB). Peak memory consumption was 232.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 998]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 1010]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1010). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 998]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 998]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 988). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 1007]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1007). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 1009]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1009). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 998]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 998]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 983]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 983). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 999]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 1009]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1009). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 998]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 1007]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1007). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 999]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 998]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 988). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 998]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 1009]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1009). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 1009]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1009). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 998]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 998]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 1010]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1010). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (376states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 184. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 158 locations, 69 error locations. TIMEOUT Result, 197.7s OverallTime, 39 OverallIterations, 2 TraceHistogramMax, 82.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4284 SDtfs, 14669 SDslu, 19086 SDs, 0 SdLazy, 22554 SolverSat, 1232 SolverUnsat, 82 SolverUnknown, 0 SolverNotchecked, 35.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1562 GetRequests, 804 SyntacticMatches, 14 SemanticMatches, 743 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3452 ImplicationChecksByTransitivity, 96.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=382occurred in iteration=37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 38 MinimizatonAttempts, 4704 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 113.4s InterpolantComputationTime, 2530 NumberOfCodeBlocks, 2530 NumberOfCodeBlocksAsserted, 64 NumberOfCheckSat, 1500 ConstructedInterpolants, 448 QuantifiedInterpolants, 3440770 SizeOfPredicates, 346 NumberOfNonLiveVariables, 4227 ConjunctsInSsa, 761 ConjunctsInUnsatCore, 41 InterpolantComputations, 25 PerfectInterpolantSequences, 37/86 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/dll-optional_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-10_16-28-12-141.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-optional_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-10_16-28-12-141.csv Completed graceful shutdown