java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-optional_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-408c70d-m [2018-04-12 18:45:13,681 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-12 18:45:13,682 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-12 18:45:13,693 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-12 18:45:13,694 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-12 18:45:13,694 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-12 18:45:13,695 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-12 18:45:13,696 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-12 18:45:13,697 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-12 18:45:13,698 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-12 18:45:13,699 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-12 18:45:13,699 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-12 18:45:13,700 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-12 18:45:13,700 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-12 18:45:13,701 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-12 18:45:13,703 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-12 18:45:13,705 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-12 18:45:13,706 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-12 18:45:13,707 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-12 18:45:13,708 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-12 18:45:13,710 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-12 18:45:13,710 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-12 18:45:13,710 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-12 18:45:13,711 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-12 18:45:13,712 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-12 18:45:13,713 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-12 18:45:13,713 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-12 18:45:13,713 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-12 18:45:13,714 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-12 18:45:13,714 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-12 18:45:13,715 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-12 18:45:13,715 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-04-12 18:45:13,725 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-12 18:45:13,725 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-12 18:45:13,726 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-12 18:45:13,726 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-12 18:45:13,726 INFO L133 SettingsManager]: * Use SBE=true [2018-04-12 18:45:13,726 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-12 18:45:13,726 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-12 18:45:13,726 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-12 18:45:13,727 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-12 18:45:13,727 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-12 18:45:13,727 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-12 18:45:13,727 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-12 18:45:13,727 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-12 18:45:13,727 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-12 18:45:13,727 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-12 18:45:13,728 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-12 18:45:13,728 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-12 18:45:13,728 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-12 18:45:13,728 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-12 18:45:13,728 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-12 18:45:13,728 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-12 18:45:13,728 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-12 18:45:13,729 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-12 18:45:13,729 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-12 18:45:13,756 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-12 18:45:13,764 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-12 18:45:13,768 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-12 18:45:13,769 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-12 18:45:13,769 INFO L276 PluginConnector]: CDTParser initialized [2018-04-12 18:45:13,770 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,062 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGb7de5350e [2018-04-12 18:45:14,205 INFO L287 CDTParser]: IsIndexed: true [2018-04-12 18:45:14,206 INFO L288 CDTParser]: Found 1 translation units. [2018-04-12 18:45:14,206 INFO L168 CDTParser]: Scanning sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,212 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-12 18:45:14,213 INFO L215 ultiparseSymbolTable]: [2018-04-12 18:45:14,213 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-12 18:45:14,213 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,213 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-12 18:45:14,213 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____fsblkcnt64_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,213 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____uint64_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,213 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____uid_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,213 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__ssize_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,213 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____fsword_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,214 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pthread_once_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,214 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pthread_attr_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,214 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__off_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,214 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____int8_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,214 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__timer_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,214 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__register_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,214 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____nlink_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,214 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____sig_atomic_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,214 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__u_int64_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,214 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__ino_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,214 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____useconds_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,214 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pthread_condattr_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,214 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__loff_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,214 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__wchar_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,214 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____fsfilcnt64_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,215 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____fd_mask in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,215 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__ldiv_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,215 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__u_int8_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,215 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pthread_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,215 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____int64_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,215 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____uint8_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,215 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____key_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,215 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____time_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,215 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____timer_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,215 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__int8_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,215 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____daddr_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,215 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____fsfilcnt_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,215 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pthread_mutexattr_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,215 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__fd_mask in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,215 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pthread_mutex_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,215 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__ushort in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,216 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____blkcnt_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,216 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____int32_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,216 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__clockid_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,216 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__time_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,216 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____pthread_slist_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,216 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____ssize_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,216 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__idtype_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,216 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____syscall_slong_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,216 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__key_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,216 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__uint in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,216 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__id_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,217 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__int32_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,217 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pthread_rwlock_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,217 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____u_int in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,217 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____off_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,217 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____blkcnt64_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,217 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__nlink_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,217 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__fsfilcnt_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,217 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__dev_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,217 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pthread_rwlockattr_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,217 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____ino64_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,217 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__sigset_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,218 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__u_int32_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,218 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__u_quad_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,218 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__ulong in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,218 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__u_char in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,218 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____caddr_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,218 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__blkcnt_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,218 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pthread_key_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,218 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pthread_barrierattr_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,218 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__lldiv_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,218 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____dev_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,218 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____fsblkcnt_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__uid_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__int16_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____uint16_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__daddr_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____id_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____syscall_ulong_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____gid_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____blksize_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__fsblkcnt_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____u_char in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,220 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____off64_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,220 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____suseconds_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,220 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____quad_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,220 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____qaddr_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,220 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__u_int in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,220 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____rlim64_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,220 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____pid_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,220 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____u_short in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,220 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__int64_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,220 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____sigset_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,220 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__suseconds_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,220 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pthread_cond_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,220 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____loff_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,221 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____rlim_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,221 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__size_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,221 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__fsid_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,221 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__u_int16_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,221 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____u_quad_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,221 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____clock_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,221 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____intptr_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,221 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____clockid_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,221 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__u_long in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,221 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pthread_barrier_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,221 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__quad_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,221 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__mode_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,222 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____socklen_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,222 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____uint32_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,222 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pid_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,222 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__clock_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,222 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__fd_set in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,222 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__gid_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,222 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____fsid_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,222 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____int16_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,222 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__div_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,222 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__SLL in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,222 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____u_long in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,222 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__u_short in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,223 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pthread_spinlock_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,223 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__caddr_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,223 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____mode_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,223 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__blksize_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,223 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____ino_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:14,236 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGb7de5350e [2018-04-12 18:45:14,239 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-12 18:45:14,240 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-12 18:45:14,241 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-12 18:45:14,241 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-12 18:45:14,245 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-12 18:45:14,246 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 06:45:14" (1/1) ... [2018-04-12 18:45:14,248 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dd0e1f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:45:14, skipping insertion in model container [2018-04-12 18:45:14,248 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 06:45:14" (1/1) ... [2018-04-12 18:45:14,259 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 18:45:14,286 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 18:45:14,430 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 18:45:14,468 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 18:45:14,474 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 115 non ball SCCs. Number of states in SCCs 115. [2018-04-12 18:45:14,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:45:14 WrapperNode [2018-04-12 18:45:14,511 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-12 18:45:14,512 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-12 18:45:14,512 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-12 18:45:14,512 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-12 18:45:14,522 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:45:14" (1/1) ... [2018-04-12 18:45:14,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:45:14" (1/1) ... [2018-04-12 18:45:14,534 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:45:14" (1/1) ... [2018-04-12 18:45:14,535 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:45:14" (1/1) ... [2018-04-12 18:45:14,543 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:45:14" (1/1) ... [2018-04-12 18:45:14,548 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:45:14" (1/1) ... [2018-04-12 18:45:14,550 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:45:14" (1/1) ... [2018-04-12 18:45:14,554 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-12 18:45:14,554 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-12 18:45:14,554 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-12 18:45:14,555 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-12 18:45:14,555 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:45:14" (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-12 18:45:14,655 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-12 18:45:14,655 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-12 18:45:14,655 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-12 18:45:14,655 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-12 18:45:14,655 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-12 18:45:14,655 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-12 18:45:14,655 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-12 18:45:14,655 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-12 18:45:14,655 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-12 18:45:14,655 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-12 18:45:14,655 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-12 18:45:14,655 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-12 18:45:14,656 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-12 18:45:14,656 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-12 18:45:14,656 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-12 18:45:14,656 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-12 18:45:14,656 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-12 18:45:14,656 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-12 18:45:14,656 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-12 18:45:14,656 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-12 18:45:14,657 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-12 18:45:14,657 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-12 18:45:14,657 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-12 18:45:14,657 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-12 18:45:14,657 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-12 18:45:14,657 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-12 18:45:14,657 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-12 18:45:14,657 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-12 18:45:14,657 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-12 18:45:14,658 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-12 18:45:14,658 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-12 18:45:14,658 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-12 18:45:14,658 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-12 18:45:14,658 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-12 18:45:14,658 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-12 18:45:14,658 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-12 18:45:14,658 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-12 18:45:14,658 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-12 18:45:14,659 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-12 18:45:14,659 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-12 18:45:14,659 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-12 18:45:14,659 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-12 18:45:14,659 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-12 18:45:14,659 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-12 18:45:14,659 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-12 18:45:14,659 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-12 18:45:14,659 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-12 18:45:14,659 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-12 18:45:14,660 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-12 18:45:14,660 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-12 18:45:14,660 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-12 18:45:14,660 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-12 18:45:14,660 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-12 18:45:14,660 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-12 18:45:14,660 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-12 18:45:14,660 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-12 18:45:14,660 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-12 18:45:14,660 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-12 18:45:14,661 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-12 18:45:14,661 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-12 18:45:14,661 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-12 18:45:14,661 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-12 18:45:14,661 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-12 18:45:14,661 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-12 18:45:14,661 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-12 18:45:14,661 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-12 18:45:14,661 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-12 18:45:14,661 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-12 18:45:14,661 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-12 18:45:14,662 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-12 18:45:14,662 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-12 18:45:14,662 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-12 18:45:14,662 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-12 18:45:14,662 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-12 18:45:14,662 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-12 18:45:14,662 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-12 18:45:14,662 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-12 18:45:14,662 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-12 18:45:14,662 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-12 18:45:14,663 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-12 18:45:14,663 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-12 18:45:14,663 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-12 18:45:14,663 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-12 18:45:14,663 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-12 18:45:14,663 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-12 18:45:14,663 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-12 18:45:14,663 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-12 18:45:14,663 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-12 18:45:14,663 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-12 18:45:14,663 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-12 18:45:14,664 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-12 18:45:14,664 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-12 18:45:14,664 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-12 18:45:14,664 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-12 18:45:14,664 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-12 18:45:14,664 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-12 18:45:14,664 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-12 18:45:14,664 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-12 18:45:14,664 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-12 18:45:14,664 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-12 18:45:14,664 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-12 18:45:14,665 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-12 18:45:14,665 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-12 18:45:14,665 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-12 18:45:14,665 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-12 18:45:14,665 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-12 18:45:14,665 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-12 18:45:14,665 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-12 18:45:14,665 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-12 18:45:14,665 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-12 18:45:14,665 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-12 18:45:14,665 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-12 18:45:14,666 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-12 18:45:14,666 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-12 18:45:14,666 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-12 18:45:14,666 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-12 18:45:14,666 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-12 18:45:14,666 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-12 18:45:15,082 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-12 18:45:15,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 06:45:15 BoogieIcfgContainer [2018-04-12 18:45:15,082 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-12 18:45:15,083 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-12 18:45:15,083 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-12 18:45:15,085 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-12 18:45:15,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.04 06:45:14" (1/3) ... [2018-04-12 18:45:15,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a8a03b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 06:45:15, skipping insertion in model container [2018-04-12 18:45:15,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:45:14" (2/3) ... [2018-04-12 18:45:15,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a8a03b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 06:45:15, skipping insertion in model container [2018-04-12 18:45:15,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 06:45:15" (3/3) ... [2018-04-12 18:45:15,087 INFO L107 eAbstractionObserver]: Analyzing ICFG sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:45:15,093 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-12 18:45:15,098 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 63 error locations. [2018-04-12 18:45:15,128 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-12 18:45:15,129 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-12 18:45:15,129 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-12 18:45:15,129 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-12 18:45:15,129 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-12 18:45:15,129 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-12 18:45:15,129 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-12 18:45:15,129 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-12 18:45:15,130 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-12 18:45:15,130 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-12 18:45:15,143 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2018-04-12 18:45:15,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-12 18:45:15,150 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:45:15,151 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:45:15,151 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:45:15,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1599603740, now seen corresponding path program 1 times [2018-04-12 18:45:15,154 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:45:15,155 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:45:15,186 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:15,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:45:15,186 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:15,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:45:15,219 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:45:15,258 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-12 18:45:15,260 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:45:15,260 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 18:45:15,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 18:45:15,274 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 18:45:15,274 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 18:45:15,277 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2018-04-12 18:45:15,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:45:15,473 INFO L93 Difference]: Finished difference Result 168 states and 180 transitions. [2018-04-12 18:45:15,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 18:45:15,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-12 18:45:15,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:45:15,485 INFO L225 Difference]: With dead ends: 168 [2018-04-12 18:45:15,485 INFO L226 Difference]: Without dead ends: 164 [2018-04-12 18:45:15,487 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-12 18:45:15,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-04-12 18:45:15,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 138. [2018-04-12 18:45:15,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-04-12 18:45:15,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 149 transitions. [2018-04-12 18:45:15,523 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 149 transitions. Word has length 8 [2018-04-12 18:45:15,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:45:15,523 INFO L459 AbstractCegarLoop]: Abstraction has 138 states and 149 transitions. [2018-04-12 18:45:15,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 18:45:15,524 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2018-04-12 18:45:15,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-12 18:45:15,524 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:45:15,524 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:45:15,524 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:45:15,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1599603741, now seen corresponding path program 1 times [2018-04-12 18:45:15,525 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:45:15,525 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:45:15,526 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:15,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:45:15,526 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:15,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:45:15,538 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:45:15,572 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-12 18:45:15,572 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:45:15,573 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 18:45:15,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 18:45:15,574 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 18:45:15,574 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 18:45:15,574 INFO L87 Difference]: Start difference. First operand 138 states and 149 transitions. Second operand 4 states. [2018-04-12 18:45:15,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:45:15,687 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2018-04-12 18:45:15,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 18:45:15,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-12 18:45:15,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:45:15,688 INFO L225 Difference]: With dead ends: 135 [2018-04-12 18:45:15,688 INFO L226 Difference]: Without dead ends: 135 [2018-04-12 18:45:15,689 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-12 18:45:15,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-04-12 18:45:15,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 130. [2018-04-12 18:45:15,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-04-12 18:45:15,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 141 transitions. [2018-04-12 18:45:15,695 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 141 transitions. Word has length 8 [2018-04-12 18:45:15,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:45:15,696 INFO L459 AbstractCegarLoop]: Abstraction has 130 states and 141 transitions. [2018-04-12 18:45:15,696 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 18:45:15,696 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 141 transitions. [2018-04-12 18:45:15,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-12 18:45:15,696 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:45:15,696 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:45:15,697 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:45:15,697 INFO L82 PathProgramCache]: Analyzing trace with hash 723052242, now seen corresponding path program 1 times [2018-04-12 18:45:15,697 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:45:15,697 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:45:15,698 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:15,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:45:15,698 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:15,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:45:15,712 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:45:15,741 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-12 18:45:15,742 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:45:15,742 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 18:45:15,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 18:45:15,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 18:45:15,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 18:45:15,742 INFO L87 Difference]: Start difference. First operand 130 states and 141 transitions. Second operand 5 states. [2018-04-12 18:45:15,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:45:15,959 INFO L93 Difference]: Finished difference Result 279 states and 303 transitions. [2018-04-12 18:45:15,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-12 18:45:15,960 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-04-12 18:45:15,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:45:15,963 INFO L225 Difference]: With dead ends: 279 [2018-04-12 18:45:15,963 INFO L226 Difference]: Without dead ends: 279 [2018-04-12 18:45:15,963 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-12 18:45:15,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-04-12 18:45:15,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 129. [2018-04-12 18:45:15,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-12 18:45:15,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 140 transitions. [2018-04-12 18:45:15,970 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 140 transitions. Word has length 15 [2018-04-12 18:45:15,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:45:15,970 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 140 transitions. [2018-04-12 18:45:15,971 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 18:45:15,971 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 140 transitions. [2018-04-12 18:45:15,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-12 18:45:15,971 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:45:15,971 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:45:15,971 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:45:15,972 INFO L82 PathProgramCache]: Analyzing trace with hash 723052243, now seen corresponding path program 1 times [2018-04-12 18:45:15,972 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:45:15,972 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:45:15,973 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:15,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:45:15,974 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:15,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:45:15,987 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:45:16,029 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-12 18:45:16,030 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:45:16,030 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 18:45:16,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 18:45:16,030 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 18:45:16,030 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 18:45:16,031 INFO L87 Difference]: Start difference. First operand 129 states and 140 transitions. Second operand 5 states. [2018-04-12 18:45:16,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:45:16,215 INFO L93 Difference]: Finished difference Result 235 states and 255 transitions. [2018-04-12 18:45:16,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 18:45:16,216 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-04-12 18:45:16,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:45:16,216 INFO L225 Difference]: With dead ends: 235 [2018-04-12 18:45:16,217 INFO L226 Difference]: Without dead ends: 235 [2018-04-12 18:45:16,217 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-12 18:45:16,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-04-12 18:45:16,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 128. [2018-04-12 18:45:16,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-12 18:45:16,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 139 transitions. [2018-04-12 18:45:16,223 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 139 transitions. Word has length 15 [2018-04-12 18:45:16,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:45:16,223 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 139 transitions. [2018-04-12 18:45:16,223 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 18:45:16,223 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 139 transitions. [2018-04-12 18:45:16,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-12 18:45:16,224 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:45:16,224 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:45:16,224 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:45:16,224 INFO L82 PathProgramCache]: Analyzing trace with hash 863312645, now seen corresponding path program 1 times [2018-04-12 18:45:16,224 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:45:16,224 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:45:16,226 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:16,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:45:16,226 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:16,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:45:16,237 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:45:16,261 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-12 18:45:16,262 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:45:16,262 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 18:45:16,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 18:45:16,262 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 18:45:16,262 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 18:45:16,262 INFO L87 Difference]: Start difference. First operand 128 states and 139 transitions. Second operand 4 states. [2018-04-12 18:45:16,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:45:16,343 INFO L93 Difference]: Finished difference Result 133 states and 144 transitions. [2018-04-12 18:45:16,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 18:45:16,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-04-12 18:45:16,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:45:16,344 INFO L225 Difference]: With dead ends: 133 [2018-04-12 18:45:16,344 INFO L226 Difference]: Without dead ends: 133 [2018-04-12 18:45:16,344 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-12 18:45:16,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-04-12 18:45:16,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 124. [2018-04-12 18:45:16,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-04-12 18:45:16,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 140 transitions. [2018-04-12 18:45:16,349 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 140 transitions. Word has length 19 [2018-04-12 18:45:16,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:45:16,349 INFO L459 AbstractCegarLoop]: Abstraction has 124 states and 140 transitions. [2018-04-12 18:45:16,349 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 18:45:16,350 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 140 transitions. [2018-04-12 18:45:16,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-12 18:45:16,350 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:45:16,350 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:45:16,350 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:45:16,350 INFO L82 PathProgramCache]: Analyzing trace with hash 863312646, now seen corresponding path program 1 times [2018-04-12 18:45:16,351 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:45:16,351 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:45:16,352 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:16,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:45:16,352 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:16,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:45:16,360 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:45:16,405 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-12 18:45:16,405 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:45:16,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-12 18:45:16,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-12 18:45:16,405 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-12 18:45:16,405 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-04-12 18:45:16,406 INFO L87 Difference]: Start difference. First operand 124 states and 140 transitions. Second operand 7 states. [2018-04-12 18:45:16,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:45:16,601 INFO L93 Difference]: Finished difference Result 175 states and 192 transitions. [2018-04-12 18:45:16,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 18:45:16,601 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-04-12 18:45:16,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:45:16,602 INFO L225 Difference]: With dead ends: 175 [2018-04-12 18:45:16,602 INFO L226 Difference]: Without dead ends: 175 [2018-04-12 18:45:16,602 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-04-12 18:45:16,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-04-12 18:45:16,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 154. [2018-04-12 18:45:16,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-04-12 18:45:16,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 176 transitions. [2018-04-12 18:45:16,605 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 176 transitions. Word has length 19 [2018-04-12 18:45:16,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:45:16,605 INFO L459 AbstractCegarLoop]: Abstraction has 154 states and 176 transitions. [2018-04-12 18:45:16,606 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-12 18:45:16,606 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 176 transitions. [2018-04-12 18:45:16,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-12 18:45:16,606 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:45:16,606 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-12 18:45:16,611 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:45:16,611 INFO L82 PathProgramCache]: Analyzing trace with hash 682869627, now seen corresponding path program 1 times [2018-04-12 18:45:16,611 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:45:16,611 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:45:16,612 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:16,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:45:16,612 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:16,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:45:16,620 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:45:16,656 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-12 18:45:16,656 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:45:16,656 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-12 18:45:16,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 18:45:16,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 18:45:16,656 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-12 18:45:16,657 INFO L87 Difference]: Start difference. First operand 154 states and 176 transitions. Second operand 6 states. [2018-04-12 18:45:16,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:45:16,829 INFO L93 Difference]: Finished difference Result 222 states and 255 transitions. [2018-04-12 18:45:16,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-12 18:45:16,829 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-04-12 18:45:16,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:45:16,830 INFO L225 Difference]: With dead ends: 222 [2018-04-12 18:45:16,830 INFO L226 Difference]: Without dead ends: 222 [2018-04-12 18:45:16,830 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-04-12 18:45:16,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-04-12 18:45:16,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 153. [2018-04-12 18:45:16,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-04-12 18:45:16,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 175 transitions. [2018-04-12 18:45:16,845 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 175 transitions. Word has length 22 [2018-04-12 18:45:16,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:45:16,845 INFO L459 AbstractCegarLoop]: Abstraction has 153 states and 175 transitions. [2018-04-12 18:45:16,845 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 18:45:16,845 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 175 transitions. [2018-04-12 18:45:16,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-12 18:45:16,846 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:45:16,846 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-12 18:45:16,846 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:45:16,846 INFO L82 PathProgramCache]: Analyzing trace with hash 682869628, now seen corresponding path program 1 times [2018-04-12 18:45:16,846 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:45:16,846 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:45:16,848 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:16,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:45:16,848 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:16,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:45:16,858 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:45:16,893 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-12 18:45:16,893 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:45:16,894 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-12 18:45:16,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 18:45:16,894 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 18:45:16,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-12 18:45:16,894 INFO L87 Difference]: Start difference. First operand 153 states and 175 transitions. Second operand 6 states. [2018-04-12 18:45:17,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:45:17,136 INFO L93 Difference]: Finished difference Result 236 states and 274 transitions. [2018-04-12 18:45:17,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-12 18:45:17,136 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-04-12 18:45:17,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:45:17,138 INFO L225 Difference]: With dead ends: 236 [2018-04-12 18:45:17,138 INFO L226 Difference]: Without dead ends: 236 [2018-04-12 18:45:17,138 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-04-12 18:45:17,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-04-12 18:45:17,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 137. [2018-04-12 18:45:17,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-04-12 18:45:17,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 158 transitions. [2018-04-12 18:45:17,141 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 158 transitions. Word has length 22 [2018-04-12 18:45:17,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:45:17,142 INFO L459 AbstractCegarLoop]: Abstraction has 137 states and 158 transitions. [2018-04-12 18:45:17,142 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 18:45:17,142 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 158 transitions. [2018-04-12 18:45:17,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-12 18:45:17,142 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:45:17,142 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] [2018-04-12 18:45:17,143 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:45:17,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1146686030, now seen corresponding path program 1 times [2018-04-12 18:45:17,143 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:45:17,143 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:45:17,144 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:17,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:45:17,144 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:17,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:45:17,151 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:45:17,173 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-12 18:45:17,174 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:45:17,174 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-12 18:45:17,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 18:45:17,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 18:45:17,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 18:45:17,174 INFO L87 Difference]: Start difference. First operand 137 states and 158 transitions. Second operand 5 states. [2018-04-12 18:45:17,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:45:17,264 INFO L93 Difference]: Finished difference Result 158 states and 175 transitions. [2018-04-12 18:45:17,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 18:45:17,264 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-04-12 18:45:17,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:45:17,265 INFO L225 Difference]: With dead ends: 158 [2018-04-12 18:45:17,265 INFO L226 Difference]: Without dead ends: 158 [2018-04-12 18:45:17,265 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-12 18:45:17,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-04-12 18:45:17,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 137. [2018-04-12 18:45:17,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-04-12 18:45:17,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 156 transitions. [2018-04-12 18:45:17,269 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 156 transitions. Word has length 25 [2018-04-12 18:45:17,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:45:17,269 INFO L459 AbstractCegarLoop]: Abstraction has 137 states and 156 transitions. [2018-04-12 18:45:17,269 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 18:45:17,269 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 156 transitions. [2018-04-12 18:45:17,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-12 18:45:17,270 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:45:17,270 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:45:17,270 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:45:17,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1880164707, now seen corresponding path program 1 times [2018-04-12 18:45:17,270 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:45:17,270 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:45:17,272 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:17,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:45:17,272 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:17,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:45:17,289 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:45:17,305 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-12 18:45:17,305 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:45:17,305 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 18:45:17,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 18:45:17,305 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 18:45:17,306 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 18:45:17,306 INFO L87 Difference]: Start difference. First operand 137 states and 156 transitions. Second operand 4 states. [2018-04-12 18:45:17,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:45:17,335 INFO L93 Difference]: Finished difference Result 163 states and 186 transitions. [2018-04-12 18:45:17,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 18:45:17,335 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-04-12 18:45:17,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:45:17,336 INFO L225 Difference]: With dead ends: 163 [2018-04-12 18:45:17,336 INFO L226 Difference]: Without dead ends: 163 [2018-04-12 18:45:17,337 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-12 18:45:17,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-04-12 18:45:17,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 141. [2018-04-12 18:45:17,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-04-12 18:45:17,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 160 transitions. [2018-04-12 18:45:17,340 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 160 transitions. Word has length 28 [2018-04-12 18:45:17,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:45:17,340 INFO L459 AbstractCegarLoop]: Abstraction has 141 states and 160 transitions. [2018-04-12 18:45:17,340 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 18:45:17,340 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 160 transitions. [2018-04-12 18:45:17,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-12 18:45:17,341 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:45:17,341 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-12 18:45:17,341 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:45:17,341 INFO L82 PathProgramCache]: Analyzing trace with hash -925635600, now seen corresponding path program 1 times [2018-04-12 18:45:17,341 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:45:17,341 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:45:17,342 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:17,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:45:17,342 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:17,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:45:17,352 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:45:17,386 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-12 18:45:17,386 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:45:17,386 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 18:45:17,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 18:45:17,387 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 18:45:17,387 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 18:45:17,387 INFO L87 Difference]: Start difference. First operand 141 states and 160 transitions. Second operand 5 states. [2018-04-12 18:45:17,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:45:17,605 INFO L93 Difference]: Finished difference Result 243 states and 277 transitions. [2018-04-12 18:45:17,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-12 18:45:17,606 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-12 18:45:17,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:45:17,607 INFO L225 Difference]: With dead ends: 243 [2018-04-12 18:45:17,607 INFO L226 Difference]: Without dead ends: 243 [2018-04-12 18:45:17,607 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-12 18:45:17,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-04-12 18:45:17,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 140. [2018-04-12 18:45:17,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-04-12 18:45:17,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 159 transitions. [2018-04-12 18:45:17,610 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 159 transitions. Word has length 29 [2018-04-12 18:45:17,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:45:17,611 INFO L459 AbstractCegarLoop]: Abstraction has 140 states and 159 transitions. [2018-04-12 18:45:17,611 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 18:45:17,611 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 159 transitions. [2018-04-12 18:45:17,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-12 18:45:17,612 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:45:17,612 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-12 18:45:17,612 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:45:17,612 INFO L82 PathProgramCache]: Analyzing trace with hash -925635599, now seen corresponding path program 1 times [2018-04-12 18:45:17,612 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:45:17,612 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:45:17,613 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:17,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:45:17,613 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:17,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:45:17,622 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:45:17,653 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-12 18:45:17,653 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:45:17,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 18:45:17,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 18:45:17,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 18:45:17,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 18:45:17,654 INFO L87 Difference]: Start difference. First operand 140 states and 159 transitions. Second operand 5 states. [2018-04-12 18:45:17,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:45:17,834 INFO L93 Difference]: Finished difference Result 252 states and 288 transitions. [2018-04-12 18:45:17,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 18:45:17,835 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-12 18:45:17,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:45:17,835 INFO L225 Difference]: With dead ends: 252 [2018-04-12 18:45:17,835 INFO L226 Difference]: Without dead ends: 252 [2018-04-12 18:45:17,836 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-12 18:45:17,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-04-12 18:45:17,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 139. [2018-04-12 18:45:17,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-04-12 18:45:17,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 158 transitions. [2018-04-12 18:45:17,839 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 158 transitions. Word has length 29 [2018-04-12 18:45:17,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:45:17,839 INFO L459 AbstractCegarLoop]: Abstraction has 139 states and 158 transitions. [2018-04-12 18:45:17,839 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 18:45:17,839 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 158 transitions. [2018-04-12 18:45:17,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-12 18:45:17,840 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:45:17,840 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:45:17,840 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:45:17,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1714976192, now seen corresponding path program 1 times [2018-04-12 18:45:17,840 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:45:17,840 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:45:17,841 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:17,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:45:17,842 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:17,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:45:17,849 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:45:17,995 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-12 18:45:17,995 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:45:17,995 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-12 18:45:17,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-12 18:45:17,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-12 18:45:17,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-04-12 18:45:17,999 INFO L87 Difference]: Start difference. First operand 139 states and 158 transitions. Second operand 10 states. [2018-04-12 18:45:18,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:45:18,360 INFO L93 Difference]: Finished difference Result 249 states and 282 transitions. [2018-04-12 18:45:18,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-12 18:45:18,360 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-04-12 18:45:18,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:45:18,361 INFO L225 Difference]: With dead ends: 249 [2018-04-12 18:45:18,361 INFO L226 Difference]: Without dead ends: 249 [2018-04-12 18:45:18,361 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2018-04-12 18:45:18,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-04-12 18:45:18,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 156. [2018-04-12 18:45:18,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-04-12 18:45:18,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 179 transitions. [2018-04-12 18:45:18,363 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 179 transitions. Word has length 30 [2018-04-12 18:45:18,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:45:18,364 INFO L459 AbstractCegarLoop]: Abstraction has 156 states and 179 transitions. [2018-04-12 18:45:18,364 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-12 18:45:18,364 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 179 transitions. [2018-04-12 18:45:18,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-12 18:45:18,364 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:45:18,364 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:45:18,364 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:45:18,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1714976193, now seen corresponding path program 1 times [2018-04-12 18:45:18,364 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:45:18,364 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:45:18,365 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:18,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:45:18,365 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:18,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:45:18,370 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:45:18,449 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-12 18:45:18,450 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:45:18,450 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-12 18:45:18,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-12 18:45:18,450 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-12 18:45:18,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-04-12 18:45:18,450 INFO L87 Difference]: Start difference. First operand 156 states and 179 transitions. Second operand 9 states. [2018-04-12 18:45:18,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:45:18,719 INFO L93 Difference]: Finished difference Result 230 states and 258 transitions. [2018-04-12 18:45:18,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-12 18:45:18,719 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-04-12 18:45:18,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:45:18,719 INFO L225 Difference]: With dead ends: 230 [2018-04-12 18:45:18,720 INFO L226 Difference]: Without dead ends: 230 [2018-04-12 18:45:18,720 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2018-04-12 18:45:18,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-04-12 18:45:18,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 152. [2018-04-12 18:45:18,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-04-12 18:45:18,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 173 transitions. [2018-04-12 18:45:18,722 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 173 transitions. Word has length 30 [2018-04-12 18:45:18,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:45:18,722 INFO L459 AbstractCegarLoop]: Abstraction has 152 states and 173 transitions. [2018-04-12 18:45:18,722 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-12 18:45:18,722 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 173 transitions. [2018-04-12 18:45:18,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-12 18:45:18,722 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:45:18,722 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-12 18:45:18,722 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:45:18,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1951010669, now seen corresponding path program 1 times [2018-04-12 18:45:18,723 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:45:18,723 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:45:18,723 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:18,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:45:18,723 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:18,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:45:18,729 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:45:18,842 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-12 18:45:18,842 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:45:18,842 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-12 18:45:18,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-12 18:45:18,842 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-12 18:45:18,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-04-12 18:45:18,843 INFO L87 Difference]: Start difference. First operand 152 states and 173 transitions. Second operand 11 states. [2018-04-12 18:45:19,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:45:19,255 INFO L93 Difference]: Finished difference Result 400 states and 454 transitions. [2018-04-12 18:45:19,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-12 18:45:19,255 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2018-04-12 18:45:19,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:45:19,256 INFO L225 Difference]: With dead ends: 400 [2018-04-12 18:45:19,256 INFO L226 Difference]: Without dead ends: 400 [2018-04-12 18:45:19,256 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=196, Invalid=454, Unknown=0, NotChecked=0, Total=650 [2018-04-12 18:45:19,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2018-04-12 18:45:19,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 168. [2018-04-12 18:45:19,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-12 18:45:19,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 193 transitions. [2018-04-12 18:45:19,260 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 193 transitions. Word has length 33 [2018-04-12 18:45:19,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:45:19,260 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 193 transitions. [2018-04-12 18:45:19,260 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-12 18:45:19,260 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 193 transitions. [2018-04-12 18:45:19,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-12 18:45:19,260 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:45:19,261 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-12 18:45:19,261 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:45:19,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1951010668, now seen corresponding path program 1 times [2018-04-12 18:45:19,261 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:45:19,261 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:45:19,262 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:19,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:45:19,262 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:19,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:45:19,271 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:45:19,354 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-12 18:45:19,354 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:45:19,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-12 18:45:19,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-12 18:45:19,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-12 18:45:19,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-12 18:45:19,355 INFO L87 Difference]: Start difference. First operand 168 states and 193 transitions. Second operand 9 states. [2018-04-12 18:45:19,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:45:19,849 INFO L93 Difference]: Finished difference Result 325 states and 367 transitions. [2018-04-12 18:45:19,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-12 18:45:19,850 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-04-12 18:45:19,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:45:19,851 INFO L225 Difference]: With dead ends: 325 [2018-04-12 18:45:19,851 INFO L226 Difference]: Without dead ends: 325 [2018-04-12 18:45:19,851 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-04-12 18:45:19,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-04-12 18:45:19,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 168. [2018-04-12 18:45:19,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-12 18:45:19,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 192 transitions. [2018-04-12 18:45:19,856 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 192 transitions. Word has length 33 [2018-04-12 18:45:19,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:45:19,856 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 192 transitions. [2018-04-12 18:45:19,856 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-12 18:45:19,856 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 192 transitions. [2018-04-12 18:45:19,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-12 18:45:19,857 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:45:19,857 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] [2018-04-12 18:45:19,857 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:45:19,857 INFO L82 PathProgramCache]: Analyzing trace with hash -594222086, now seen corresponding path program 1 times [2018-04-12 18:45:19,857 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:45:19,857 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:45:19,858 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:19,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:45:19,859 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:19,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:45:19,866 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:45:19,879 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-12 18:45:19,880 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:45:19,880 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 18:45:19,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 18:45:19,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 18:45:19,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 18:45:19,880 INFO L87 Difference]: Start difference. First operand 168 states and 192 transitions. Second operand 4 states. [2018-04-12 18:45:19,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:45:19,890 INFO L93 Difference]: Finished difference Result 179 states and 203 transitions. [2018-04-12 18:45:19,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 18:45:19,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-04-12 18:45:19,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:45:19,891 INFO L225 Difference]: With dead ends: 179 [2018-04-12 18:45:19,891 INFO L226 Difference]: Without dead ends: 179 [2018-04-12 18:45:19,891 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-12 18:45:19,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-04-12 18:45:19,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 172. [2018-04-12 18:45:19,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-04-12 18:45:19,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 196 transitions. [2018-04-12 18:45:19,894 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 196 transitions. Word has length 36 [2018-04-12 18:45:19,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:45:19,894 INFO L459 AbstractCegarLoop]: Abstraction has 172 states and 196 transitions. [2018-04-12 18:45:19,894 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 18:45:19,894 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 196 transitions. [2018-04-12 18:45:19,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-12 18:45:19,895 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:45:19,895 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] [2018-04-12 18:45:19,895 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:45:19,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1495087999, now seen corresponding path program 1 times [2018-04-12 18:45:19,895 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:45:19,896 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:45:19,896 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:19,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:45:19,896 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:19,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:45:19,903 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:45:19,951 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-12 18:45:19,951 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:45:19,951 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 18:45:19,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:45:19,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:45:19,990 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:45:20,046 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-12 18:45:20,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:45:20,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:20,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:20,057 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-12 18:45:20,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:45:20,059 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:20,061 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:20,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:20,067 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:18 [2018-04-12 18:45:20,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12 18:45:20,095 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:20,097 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-12 18:45:20,098 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:20,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:20,113 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-12 18:45:20,116 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:20,117 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-12 18:45:20,117 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:20,121 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:20,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:20,131 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-04-12 18:45:20,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-04-12 18:45:20,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-04-12 18:45:20,187 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:20,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:20,196 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 22 treesize of output 16 [2018-04-12 18:45:20,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-04-12 18:45:20,199 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:20,200 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:20,203 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-12 18:45:20,204 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2018-04-12 18:45:20,224 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-12 18:45:20,243 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:45:20,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 11 [2018-04-12 18:45:20,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-12 18:45:20,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-12 18:45:20,244 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-04-12 18:45:20,244 INFO L87 Difference]: Start difference. First operand 172 states and 196 transitions. Second operand 11 states. [2018-04-12 18:45:20,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:45:20,601 INFO L93 Difference]: Finished difference Result 253 states and 280 transitions. [2018-04-12 18:45:20,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-12 18:45:20,602 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-04-12 18:45:20,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:45:20,602 INFO L225 Difference]: With dead ends: 253 [2018-04-12 18:45:20,602 INFO L226 Difference]: Without dead ends: 253 [2018-04-12 18:45:20,603 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2018-04-12 18:45:20,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-04-12 18:45:20,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 187. [2018-04-12 18:45:20,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-04-12 18:45:20,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 212 transitions. [2018-04-12 18:45:20,605 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 212 transitions. Word has length 38 [2018-04-12 18:45:20,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:45:20,605 INFO L459 AbstractCegarLoop]: Abstraction has 187 states and 212 transitions. [2018-04-12 18:45:20,605 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-12 18:45:20,605 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 212 transitions. [2018-04-12 18:45:20,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-12 18:45:20,606 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:45:20,606 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:45:20,606 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:45:20,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1591086459, now seen corresponding path program 1 times [2018-04-12 18:45:20,606 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:45:20,606 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:45:20,607 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:20,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:45:20,607 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:20,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:45:20,614 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:45:20,712 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-12 18:45:20,712 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:45:20,712 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 18:45:20,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:45:20,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:45:20,745 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:45:20,784 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-12 18:45:20,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:45:20,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:20,787 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:20,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:20,790 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-04-12 18:45:20,811 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:20,812 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:20,812 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-12 18:45:20,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:20,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:20,816 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-04-12 18:45:20,832 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-12 18:45:20,835 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-12 18:45:20,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:20,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:20,841 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-12 18:45:20,841 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-12 18:45:20,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-12 18:45:20,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-12 18:45:20,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:20,876 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:20,881 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-12 18:45:20,881 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-04-12 18:45:20,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-04-12 18:45:20,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:45:20,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:20,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:20,941 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-12 18:45:20,941 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-04-12 18:45:21,004 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-12 18:45:21,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-12 18:45:21,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:21,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-12 18:45:21,013 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:21,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:21,017 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-12 18:45:21,018 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2018-04-12 18:45:21,037 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-12 18:45:21,064 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:45:21,064 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 22 [2018-04-12 18:45:21,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-12 18:45:21,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-12 18:45:21,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2018-04-12 18:45:21,065 INFO L87 Difference]: Start difference. First operand 187 states and 212 transitions. Second operand 22 states. [2018-04-12 18:45:22,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:45:22,249 INFO L93 Difference]: Finished difference Result 444 states and 486 transitions. [2018-04-12 18:45:22,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-12 18:45:22,249 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 43 [2018-04-12 18:45:22,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:45:22,250 INFO L225 Difference]: With dead ends: 444 [2018-04-12 18:45:22,250 INFO L226 Difference]: Without dead ends: 444 [2018-04-12 18:45:22,250 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 809 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=785, Invalid=2407, Unknown=0, NotChecked=0, Total=3192 [2018-04-12 18:45:22,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-04-12 18:45:22,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 226. [2018-04-12 18:45:22,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-04-12 18:45:22,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 255 transitions. [2018-04-12 18:45:22,256 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 255 transitions. Word has length 43 [2018-04-12 18:45:22,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:45:22,256 INFO L459 AbstractCegarLoop]: Abstraction has 226 states and 255 transitions. [2018-04-12 18:45:22,256 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-12 18:45:22,256 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 255 transitions. [2018-04-12 18:45:22,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-12 18:45:22,256 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:45:22,257 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:45:22,257 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:45:22,257 INFO L82 PathProgramCache]: Analyzing trace with hash -912010883, now seen corresponding path program 1 times [2018-04-12 18:45:22,257 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:45:22,257 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:45:22,258 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:22,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:45:22,258 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:22,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:45:22,268 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:45:22,364 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-12 18:45:22,364 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:45:22,365 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 18:45:22,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:45:22,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:45:22,402 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:45:22,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 18:45:22,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-12 18:45:22,449 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:22,451 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:22,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:22,456 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-04-12 18:45:22,476 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:22,477 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:22,478 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-12 18:45:22,478 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:22,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:22,482 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-04-12 18:45:22,500 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-12 18:45:22,503 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-12 18:45:22,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:22,504 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:22,508 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-12 18:45:22,508 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-12 18:45:22,523 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-12 18:45:22,524 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-12 18:45:22,525 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:22,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:22,529 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-12 18:45:22,529 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-04-12 18:45:22,560 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-12 18:45:22,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 10 treesize of output 9 [2018-04-12 18:45:22,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:22,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:22,585 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-12 18:45:22,586 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-04-12 18:45:22,652 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-12 18:45:22,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-12 18:45:22,655 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:22,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 18:45:22,660 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:22,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:22,663 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-12 18:45:22,663 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2018-04-12 18:45:22,671 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-12 18:45:22,689 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:45:22,689 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 22 [2018-04-12 18:45:22,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-12 18:45:22,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-12 18:45:22,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2018-04-12 18:45:22,689 INFO L87 Difference]: Start difference. First operand 226 states and 255 transitions. Second operand 22 states. [2018-04-12 18:45:23,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:45:23,717 INFO L93 Difference]: Finished difference Result 484 states and 530 transitions. [2018-04-12 18:45:23,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-12 18:45:23,718 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 43 [2018-04-12 18:45:23,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:45:23,719 INFO L225 Difference]: With dead ends: 484 [2018-04-12 18:45:23,719 INFO L226 Difference]: Without dead ends: 484 [2018-04-12 18:45:23,720 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=834, Invalid=2588, Unknown=0, NotChecked=0, Total=3422 [2018-04-12 18:45:23,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-04-12 18:45:23,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 213. [2018-04-12 18:45:23,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-04-12 18:45:23,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 240 transitions. [2018-04-12 18:45:23,724 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 240 transitions. Word has length 43 [2018-04-12 18:45:23,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:45:23,724 INFO L459 AbstractCegarLoop]: Abstraction has 213 states and 240 transitions. [2018-04-12 18:45:23,724 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-12 18:45:23,725 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 240 transitions. [2018-04-12 18:45:23,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-12 18:45:23,725 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:45:23,725 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] [2018-04-12 18:45:23,725 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:45:23,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1962075886, now seen corresponding path program 1 times [2018-04-12 18:45:23,726 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:45:23,726 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:45:23,726 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:23,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:45:23,727 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:23,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:45:23,734 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:45:23,799 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-12 18:45:23,800 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:45:23,800 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-12 18:45:23,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-12 18:45:23,800 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-12 18:45:23,800 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-12 18:45:23,801 INFO L87 Difference]: Start difference. First operand 213 states and 240 transitions. Second operand 8 states. [2018-04-12 18:45:23,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:45:23,934 INFO L93 Difference]: Finished difference Result 319 states and 354 transitions. [2018-04-12 18:45:23,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-12 18:45:23,934 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-04-12 18:45:23,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:45:23,935 INFO L225 Difference]: With dead ends: 319 [2018-04-12 18:45:23,935 INFO L226 Difference]: Without dead ends: 319 [2018-04-12 18:45:23,936 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-12 18:45:23,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-04-12 18:45:23,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 290. [2018-04-12 18:45:23,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-04-12 18:45:23,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 333 transitions. [2018-04-12 18:45:23,938 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 333 transitions. Word has length 45 [2018-04-12 18:45:23,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:45:23,938 INFO L459 AbstractCegarLoop]: Abstraction has 290 states and 333 transitions. [2018-04-12 18:45:23,938 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-12 18:45:23,938 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 333 transitions. [2018-04-12 18:45:23,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-12 18:45:23,939 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:45:23,939 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] [2018-04-12 18:45:23,939 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:45:23,939 INFO L82 PathProgramCache]: Analyzing trace with hash -357570926, now seen corresponding path program 1 times [2018-04-12 18:45:23,940 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:45:23,940 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:45:23,940 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:23,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:45:23,941 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:23,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:45:23,953 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:45:24,273 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-12 18:45:24,274 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:45:24,274 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 18:45:24,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:45:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:45:24,300 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:45:24,310 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:24,311 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:24,312 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-12 18:45:24,312 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:24,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:24,319 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-04-12 18:45:24,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 18:45:24,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, 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-12 18:45:24,341 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:24,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:24,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-12 18:45:24,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-04-12 18:45:24,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-04-12 18:45:24,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:45:24,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:24,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:24,420 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-12 18:45:24,421 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:43 [2018-04-12 18:45:24,487 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:24,488 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:24,488 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:24,489 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-12 18:45:24,489 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:24,499 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-12 18:45:24,499 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:68 [2018-04-12 18:45:24,533 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-12 18:45:24,539 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:24,540 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-12 18:45:24,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:24,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:24,558 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-12 18:45:24,559 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:79, output treesize:80 [2018-04-12 18:45:24,667 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:24,672 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 84 treesize of output 98 [2018-04-12 18:45:24,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:45:24,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:24,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:24,697 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-12 18:45:24,697 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:92, output treesize:80 [2018-04-12 18:45:24,767 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 102 treesize of output 95 [2018-04-12 18:45:24,769 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:24,770 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 24 treesize of output 35 [2018-04-12 18:45:24,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:24,779 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:24,789 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-12 18:45:24,790 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:110, output treesize:102 [2018-04-12 18:45:24,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 64 [2018-04-12 18:45:24,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 5 treesize of output 1 [2018-04-12 18:45:24,889 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:24,896 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 35 [2018-04-12 18:45:24,897 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:24,903 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:24,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2018-04-12 18:45:24,904 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-12 18:45:24,909 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-12 18:45:24,914 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-12 18:45:24,914 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:98, output treesize:28 [2018-04-12 18:45:24,945 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-12 18:45:24,962 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:45:24,963 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 30 [2018-04-12 18:45:24,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-12 18:45:24,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-12 18:45:24,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=776, Unknown=0, NotChecked=0, Total=930 [2018-04-12 18:45:24,964 INFO L87 Difference]: Start difference. First operand 290 states and 333 transitions. Second operand 31 states. [2018-04-12 18:45:26,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:45:26,893 INFO L93 Difference]: Finished difference Result 525 states and 578 transitions. [2018-04-12 18:45:26,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-12 18:45:26,893 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 46 [2018-04-12 18:45:26,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:45:26,895 INFO L225 Difference]: With dead ends: 525 [2018-04-12 18:45:26,895 INFO L226 Difference]: Without dead ends: 525 [2018-04-12 18:45:26,895 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1258 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=902, Invalid=3790, Unknown=0, NotChecked=0, Total=4692 [2018-04-12 18:45:26,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2018-04-12 18:45:26,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 318. [2018-04-12 18:45:26,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-04-12 18:45:26,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 367 transitions. [2018-04-12 18:45:26,899 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 367 transitions. Word has length 46 [2018-04-12 18:45:26,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:45:26,899 INFO L459 AbstractCegarLoop]: Abstraction has 318 states and 367 transitions. [2018-04-12 18:45:26,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-12 18:45:26,899 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 367 transitions. [2018-04-12 18:45:26,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-12 18:45:26,900 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:45:26,900 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] [2018-04-12 18:45:26,900 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:45:26,900 INFO L82 PathProgramCache]: Analyzing trace with hash -357570925, now seen corresponding path program 1 times [2018-04-12 18:45:26,900 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:45:26,900 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:45:26,901 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:26,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:45:26,901 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:26,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:45:26,914 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:45:27,306 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-12 18:45:27,307 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:45:27,307 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 18:45:27,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:45:27,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:45:27,331 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:45:27,349 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:27,350 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:27,350 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-12 18:45:27,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:27,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 18:45:27,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:27,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:27,361 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2018-04-12 18:45:27,379 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-12 18:45:27,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 10 treesize of output 9 [2018-04-12 18:45:27,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:27,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:27,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 18:45:27,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-12 18:45:27,392 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:27,393 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:27,399 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-12 18:45:27,399 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:49, output treesize:50 [2018-04-12 18:45:27,440 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-12 18:45:27,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 18:45:27,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:27,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:27,456 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-12 18:45:27,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 18:45:27,459 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:27,467 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:27,475 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-12 18:45:27,475 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:96, output treesize:76 [2018-04-12 18:45:27,559 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:27,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-12 18:45:27,559 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:27,574 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:27,575 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:27,576 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:27,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-04-12 18:45:27,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:27,588 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-12 18:45:27,588 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:93, output treesize:85 [2018-04-12 18:45:27,625 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-12 18:45:27,628 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:27,629 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-12 18:45:27,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:27,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:27,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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-12 18:45:27,664 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:27,665 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-12 18:45:27,665 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:27,674 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:27,687 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-12 18:45:27,688 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:110, output treesize:100 [2018-04-12 18:45:27,812 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:27,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 59 [2018-04-12 18:45:27,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 12 treesize of output 11 [2018-04-12 18:45:27,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:27,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:27,845 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:27,849 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 108 treesize of output 122 [2018-04-12 18:45:27,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 18:45:27,852 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:27,864 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:27,880 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-12 18:45:27,880 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:126, output treesize:122 [2018-04-12 18:45:27,932 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 55 treesize of output 74 [2018-04-12 18:45:27,935 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:27,937 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-12 18:45:27,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:27,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:27,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 3 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 132 [2018-04-12 18:45:27,978 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:27,979 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 24 treesize of output 35 [2018-04-12 18:45:27,980 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:27,991 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:28,008 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-12 18:45:28,009 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:165, output treesize:149 [2018-04-12 18:45:28,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 93 [2018-04-12 18:45:28,133 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:28,134 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 6 [2018-04-12 18:45:28,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:28,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-12 18:45:28,148 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:28,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 50 [2018-04-12 18:45:28,159 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-12 18:45:28,169 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-12 18:45:28,185 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 38 treesize of output 40 [2018-04-12 18:45:28,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-12 18:45:28,186 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:28,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-12 18:45:28,194 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:28,199 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:28,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-12 18:45:28,200 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:28,202 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:28,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 18:45:28,210 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:148, output treesize:18 [2018-04-12 18:45:28,246 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-12 18:45:28,265 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:45:28,265 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 30 [2018-04-12 18:45:28,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-12 18:45:28,265 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-12 18:45:28,265 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=806, Unknown=0, NotChecked=0, Total=930 [2018-04-12 18:45:28,266 INFO L87 Difference]: Start difference. First operand 318 states and 367 transitions. Second operand 31 states. [2018-04-12 18:45:30,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:45:30,845 INFO L93 Difference]: Finished difference Result 561 states and 632 transitions. [2018-04-12 18:45:30,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-12 18:45:30,845 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 46 [2018-04-12 18:45:30,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:45:30,846 INFO L225 Difference]: With dead ends: 561 [2018-04-12 18:45:30,846 INFO L226 Difference]: Without dead ends: 561 [2018-04-12 18:45:30,847 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 737 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=642, Invalid=2550, Unknown=0, NotChecked=0, Total=3192 [2018-04-12 18:45:30,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-04-12 18:45:30,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 318. [2018-04-12 18:45:30,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-04-12 18:45:30,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 366 transitions. [2018-04-12 18:45:30,851 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 366 transitions. Word has length 46 [2018-04-12 18:45:30,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:45:30,851 INFO L459 AbstractCegarLoop]: Abstraction has 318 states and 366 transitions. [2018-04-12 18:45:30,851 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-12 18:45:30,851 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 366 transitions. [2018-04-12 18:45:30,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-12 18:45:30,852 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:45:30,852 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-12 18:45:30,852 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:45:30,852 INFO L82 PathProgramCache]: Analyzing trace with hash 694810563, now seen corresponding path program 1 times [2018-04-12 18:45:30,852 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:45:30,852 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:45:30,853 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:30,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:45:30,853 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:30,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:45:30,859 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:45:31,006 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-12 18:45:31,007 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:45:31,007 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 18:45:31,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:45:31,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:45:31,049 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:45:31,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12 18:45:31,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-12 18:45:31,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:31,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:31,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:31,086 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-04-12 18:45:31,178 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-12 18:45:31,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 11 treesize of output 3 [2018-04-12 18:45:31,179 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:31,180 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:31,182 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-12 18:45:31,182 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:5 [2018-04-12 18:45:31,192 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-12 18:45:31,209 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:45:31,209 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2018-04-12 18:45:31,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-12 18:45:31,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-12 18:45:31,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2018-04-12 18:45:31,210 INFO L87 Difference]: Start difference. First operand 318 states and 366 transitions. Second operand 19 states. [2018-04-12 18:45:31,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:45:31,746 INFO L93 Difference]: Finished difference Result 423 states and 473 transitions. [2018-04-12 18:45:31,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-12 18:45:31,746 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 46 [2018-04-12 18:45:31,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:45:31,747 INFO L225 Difference]: With dead ends: 423 [2018-04-12 18:45:31,747 INFO L226 Difference]: Without dead ends: 423 [2018-04-12 18:45:31,748 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 36 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=293, Invalid=897, Unknown=0, NotChecked=0, Total=1190 [2018-04-12 18:45:31,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-04-12 18:45:31,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 290. [2018-04-12 18:45:31,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-04-12 18:45:31,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 334 transitions. [2018-04-12 18:45:31,752 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 334 transitions. Word has length 46 [2018-04-12 18:45:31,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:45:31,752 INFO L459 AbstractCegarLoop]: Abstraction has 290 states and 334 transitions. [2018-04-12 18:45:31,752 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-12 18:45:31,752 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 334 transitions. [2018-04-12 18:45:31,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-12 18:45:31,753 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:45:31,753 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] [2018-04-12 18:45:31,753 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:45:31,753 INFO L82 PathProgramCache]: Analyzing trace with hash 690699782, now seen corresponding path program 1 times [2018-04-12 18:45:31,753 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:45:31,753 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:45:31,754 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:31,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:45:31,754 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:31,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:45:31,769 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:45:32,124 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-12 18:45:32,124 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:45:32,124 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 18:45:32,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:45:32,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:45:32,156 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:45:32,168 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:32,169 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:32,169 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-12 18:45:32,170 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:32,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:32,174 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-04-12 18:45:32,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, 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-12 18:45:32,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-12 18:45:32,193 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:32,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:32,198 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-12 18:45:32,198 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-04-12 18:45:32,222 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-12 18:45:32,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:45:32,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:32,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:32,232 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-12 18:45:32,232 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:43 [2018-04-12 18:45:32,283 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:32,284 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:32,284 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:32,285 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-12 18:45:32,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:32,294 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-12 18:45:32,294 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:68 [2018-04-12 18:45:32,335 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-12 18:45:32,337 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:32,338 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-12 18:45:32,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:32,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:32,355 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-12 18:45:32,355 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:79, output treesize:80 [2018-04-12 18:45:32,496 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:32,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 98 [2018-04-12 18:45:32,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:45:32,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:32,520 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:32,536 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-12 18:45:32,536 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:92, output treesize:80 [2018-04-12 18:45:32,598 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:32,599 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:32,600 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:32,601 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:32,602 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-12 18:45:32,602 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:32,632 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-12 18:45:32,632 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:91, output treesize:107 [2018-04-12 18:45:32,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 101 [2018-04-12 18:45:32,725 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:32,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, 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-12 18:45:32,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:32,752 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:32,782 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-12 18:45:32,783 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:125, output treesize:127 [2018-04-12 18:45:32,926 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-12 18:45:32,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:45:32,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:32,950 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:32,975 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-12 18:45:32,976 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:183, output treesize:169 [2018-04-12 18:45:33,173 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-12 18:45:33,176 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:33,178 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 43 treesize of output 28 [2018-04-12 18:45:33,178 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-12 18:45:33,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-12 18:45:33,197 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:33,213 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 31 [2018-04-12 18:45:33,213 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-12 18:45:33,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-12 18:45:33,227 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:33,241 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-12 18:45:33,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-12 18:45:33,253 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:163, output treesize:45 [2018-04-12 18:45:33,302 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-12 18:45:33,329 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:45:33,330 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 34 [2018-04-12 18:45:33,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-12 18:45:33,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-12 18:45:33,331 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=991, Unknown=0, NotChecked=0, Total=1190 [2018-04-12 18:45:33,331 INFO L87 Difference]: Start difference. First operand 290 states and 334 transitions. Second operand 35 states. [2018-04-12 18:45:36,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:45:36,629 INFO L93 Difference]: Finished difference Result 725 states and 823 transitions. [2018-04-12 18:45:36,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-04-12 18:45:36,629 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 49 [2018-04-12 18:45:36,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:45:36,631 INFO L225 Difference]: With dead ends: 725 [2018-04-12 18:45:36,631 INFO L226 Difference]: Without dead ends: 725 [2018-04-12 18:45:36,632 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 32 SyntacticMatches, 5 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1632 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1189, Invalid=5291, Unknown=0, NotChecked=0, Total=6480 [2018-04-12 18:45:36,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2018-04-12 18:45:36,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 312. [2018-04-12 18:45:36,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-04-12 18:45:36,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 360 transitions. [2018-04-12 18:45:36,635 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 360 transitions. Word has length 49 [2018-04-12 18:45:36,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:45:36,635 INFO L459 AbstractCegarLoop]: Abstraction has 312 states and 360 transitions. [2018-04-12 18:45:36,635 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-12 18:45:36,635 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 360 transitions. [2018-04-12 18:45:36,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-12 18:45:36,636 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:45:36,636 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] [2018-04-12 18:45:36,636 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:45:36,636 INFO L82 PathProgramCache]: Analyzing trace with hash 690699783, now seen corresponding path program 1 times [2018-04-12 18:45:36,636 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:45:36,636 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:45:36,637 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:36,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:45:36,637 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:36,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:45:36,647 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:45:37,269 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-12 18:45:37,269 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:45:37,269 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 18:45:37,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:45:37,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:45:37,297 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:45:37,319 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:37,319 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:37,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, 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-12 18:45:37,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:37,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 18:45:37,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:37,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:37,332 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2018-04-12 18:45:37,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 18:45:37,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:45:37,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:37,355 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:37,364 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-12 18:45:37,365 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-12 18:45:37,365 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:37,366 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:37,372 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-12 18:45:37,372 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:49, output treesize:50 [2018-04-12 18:45:37,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-04-12 18:45:37,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 18:45:37,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:37,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:37,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 63 [2018-04-12 18:45:37,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 14 treesize of output 13 [2018-04-12 18:45:37,445 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:37,450 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:37,458 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-12 18:45:37,458 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:96, output treesize:76 [2018-04-12 18:45:37,523 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:37,524 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:37,524 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:37,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-04-12 18:45:37,525 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:37,537 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 18 treesize of output 27 [2018-04-12 18:45:37,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:37,548 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-12 18:45:37,548 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:93, output treesize:85 [2018-04-12 18:45:37,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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-12 18:45:37,609 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:37,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12 18:45:37,610 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:37,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:37,648 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-12 18:45:37,654 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:37,655 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-12 18:45:37,656 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:37,662 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:37,679 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-12 18:45:37,679 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:112, output treesize:102 [2018-04-12 18:45:37,819 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:37,825 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 59 [2018-04-12 18:45:37,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-12 18:45:37,828 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:37,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:37,853 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:37,857 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 108 treesize of output 122 [2018-04-12 18:45:37,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:45:37,859 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:37,871 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:37,885 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-12 18:45:37,885 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:125, output treesize:113 [2018-04-12 18:45:37,938 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 27 treesize of output 40 [2018-04-12 18:45:37,938 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:37,957 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:37,958 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:37,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 18:45:37,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:37,973 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-12 18:45:37,973 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:124, output treesize:117 [2018-04-12 18:45:38,029 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 105 treesize of output 107 [2018-04-12 18:45:38,032 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:38,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-12 18:45:38,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:38,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:38,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 73 [2018-04-12 18:45:38,077 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:38,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12 18:45:38,079 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:38,087 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:38,105 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-12 18:45:38,105 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:143, output treesize:129 [2018-04-12 18:45:38,238 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 192 treesize of output 188 [2018-04-12 18:45:38,243 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-12 18:45:38,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:38,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 178 [2018-04-12 18:45:38,525 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:38,609 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:38,617 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 2 case distinctions, treesize of input 137 treesize of output 151 [2018-04-12 18:45:38,618 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-12 18:45:38,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:45:38,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 132 [2018-04-12 18:45:38,734 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:38,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 31 [2018-04-12 18:45:38,734 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:38,751 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:38,785 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 187 treesize of output 264 [2018-04-12 18:45:38,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 212 treesize of output 211 [2018-04-12 18:45:38,793 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:38,898 INFO L267 ElimStorePlain]: Start of recursive call 8: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:38,942 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-12 18:45:38,943 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:204, output treesize:316 [2018-04-12 18:45:40,203 WARN L148 SmtUtils]: Spent 1205ms on a formula simplification that was a NOOP. DAG size: 79 [2018-04-12 18:45:40,465 WARN L148 SmtUtils]: Spent 193ms on a formula simplification that was a NOOP. DAG size: 79 [2018-04-12 18:45:40,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 175 treesize of output 143 [2018-04-12 18:45:40,518 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 133 treesize of output 110 [2018-04-12 18:45:40,519 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-12 18:45:40,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-12 18:45:40,643 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:40,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 100 [2018-04-12 18:45:40,748 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:40,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 115 [2018-04-12 18:45:40,832 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:40,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 94 [2018-04-12 18:45:40,912 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-12 18:45:40,995 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:40,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 100 [2018-04-12 18:45:40,996 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-12 18:45:41,077 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 94 treesize of output 71 [2018-04-12 18:45:41,078 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-12 18:45:41,147 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:41,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 100 treesize of output 81 [2018-04-12 18:45:41,149 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 18:45:41,225 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:41,230 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 123 treesize of output 113 [2018-04-12 18:45:41,231 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-12 18:45:41,328 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:41,336 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 93 [2018-04-12 18:45:41,337 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-12 18:45:41,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 82 [2018-04-12 18:45:41,456 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-12 18:45:41,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 76 [2018-04-12 18:45:41,457 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 18:45:41,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 77 [2018-04-12 18:45:41,557 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:41,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 71 [2018-04-12 18:45:41,558 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:41,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 12 dim-1 vars, End of recursive call: 10 dim-0 vars, and 6 xjuncts. [2018-04-12 18:45:41,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 105 [2018-04-12 18:45:41,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, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 46 [2018-04-12 18:45:41,785 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-12 18:45:41,799 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:41,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-12 18:45:41,800 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:41,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-12 18:45:41,812 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:41,831 INFO L267 ElimStorePlain]: Start of recursive call 17: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 18:45:41,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, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 65 [2018-04-12 18:45:41,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-12 18:45:41,950 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:41,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-12 18:45:41,962 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:41,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 11 treesize of output 3 [2018-04-12 18:45:41,974 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:41,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-12 18:45:41,984 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:41,991 INFO L267 ElimStorePlain]: Start of recursive call 21: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:41,999 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 77 treesize of output 75 [2018-04-12 18:45:42,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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-12 18:45:42,001 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:42,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 59 [2018-04-12 18:45:42,041 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:42,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 54 [2018-04-12 18:45:42,075 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:42,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 62 [2018-04-12 18:45:42,107 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:42,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 55 [2018-04-12 18:45:42,138 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:42,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 45 [2018-04-12 18:45:42,177 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:42,200 INFO L267 ElimStorePlain]: Start of recursive call 26: 7 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:42,210 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 67 treesize of output 73 [2018-04-12 18:45:42,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 56 [2018-04-12 18:45:42,212 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:42,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 49 [2018-04-12 18:45:42,268 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:42,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 54 [2018-04-12 18:45:42,322 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:42,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 49 [2018-04-12 18:45:42,376 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:42,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2018-04-12 18:45:42,430 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:42,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2018-04-12 18:45:42,468 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:42,528 INFO L267 ElimStorePlain]: Start of recursive call 33: 12 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:42,535 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 71 treesize of output 69 [2018-04-12 18:45:42,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 56 [2018-04-12 18:45:42,537 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:42,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 49 [2018-04-12 18:45:42,571 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:42,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 60 [2018-04-12 18:45:42,614 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:42,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 55 [2018-04-12 18:45:42,656 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:42,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 50 [2018-04-12 18:45:42,713 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:42,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 43 [2018-04-12 18:45:42,783 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:42,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2018-04-12 18:45:42,811 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:42,824 INFO L267 ElimStorePlain]: Start of recursive call 40: 7 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:42,834 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 79 treesize of output 89 [2018-04-12 18:45:42,836 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 81 treesize of output 76 [2018-04-12 18:45:42,836 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:42,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 69 treesize of output 62 [2018-04-12 18:45:42,912 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:42,984 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 72 treesize of output 67 [2018-04-12 18:45:42,984 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:43,054 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 62 treesize of output 47 [2018-04-12 18:45:43,055 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:43,143 INFO L267 ElimStorePlain]: Start of recursive call 48: 12 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:43,150 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 71 treesize of output 69 [2018-04-12 18:45:43,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 60 [2018-04-12 18:45:43,152 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:43,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2018-04-12 18:45:43,196 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:43,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 48 [2018-04-12 18:45:43,226 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:43,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 56 [2018-04-12 18:45:43,252 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:43,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 43 [2018-04-12 18:45:43,279 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:43,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 46 [2018-04-12 18:45:43,304 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:43,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2018-04-12 18:45:43,324 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:43,337 INFO L267 ElimStorePlain]: Start of recursive call 53: 7 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:43,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 50 [2018-04-12 18:45:43,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, 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-12 18:45:43,410 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:43,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-12 18:45:43,420 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:43,427 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:43,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-12 18:45:43,427 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:43,432 INFO L267 ElimStorePlain]: Start of recursive call 61: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:43,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 4 dim-2 vars, End of recursive call: 11 dim-0 vars, and 7 xjuncts. [2018-04-12 18:45:43,493 INFO L202 ElimStorePlain]: Needed 64 recursive calls to eliminate 11 variables, input treesize:314, output treesize:177 [2018-04-12 18:45:43,572 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-12 18:45:43,591 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:45:43,592 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 37 [2018-04-12 18:45:43,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-12 18:45:43,592 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-12 18:45:43,592 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1232, Unknown=4, NotChecked=0, Total=1406 [2018-04-12 18:45:43,593 INFO L87 Difference]: Start difference. First operand 312 states and 360 transitions. Second operand 38 states. [2018-04-12 18:45:45,428 WARN L151 SmtUtils]: Spent 175ms on a formula simplification. DAG size of input: 118 DAG size of output 102 [2018-04-12 18:45:45,892 WARN L151 SmtUtils]: Spent 149ms on a formula simplification. DAG size of input: 121 DAG size of output 105 [2018-04-12 18:45:46,106 WARN L151 SmtUtils]: Spent 153ms on a formula simplification. DAG size of input: 118 DAG size of output 102 [2018-04-12 18:45:47,588 WARN L151 SmtUtils]: Spent 1399ms on a formula simplification. DAG size of input: 199 DAG size of output 102 [2018-04-12 18:45:48,674 WARN L151 SmtUtils]: Spent 502ms on a formula simplification. DAG size of input: 204 DAG size of output 106 [2018-04-12 18:45:49,506 WARN L151 SmtUtils]: Spent 604ms on a formula simplification. DAG size of input: 216 DAG size of output 111 [2018-04-12 18:45:51,247 WARN L151 SmtUtils]: Spent 1471ms on a formula simplification. DAG size of input: 104 DAG size of output 92 [2018-04-12 18:45:52,533 WARN L151 SmtUtils]: Spent 1101ms on a formula simplification. DAG size of input: 107 DAG size of output 95 [2018-04-12 18:45:52,939 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 91 DAG size of output 91 [2018-04-12 18:45:53,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:45:53,104 INFO L93 Difference]: Finished difference Result 544 states and 616 transitions. [2018-04-12 18:45:53,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-12 18:45:53,104 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 49 [2018-04-12 18:45:53,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:45:53,105 INFO L225 Difference]: With dead ends: 544 [2018-04-12 18:45:53,106 INFO L226 Difference]: Without dead ends: 544 [2018-04-12 18:45:53,106 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 30 SyntacticMatches, 6 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1125 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=934, Invalid=3888, Unknown=8, NotChecked=0, Total=4830 [2018-04-12 18:45:53,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2018-04-12 18:45:53,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 296. [2018-04-12 18:45:53,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-04-12 18:45:53,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 340 transitions. [2018-04-12 18:45:53,109 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 340 transitions. Word has length 49 [2018-04-12 18:45:53,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:45:53,109 INFO L459 AbstractCegarLoop]: Abstraction has 296 states and 340 transitions. [2018-04-12 18:45:53,109 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-12 18:45:53,109 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 340 transitions. [2018-04-12 18:45:53,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-12 18:45:53,109 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:45:53,109 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:45:53,110 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:45:53,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1085426215, now seen corresponding path program 1 times [2018-04-12 18:45:53,110 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:45:53,110 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:45:53,110 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:53,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:45:53,111 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:53,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:45:53,114 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:45:53,157 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-12 18:45:53,157 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:45:53,157 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 18:45:53,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:45:53,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:45:53,192 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:45:53,216 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-12 18:45:53,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-12 18:45:53,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:53,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:53,226 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-12 18:45:53,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:45:53,228 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:53,229 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:53,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:53,233 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-04-12 18:45:53,384 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 22 treesize of output 16 [2018-04-12 18:45:53,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 17 [2018-04-12 18:45:53,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-04-12 18:45:53,410 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-12 18:45:53,430 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 22 treesize of output 16 [2018-04-12 18:45:53,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 17 [2018-04-12 18:45:53,443 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-12 18:45:53,448 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:45:53,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-12 18:45:53,467 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:49, output treesize:38 [2018-04-12 18:45:53,545 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-12 18:45:53,574 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:45:53,574 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14] total 20 [2018-04-12 18:45:53,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-12 18:45:53,575 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-12 18:45:53,575 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2018-04-12 18:45:53,575 INFO L87 Difference]: Start difference. First operand 296 states and 340 transitions. Second operand 20 states. [2018-04-12 18:45:54,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:45:54,433 INFO L93 Difference]: Finished difference Result 424 states and 479 transitions. [2018-04-12 18:45:54,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-12 18:45:54,433 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 49 [2018-04-12 18:45:54,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:45:54,434 INFO L225 Difference]: With dead ends: 424 [2018-04-12 18:45:54,434 INFO L226 Difference]: Without dead ends: 424 [2018-04-12 18:45:54,434 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=259, Invalid=1223, Unknown=0, NotChecked=0, Total=1482 [2018-04-12 18:45:54,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2018-04-12 18:45:54,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 328. [2018-04-12 18:45:54,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-04-12 18:45:54,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 378 transitions. [2018-04-12 18:45:54,437 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 378 transitions. Word has length 49 [2018-04-12 18:45:54,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:45:54,437 INFO L459 AbstractCegarLoop]: Abstraction has 328 states and 378 transitions. [2018-04-12 18:45:54,437 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-12 18:45:54,437 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 378 transitions. [2018-04-12 18:45:54,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-12 18:45:54,438 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:45:54,438 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] [2018-04-12 18:45:54,438 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:45:54,438 INFO L82 PathProgramCache]: Analyzing trace with hash 338904510, now seen corresponding path program 1 times [2018-04-12 18:45:54,438 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:45:54,438 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:45:54,439 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:54,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:45:54,439 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:54,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:45:54,445 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:45:54,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:45:54,623 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:45:54,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-04-12 18:45:54,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-12 18:45:54,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-12 18:45:54,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-04-12 18:45:54,653 INFO L87 Difference]: Start difference. First operand 328 states and 378 transitions. Second operand 12 states. [2018-04-12 18:45:54,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:45:54,939 INFO L93 Difference]: Finished difference Result 413 states and 466 transitions. [2018-04-12 18:45:54,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-12 18:45:54,939 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2018-04-12 18:45:54,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:45:54,940 INFO L225 Difference]: With dead ends: 413 [2018-04-12 18:45:54,940 INFO L226 Difference]: Without dead ends: 401 [2018-04-12 18:45:54,940 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-04-12 18:45:54,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-04-12 18:45:54,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 324. [2018-04-12 18:45:54,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-04-12 18:45:54,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 371 transitions. [2018-04-12 18:45:54,943 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 371 transitions. Word has length 50 [2018-04-12 18:45:54,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:45:54,943 INFO L459 AbstractCegarLoop]: Abstraction has 324 states and 371 transitions. [2018-04-12 18:45:54,943 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-12 18:45:54,943 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 371 transitions. [2018-04-12 18:45:54,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-12 18:45:54,943 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:45:54,943 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-12 18:45:54,944 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:45:54,944 INFO L82 PathProgramCache]: Analyzing trace with hash 711524907, now seen corresponding path program 1 times [2018-04-12 18:45:54,944 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:45:54,944 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:45:54,944 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:54,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:45:54,945 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:54,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:45:54,952 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:45:55,009 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-12 18:45:55,009 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:45:55,009 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 18:45:55,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:45:55,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:45:55,043 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:45:55,073 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-12 18:45:55,092 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:45:55,093 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-04-12 18:45:55,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-12 18:45:55,093 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-12 18:45:55,093 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=63, Unknown=6, NotChecked=0, Total=90 [2018-04-12 18:45:55,093 INFO L87 Difference]: Start difference. First operand 324 states and 371 transitions. Second operand 10 states. [2018-04-12 18:45:55,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:45:55,250 INFO L93 Difference]: Finished difference Result 339 states and 385 transitions. [2018-04-12 18:45:55,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-12 18:45:55,250 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2018-04-12 18:45:55,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:45:55,251 INFO L225 Difference]: With dead ends: 339 [2018-04-12 18:45:55,251 INFO L226 Difference]: Without dead ends: 306 [2018-04-12 18:45:55,251 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=108, Unknown=6, NotChecked=0, Total=156 [2018-04-12 18:45:55,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-04-12 18:45:55,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2018-04-12 18:45:55,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-04-12 18:45:55,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 351 transitions. [2018-04-12 18:45:55,253 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 351 transitions. Word has length 50 [2018-04-12 18:45:55,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:45:55,253 INFO L459 AbstractCegarLoop]: Abstraction has 305 states and 351 transitions. [2018-04-12 18:45:55,253 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-12 18:45:55,253 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 351 transitions. [2018-04-12 18:45:55,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-12 18:45:55,253 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:45:55,253 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] [2018-04-12 18:45:55,254 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:45:55,254 INFO L82 PathProgramCache]: Analyzing trace with hash -2111877511, now seen corresponding path program 1 times [2018-04-12 18:45:55,254 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:45:55,254 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:45:55,254 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:55,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:45:55,254 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:55,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:45:55,260 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:45:55,367 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-12 18:45:55,367 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:45:55,367 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 18:45:55,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:45:55,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:45:55,388 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:45:55,400 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:55,401 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:55,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 18:45:55,401 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:55,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:55,404 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-12 18:45:55,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 18:45:55,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-12 18:45:55,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:55,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:55,418 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-12 18:45:55,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-12 18:45:55,419 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:55,420 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:55,424 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-12 18:45:55,424 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2018-04-12 18:45:55,425 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-12 18:45:55,426 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-12 18:45:55,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:55,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:55,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:55,429 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2018-04-12 18:45:55,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-04-12 18:45:55,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 18:45:55,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:55,439 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:55,443 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-12 18:45:55,443 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 [2018-04-12 18:45:55,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-04-12 18:45:55,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-12 18:45:55,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:55,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-12 18:45:55,507 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:55,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:55,510 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-12 18:45:55,510 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2018-04-12 18:45:55,520 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-12 18:45:55,538 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-12 18:45:55,538 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 14 [2018-04-12 18:45:55,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-12 18:45:55,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-12 18:45:55,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-04-12 18:45:55,538 INFO L87 Difference]: Start difference. First operand 305 states and 351 transitions. Second operand 15 states. [2018-04-12 18:45:56,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:45:56,303 INFO L93 Difference]: Finished difference Result 640 states and 725 transitions. [2018-04-12 18:45:56,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-12 18:45:56,304 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 51 [2018-04-12 18:45:56,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:45:56,305 INFO L225 Difference]: With dead ends: 640 [2018-04-12 18:45:56,305 INFO L226 Difference]: Without dead ends: 640 [2018-04-12 18:45:56,305 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 42 SyntacticMatches, 9 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=359, Invalid=1047, Unknown=0, NotChecked=0, Total=1406 [2018-04-12 18:45:56,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2018-04-12 18:45:56,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 377. [2018-04-12 18:45:56,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-04-12 18:45:56,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 442 transitions. [2018-04-12 18:45:56,309 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 442 transitions. Word has length 51 [2018-04-12 18:45:56,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:45:56,309 INFO L459 AbstractCegarLoop]: Abstraction has 377 states and 442 transitions. [2018-04-12 18:45:56,309 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-12 18:45:56,310 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 442 transitions. [2018-04-12 18:45:56,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-12 18:45:56,310 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:45:56,310 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:45:56,310 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:45:56,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1367089988, now seen corresponding path program 1 times [2018-04-12 18:45:56,310 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:45:56,310 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:45:56,311 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:56,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:45:56,311 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:56,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:45:56,316 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:45:56,436 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-12 18:45:56,437 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:45:56,437 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 18:45:56,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:45:56,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:45:56,469 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:45:56,475 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:56,476 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:56,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-12 18:45:56,477 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:56,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:56,492 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-12 18:45:56,511 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-12 18:45:56,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 18:45:56,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:56,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:56,522 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-12 18:45:56,522 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-12 18:45:56,558 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:56,561 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 36 treesize of output 37 [2018-04-12 18:45:56,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:45:56,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:56,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:56,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:56,572 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:33 [2018-04-12 18:45:56,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 44 [2018-04-12 18:45:56,592 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:56,593 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 24 treesize of output 35 [2018-04-12 18:45:56,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:56,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:56,603 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-12 18:45:56,604 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:51 [2018-04-12 18:45:56,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 33 [2018-04-12 18:45:56,658 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 28 treesize of output 25 [2018-04-12 18:45:56,658 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:56,663 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:56,664 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 30 treesize of output 16 [2018-04-12 18:45:56,664 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:56,667 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:56,670 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-12 18:45:56,671 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:58, output treesize:15 [2018-04-12 18:45:56,704 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-12 18:45:56,722 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:45:56,722 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-04-12 18:45:56,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-12 18:45:56,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-12 18:45:56,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2018-04-12 18:45:56,722 INFO L87 Difference]: Start difference. First operand 377 states and 442 transitions. Second operand 22 states. [2018-04-12 18:45:57,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:45:57,326 INFO L93 Difference]: Finished difference Result 561 states and 639 transitions. [2018-04-12 18:45:57,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-12 18:45:57,326 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 51 [2018-04-12 18:45:57,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:45:57,327 INFO L225 Difference]: With dead ends: 561 [2018-04-12 18:45:57,327 INFO L226 Difference]: Without dead ends: 561 [2018-04-12 18:45:57,328 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=216, Invalid=776, Unknown=0, NotChecked=0, Total=992 [2018-04-12 18:45:57,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-04-12 18:45:57,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 415. [2018-04-12 18:45:57,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-04-12 18:45:57,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 486 transitions. [2018-04-12 18:45:57,332 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 486 transitions. Word has length 51 [2018-04-12 18:45:57,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:45:57,332 INFO L459 AbstractCegarLoop]: Abstraction has 415 states and 486 transitions. [2018-04-12 18:45:57,332 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-12 18:45:57,332 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 486 transitions. [2018-04-12 18:45:57,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-12 18:45:57,333 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:45:57,333 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:45:57,333 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:45:57,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1367089989, now seen corresponding path program 1 times [2018-04-12 18:45:57,334 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:45:57,334 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:45:57,334 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:57,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:45:57,335 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:45:57,341 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:45:57,473 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-12 18:45:57,473 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:45:57,474 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 18:45:57,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:45:57,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:45:57,506 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:45:57,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:45:57,512 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:57,521 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:57,522 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:57,522 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-12 18:45:57,523 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:57,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:57,529 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-12 18:45:57,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 18:45:57,538 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-12 18:45:57,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:57,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:57,551 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-12 18:45:57,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:45:57,553 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:57,555 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:57,562 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-12 18:45:57,563 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-04-12 18:45:57,617 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:57,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-04-12 18:45:57,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-12 18:45:57,623 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:57,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:57,672 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:57,675 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 47 treesize of output 48 [2018-04-12 18:45:57,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 8 treesize of output 7 [2018-04-12 18:45:57,676 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:57,682 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:57,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:57,689 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:54, output treesize:46 [2018-04-12 18:45:57,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-04-12 18:45:57,716 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:57,718 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-12 18:45:57,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:57,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:57,738 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 78 treesize of output 68 [2018-04-12 18:45:57,740 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:57,741 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 24 treesize of output 35 [2018-04-12 18:45:57,741 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:57,749 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:57,757 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-12 18:45:57,757 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:93, output treesize:77 [2018-04-12 18:45:57,814 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 77 treesize of output 53 [2018-04-12 18:45:57,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 49 [2018-04-12 18:45:57,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:57,824 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:57,825 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 54 treesize of output 32 [2018-04-12 18:45:57,825 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:57,831 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:57,838 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 31 treesize of output 27 [2018-04-12 18:45:57,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-12 18:45:57,840 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:57,844 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:57,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, 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-12 18:45:57,845 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:57,847 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:57,850 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-12 18:45:57,850 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:91, output treesize:9 [2018-04-12 18:45:57,865 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-12 18:45:57,883 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:45:57,883 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 17 [2018-04-12 18:45:57,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-12 18:45:57,883 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-12 18:45:57,883 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-04-12 18:45:57,884 INFO L87 Difference]: Start difference. First operand 415 states and 486 transitions. Second operand 18 states. [2018-04-12 18:45:58,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:45:58,673 INFO L93 Difference]: Finished difference Result 562 states and 643 transitions. [2018-04-12 18:45:58,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-12 18:45:58,674 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 51 [2018-04-12 18:45:58,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:45:58,675 INFO L225 Difference]: With dead ends: 562 [2018-04-12 18:45:58,675 INFO L226 Difference]: Without dead ends: 562 [2018-04-12 18:45:58,675 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870 [2018-04-12 18:45:58,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2018-04-12 18:45:58,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 455. [2018-04-12 18:45:58,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2018-04-12 18:45:58,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 534 transitions. [2018-04-12 18:45:58,680 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 534 transitions. Word has length 51 [2018-04-12 18:45:58,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:45:58,680 INFO L459 AbstractCegarLoop]: Abstraction has 455 states and 534 transitions. [2018-04-12 18:45:58,680 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-12 18:45:58,680 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 534 transitions. [2018-04-12 18:45:58,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-12 18:45:58,680 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:45:58,680 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-12 18:45:58,680 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:45:58,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1043693160, now seen corresponding path program 1 times [2018-04-12 18:45:58,681 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:45:58,681 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:45:58,681 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:58,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:45:58,681 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:58,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:45:58,687 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:45:58,815 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-12 18:45:58,815 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:45:58,815 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 18:45:58,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:45:58,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:45:58,843 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:45:58,915 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-12 18:45:58,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 13 treesize of output 5 [2018-04-12 18:45:58,917 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:58,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:58,919 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-12 18:45:58,919 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-04-12 18:45:58,931 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-12 18:45:58,948 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:45:58,949 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 14 [2018-04-12 18:45:58,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-12 18:45:58,949 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-12 18:45:58,949 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-04-12 18:45:58,949 INFO L87 Difference]: Start difference. First operand 455 states and 534 transitions. Second operand 15 states. [2018-04-12 18:45:59,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:45:59,724 INFO L93 Difference]: Finished difference Result 730 states and 844 transitions. [2018-04-12 18:45:59,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-12 18:45:59,724 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2018-04-12 18:45:59,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:45:59,726 INFO L225 Difference]: With dead ends: 730 [2018-04-12 18:45:59,726 INFO L226 Difference]: Without dead ends: 730 [2018-04-12 18:45:59,726 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 42 SyntacticMatches, 10 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=353, Invalid=979, Unknown=0, NotChecked=0, Total=1332 [2018-04-12 18:45:59,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2018-04-12 18:45:59,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 581. [2018-04-12 18:45:59,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 581 states. [2018-04-12 18:45:59,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 697 transitions. [2018-04-12 18:45:59,731 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 697 transitions. Word has length 52 [2018-04-12 18:45:59,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:45:59,732 INFO L459 AbstractCegarLoop]: Abstraction has 581 states and 697 transitions. [2018-04-12 18:45:59,732 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-12 18:45:59,732 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 697 transitions. [2018-04-12 18:45:59,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-12 18:45:59,733 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:45:59,733 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:45:59,733 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:45:59,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1417636850, now seen corresponding path program 1 times [2018-04-12 18:45:59,733 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:45:59,733 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:45:59,734 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:59,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:45:59,734 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:45:59,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:45:59,741 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:45:59,871 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-12 18:45:59,871 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:45:59,872 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 18:45:59,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:45:59,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:45:59,905 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:45:59,911 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:59,912 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:45:59,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-12 18:45:59,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:59,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:59,918 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-12 18:45:59,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 18:45:59,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-12 18:45:59,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:59,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:59,935 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-12 18:45:59,935 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-04-12 18:45:59,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-04-12 18:45:59,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:45:59,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:45:59,965 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:59,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:45:59,995 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-04-12 18:46:00,010 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:00,011 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:00,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 18:46:00,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:00,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:46:00,015 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2018-04-12 18:46:00,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-04-12 18:46:00,034 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:00,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-12 18:46:00,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:00,040 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:46:00,046 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-12 18:46:00,046 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:34 [2018-04-12 18:46:00,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 70 [2018-04-12 18:46:00,095 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:00,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 60 [2018-04-12 18:46:00,102 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 18:46:00,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 60 [2018-04-12 18:46:00,131 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:00,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:46:00,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-12 18:46:00,161 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:74, output treesize:103 [2018-04-12 18:46:02,201 WARN L148 SmtUtils]: Spent 2022ms on a formula simplification that was a NOOP. DAG size: 38 [2018-04-12 18:46:02,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 31 [2018-04-12 18:46:02,265 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:02,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-12 18:46:02,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:02,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-12 18:46:02,271 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:02,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:46:02,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 52 [2018-04-12 18:46:02,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 40 [2018-04-12 18:46:02,292 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:02,306 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:02,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39 [2018-04-12 18:46:02,312 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-12 18:46:02,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 14 [2018-04-12 18:46:02,331 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:02,332 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 16 [2018-04-12 18:46:02,332 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:02,346 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:02,347 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 40 treesize of output 33 [2018-04-12 18:46:02,348 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:02,361 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-12 18:46:02,361 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:02,367 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:46:02,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:46:02,373 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 9 variables, input treesize:117, output treesize:5 [2018-04-12 18:46:02,383 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-12 18:46:02,402 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:46:02,402 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 20 [2018-04-12 18:46:02,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-12 18:46:02,402 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-12 18:46:02,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2018-04-12 18:46:02,403 INFO L87 Difference]: Start difference. First operand 581 states and 697 transitions. Second operand 21 states. [2018-04-12 18:46:03,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:46:03,497 INFO L93 Difference]: Finished difference Result 823 states and 980 transitions. [2018-04-12 18:46:03,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-12 18:46:03,497 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 54 [2018-04-12 18:46:03,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:46:03,499 INFO L225 Difference]: With dead ends: 823 [2018-04-12 18:46:03,499 INFO L226 Difference]: Without dead ends: 823 [2018-04-12 18:46:03,499 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 45 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=270, Invalid=1212, Unknown=0, NotChecked=0, Total=1482 [2018-04-12 18:46:03,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2018-04-12 18:46:03,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 636. [2018-04-12 18:46:03,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2018-04-12 18:46:03,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 760 transitions. [2018-04-12 18:46:03,503 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 760 transitions. Word has length 54 [2018-04-12 18:46:03,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:46:03,504 INFO L459 AbstractCegarLoop]: Abstraction has 636 states and 760 transitions. [2018-04-12 18:46:03,504 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-12 18:46:03,504 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 760 transitions. [2018-04-12 18:46:03,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-12 18:46:03,504 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:46:03,504 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:46:03,504 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:46:03,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1417636851, now seen corresponding path program 1 times [2018-04-12 18:46:03,505 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:46:03,505 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:46:03,505 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:46:03,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:46:03,505 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:46:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:46:03,510 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:46:03,704 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-12 18:46:03,704 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:46:03,705 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 18:46:03,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:46:03,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:46:03,724 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:46:03,728 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:03,729 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:03,729 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-12 18:46:03,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:03,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:46:03,735 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-12 18:46:03,752 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-12 18:46:03,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:46:03,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:03,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:46:03,762 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-12 18:46:03,764 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-12 18:46:03,764 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:03,765 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:46:03,771 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-12 18:46:03,771 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-04-12 18:46:03,822 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:03,824 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 36 treesize of output 37 [2018-04-12 18:46:03,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:46:03,826 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:03,830 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:46:03,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-04-12 18:46:03,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-12 18:46:03,842 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:03,845 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:46:03,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:46:03,852 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:62, output treesize:54 [2018-04-12 18:46:03,900 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:03,901 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 14 treesize of output 21 [2018-04-12 18:46:03,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:03,913 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:03,914 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:03,915 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:03,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-12 18:46:03,915 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:03,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:46:03,925 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:68 [2018-04-12 18:46:03,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 57 [2018-04-12 18:46:03,956 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:03,957 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-12 18:46:03,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:03,966 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:46:03,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 38 [2018-04-12 18:46:03,986 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:03,987 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-12 18:46:03,987 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:03,992 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:46:04,003 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-12 18:46:04,004 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:94, output treesize:86 [2018-04-12 18:46:04,064 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 151 treesize of output 120 [2018-04-12 18:46:04,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:46:04,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:04,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:46:04,094 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 50 treesize of output 77 [2018-04-12 18:46:04,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:46:04,095 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:04,100 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:46:04,111 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-12 18:46:04,111 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:161, output treesize:133 [2018-04-12 18:46:04,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 85 [2018-04-12 18:46:04,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 27 [2018-04-12 18:46:04,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:04,199 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:04,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 27 [2018-04-12 18:46:04,200 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-12 18:46:04,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-12 18:46:04,209 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:04,216 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-12 18:46:04,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2018-04-12 18:46:04,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-12 18:46:04,229 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:04,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-12 18:46:04,234 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:04,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-12 18:46:04,237 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:04,238 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:46:04,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 18:46:04,245 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:147, output treesize:18 [2018-04-12 18:46:04,305 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-12 18:46:04,322 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:46:04,323 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 28 [2018-04-12 18:46:04,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-12 18:46:04,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-12 18:46:04,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=730, Unknown=0, NotChecked=0, Total=812 [2018-04-12 18:46:04,323 INFO L87 Difference]: Start difference. First operand 636 states and 760 transitions. Second operand 29 states. [2018-04-12 18:46:06,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:46:06,835 INFO L93 Difference]: Finished difference Result 977 states and 1150 transitions. [2018-04-12 18:46:06,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-12 18:46:06,835 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 54 [2018-04-12 18:46:06,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:46:06,837 INFO L225 Difference]: With dead ends: 977 [2018-04-12 18:46:06,837 INFO L226 Difference]: Without dead ends: 977 [2018-04-12 18:46:06,838 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=445, Invalid=2413, Unknown=4, NotChecked=0, Total=2862 [2018-04-12 18:46:06,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2018-04-12 18:46:06,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 652. [2018-04-12 18:46:06,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2018-04-12 18:46:06,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 781 transitions. [2018-04-12 18:46:06,843 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 781 transitions. Word has length 54 [2018-04-12 18:46:06,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:46:06,843 INFO L459 AbstractCegarLoop]: Abstraction has 652 states and 781 transitions. [2018-04-12 18:46:06,843 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-12 18:46:06,843 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 781 transitions. [2018-04-12 18:46:06,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-12 18:46:06,843 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:46:06,843 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:46:06,844 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:46:06,844 INFO L82 PathProgramCache]: Analyzing trace with hash 689346944, now seen corresponding path program 1 times [2018-04-12 18:46:06,844 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:46:06,844 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:46:06,844 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:46:06,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:46:06,844 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:46:06,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:46:06,849 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:46:06,896 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-12 18:46:06,896 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:46:06,896 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-12 18:46:06,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-12 18:46:06,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-12 18:46:06,896 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-04-12 18:46:06,897 INFO L87 Difference]: Start difference. First operand 652 states and 781 transitions. Second operand 7 states. [2018-04-12 18:46:07,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:46:07,073 INFO L93 Difference]: Finished difference Result 919 states and 1094 transitions. [2018-04-12 18:46:07,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-12 18:46:07,074 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2018-04-12 18:46:07,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:46:07,076 INFO L225 Difference]: With dead ends: 919 [2018-04-12 18:46:07,076 INFO L226 Difference]: Without dead ends: 905 [2018-04-12 18:46:07,076 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-04-12 18:46:07,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2018-04-12 18:46:07,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 846. [2018-04-12 18:46:07,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2018-04-12 18:46:07,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1024 transitions. [2018-04-12 18:46:07,083 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1024 transitions. Word has length 56 [2018-04-12 18:46:07,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:46:07,083 INFO L459 AbstractCegarLoop]: Abstraction has 846 states and 1024 transitions. [2018-04-12 18:46:07,084 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-12 18:46:07,084 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1024 transitions. [2018-04-12 18:46:07,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-12 18:46:07,084 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:46:07,084 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 18:46:07,084 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:46:07,085 INFO L82 PathProgramCache]: Analyzing trace with hash -277764453, now seen corresponding path program 1 times [2018-04-12 18:46:07,085 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:46:07,085 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:46:07,085 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:46:07,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:46:07,086 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:46:07,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:46:07,092 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:46:07,244 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-12 18:46:07,244 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:46:07,244 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 18:46:07,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:46:07,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:46:07,278 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:46:07,386 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 32 treesize of output 30 [2018-04-12 18:46:07,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-12 18:46:07,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:07,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:46:07,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2018-04-12 18:46:07,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 15 [2018-04-12 18:46:07,402 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-12 18:46:07,406 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:46:07,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-12 18:46:07,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 15 [2018-04-12 18:46:07,421 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-12 18:46:07,425 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:46:07,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-04-12 18:46:07,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-12 18:46:07,436 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:07,438 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:46:07,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-12 18:46:07,443 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:65, output treesize:33 [2018-04-12 18:46:07,472 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:07,472 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 21 [2018-04-12 18:46:07,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:07,480 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:07,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 19 [2018-04-12 18:46:07,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 18:46:07,491 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 3 xjuncts. [2018-04-12 18:46:07,491 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:37 [2018-04-12 18:46:07,528 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-12 18:46:07,545 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:46:07,545 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 23 [2018-04-12 18:46:07,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-12 18:46:07,545 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-12 18:46:07,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2018-04-12 18:46:07,546 INFO L87 Difference]: Start difference. First operand 846 states and 1024 transitions. Second operand 24 states. [2018-04-12 18:46:08,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:46:08,775 INFO L93 Difference]: Finished difference Result 1012 states and 1187 transitions. [2018-04-12 18:46:08,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-12 18:46:08,775 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 56 [2018-04-12 18:46:08,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:46:08,777 INFO L225 Difference]: With dead ends: 1012 [2018-04-12 18:46:08,777 INFO L226 Difference]: Without dead ends: 1012 [2018-04-12 18:46:08,777 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 897 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=747, Invalid=2793, Unknown=0, NotChecked=0, Total=3540 [2018-04-12 18:46:08,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2018-04-12 18:46:08,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 850. [2018-04-12 18:46:08,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2018-04-12 18:46:08,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1028 transitions. [2018-04-12 18:46:08,784 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1028 transitions. Word has length 56 [2018-04-12 18:46:08,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:46:08,784 INFO L459 AbstractCegarLoop]: Abstraction has 850 states and 1028 transitions. [2018-04-12 18:46:08,784 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-12 18:46:08,784 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1028 transitions. [2018-04-12 18:46:08,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-12 18:46:08,784 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:46:08,784 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:46:08,784 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:46:08,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1506285837, now seen corresponding path program 2 times [2018-04-12 18:46:08,785 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:46:08,785 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:46:08,785 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:46:08,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:46:08,786 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:46:08,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:46:08,796 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:46:09,145 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:46:09,146 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:46:09,146 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 18:46:09,151 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-12 18:46:09,170 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-12 18:46:09,170 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 18:46:09,171 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:46:09,183 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:09,183 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:09,184 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-12 18:46:09,184 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:09,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:46:09,187 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-04-12 18:46:09,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 18:46:09,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-12 18:46:09,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:09,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:46:09,209 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-12 18:46:09,209 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-04-12 18:46:09,232 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-12 18:46:09,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:46:09,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:09,235 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:46:09,240 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-12 18:46:09,240 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:43 [2018-04-12 18:46:09,285 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:09,286 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:09,286 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:09,287 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-12 18:46:09,287 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:09,296 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-12 18:46:09,296 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:68 [2018-04-12 18:46:09,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 59 [2018-04-12 18:46:09,332 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:09,332 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-12 18:46:09,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:09,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:46:09,348 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-12 18:46:09,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:79, output treesize:80 [2018-04-12 18:46:09,466 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:09,470 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 84 treesize of output 98 [2018-04-12 18:46:09,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:46:09,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:09,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:46:09,490 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-12 18:46:09,490 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:95, output treesize:83 [2018-04-12 18:46:09,531 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 81 treesize of output 83 [2018-04-12 18:46:09,532 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:09,533 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-12 18:46:09,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:09,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:46:09,552 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-12 18:46:09,553 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:96, output treesize:92 [2018-04-12 18:46:09,598 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:09,598 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:09,599 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:09,599 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:09,600 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-12 18:46:09,600 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:09,620 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-12 18:46:09,621 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:103, output treesize:127 [2018-04-12 18:46:09,665 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:09,669 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 118 treesize of output 128 [2018-04-12 18:46:09,671 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:09,672 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:09,673 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 21 treesize of output 33 [2018-04-12 18:46:09,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:09,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:46:09,704 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-12 18:46:09,704 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:138, output treesize:136 [2018-04-12 18:46:09,829 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:09,829 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:09,836 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 164 treesize of output 169 [2018-04-12 18:46:09,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 18:46:09,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:09,854 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:46:09,871 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-12 18:46:09,871 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:175, output treesize:171 [2018-04-12 18:46:09,935 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 194 treesize of output 158 [2018-04-12 18:46:09,937 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:09,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, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 47 [2018-04-12 18:46:09,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:09,958 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:46:09,981 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-12 18:46:09,981 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:205, output treesize:193 [2018-04-12 18:46:10,149 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 179 treesize of output 107 [2018-04-12 18:46:10,151 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:10,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 15 treesize of output 6 [2018-04-12 18:46:10,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:10,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 55 [2018-04-12 18:46:10,198 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:10,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-12 18:46:10,209 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:10,217 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 37 [2018-04-12 18:46:10,218 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 18:46:10,227 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-12 18:46:10,235 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-12 18:46:10,235 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:187, output treesize:45 [2018-04-12 18:46:10,289 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:46:10,305 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:46:10,306 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 40 [2018-04-12 18:46:10,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-12 18:46:10,306 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-12 18:46:10,306 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=1392, Unknown=0, NotChecked=0, Total=1640 [2018-04-12 18:46:10,306 INFO L87 Difference]: Start difference. First operand 850 states and 1028 transitions. Second operand 41 states. [2018-04-12 18:46:14,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:46:14,488 INFO L93 Difference]: Finished difference Result 1655 states and 1968 transitions. [2018-04-12 18:46:14,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-04-12 18:46:14,489 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 59 [2018-04-12 18:46:14,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:46:14,491 INFO L225 Difference]: With dead ends: 1655 [2018-04-12 18:46:14,491 INFO L226 Difference]: Without dead ends: 1655 [2018-04-12 18:46:14,493 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3397 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1961, Invalid=9169, Unknown=0, NotChecked=0, Total=11130 [2018-04-12 18:46:14,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states. [2018-04-12 18:46:14,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 878. [2018-04-12 18:46:14,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 878 states. [2018-04-12 18:46:14,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1062 transitions. [2018-04-12 18:46:14,501 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1062 transitions. Word has length 59 [2018-04-12 18:46:14,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:46:14,501 INFO L459 AbstractCegarLoop]: Abstraction has 878 states and 1062 transitions. [2018-04-12 18:46:14,501 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-12 18:46:14,501 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1062 transitions. [2018-04-12 18:46:14,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-12 18:46:14,502 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:46:14,502 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:46:14,502 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:46:14,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1506285836, now seen corresponding path program 2 times [2018-04-12 18:46:14,502 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:46:14,502 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:46:14,503 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:46:14,503 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-12 18:46:14,503 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:46:14,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:46:14,516 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:46:15,045 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:46:15,045 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:46:15,046 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 18:46:15,051 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-12 18:46:15,070 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-12 18:46:15,071 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 18:46:15,073 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:46:15,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-12 18:46:15,093 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:15,099 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:15,100 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:15,100 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-12 18:46:15,100 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:15,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:46:15,105 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2018-04-12 18:46:15,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 18:46:15,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-12 18:46:15,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:15,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:46:15,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12 18:46:15,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:46:15,137 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:15,138 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:46:15,143 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-12 18:46:15,143 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:49, output treesize:50 [2018-04-12 18:46:15,192 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-12 18:46:15,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 18:46:15,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:15,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:46:15,242 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-12 18:46:15,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:46:15,243 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:15,246 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:46:15,253 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-12 18:46:15,253 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:96, output treesize:76 [2018-04-12 18:46:15,323 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:15,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-12 18:46:15,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:15,338 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:15,339 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:15,339 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:15,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-04-12 18:46:15,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:15,350 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-12 18:46:15,350 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:93, output treesize:85 [2018-04-12 18:46:15,393 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-12 18:46:15,396 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:15,397 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-12 18:46:15,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:15,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:46:15,424 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-12 18:46:15,426 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:15,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12 18:46:15,427 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:15,434 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:46:15,448 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-12 18:46:15,448 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:112, output treesize:102 [2018-04-12 18:46:15,566 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:15,571 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 97 treesize of output 111 [2018-04-12 18:46:15,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:46:15,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:15,583 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:46:15,599 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:15,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 59 [2018-04-12 18:46:15,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-12 18:46:15,604 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:15,609 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:46:15,623 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-12 18:46:15,623 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:128, output treesize:120 [2018-04-12 18:46:15,692 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 47 treesize of output 73 [2018-04-12 18:46:15,694 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:15,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12 18:46:15,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:15,713 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:46:15,760 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:15,765 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 126 treesize of output 128 [2018-04-12 18:46:15,767 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:15,768 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-12 18:46:15,768 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:15,781 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:46:15,798 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-12 18:46:15,798 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:146, output treesize:142 [2018-04-12 18:46:15,856 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:15,856 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:15,857 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-12 18:46:15,857 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:15,878 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 0 case distinctions, treesize of input 27 treesize of output 40 [2018-04-12 18:46:15,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:15,896 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-12 18:46:15,896 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:153, output treesize:146 [2018-04-12 18:46:15,955 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 78 [2018-04-12 18:46:15,957 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:15,959 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 25 treesize of output 31 [2018-04-12 18:46:15,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:15,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:46:15,994 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:16,000 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 133 treesize of output 133 [2018-04-12 18:46:16,002 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:16,004 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 21 treesize of output 23 [2018-04-12 18:46:16,004 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:16,019 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:46:16,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 18:46:16,038 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:168, output treesize:136 [2018-04-12 18:46:16,200 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:16,224 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 47 treesize of output 170 [2018-04-12 18:46:16,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 121 [2018-04-12 18:46:16,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:16,313 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 61 treesize of output 76 [2018-04-12 18:46:16,314 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-12 18:46:16,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:46:16,404 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:16,405 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:16,405 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:46:16,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 172 [2018-04-12 18:46:16,414 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:16,416 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 56 treesize of output 77 [2018-04-12 18:46:16,416 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:16,435 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:46:16,438 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:16,459 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 180 treesize of output 193 [2018-04-12 18:46:16,464 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 190 treesize of output 191 [2018-04-12 18:46:16,465 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:16,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 168 [2018-04-12 18:46:16,622 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:16,763 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:16,765 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:46:16,775 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 4 case distinctions, treesize of input 137 treesize of output 162 [2018-04-12 18:46:16,776 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-04-12 18:46:16,852 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-12 18:46:16,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2018-04-12 18:46:16,928 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:182, output treesize:450 [2018-04-12 18:46:17,103 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 245 treesize of output 221 [2018-04-12 18:46:17,109 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:17,112 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:17,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 187 treesize of output 211 [2018-04-12 18:46:17,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:17,333 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:17,334 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 224 treesize of output 239 [2018-04-12 18:46:17,335 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:17,434 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:17,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 208 treesize of output 235 [2018-04-12 18:46:17,442 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-12 18:46:17,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:46:17,766 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:46:17,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 192 treesize of output 173 [2018-04-12 18:46:17,771 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:17,773 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 31 [2018-04-12 18:46:17,773 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:17,794 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:46:17,991 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 215 treesize of output 214 [2018-04-12 18:46:17,994 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:17,996 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 29 treesize of output 42 [2018-04-12 18:46:17,996 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:18,019 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:46:18,048 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 233 treesize of output 294 [2018-04-12 18:46:18,053 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:18,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 237 treesize of output 268 [2018-04-12 18:46:18,062 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-04-12 18:46:18,366 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:18,367 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 212 treesize of output 227 [2018-04-12 18:46:18,367 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:18,491 INFO L267 ElimStorePlain]: Start of recursive call 10: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:46:18,652 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:18,657 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 160 treesize of output 154 [2018-04-12 18:46:18,660 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:18,660 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:18,661 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:18,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, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 83 [2018-04-12 18:46:18,662 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:18,685 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:46:18,829 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:18,836 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 156 treesize of output 153 [2018-04-12 18:46:18,838 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:18,839 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-12 18:46:18,839 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:18,859 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:46:18,975 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:46:18,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 3 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 158 [2018-04-12 18:46:18,978 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:18,979 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 35 treesize of output 35 [2018-04-12 18:46:18,979 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:18,995 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:46:19,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 6 dim-2 vars, End of recursive call: 14 dim-0 vars, and 4 xjuncts. [2018-04-12 18:46:19,086 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 17 variables, input treesize:598, output treesize:709 [2018-04-12 18:46:24,415 WARN L151 SmtUtils]: Spent 5212ms on a formula simplification. DAG size of input: 169 DAG size of output 97 [2018-04-12 18:46:24,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 110 [2018-04-12 18:46:24,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-12 18:46:24,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:24,595 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:24,596 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 6 [2018-04-12 18:46:24,596 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:24,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 50 [2018-04-12 18:46:24,610 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-12 18:46:24,622 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-12 18:46:24,670 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 220 treesize of output 224 [2018-04-12 18:46:24,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 195 [2018-04-12 18:46:24,673 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:24,786 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:24,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 184 treesize of output 196 [2018-04-12 18:46:24,799 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-04-12 18:46:24,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 193 [2018-04-12 18:46:24,992 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:25,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 171 [2018-04-12 18:46:25,172 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:25,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 139 [2018-04-12 18:46:25,174 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:25,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 154 [2018-04-12 18:46:25,175 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:25,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 156 [2018-04-12 18:46:25,177 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:25,348 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:25,349 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 216 treesize of output 210 [2018-04-12 18:46:25,349 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:25,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 197 [2018-04-12 18:46:25,515 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:25,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 193 treesize of output 186 [2018-04-12 18:46:25,678 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:25,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 190 [2018-04-12 18:46:25,873 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:26,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 185 [2018-04-12 18:46:26,034 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:26,193 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:26,197 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 186 treesize of output 185 [2018-04-12 18:46:26,198 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-04-12 18:46:26,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 188 [2018-04-12 18:46:26,372 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:26,588 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:26,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 188 treesize of output 185 [2018-04-12 18:46:26,595 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts. [2018-04-12 18:46:26,724 INFO L267 ElimStorePlain]: Start of recursive call 6: 12 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-12 18:46:26,846 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:26,849 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:26,852 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 1 case distinctions, treesize of input 164 treesize of output 120 [2018-04-12 18:46:26,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 97 [2018-04-12 18:46:26,855 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:26,896 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:26,897 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 106 treesize of output 98 [2018-04-12 18:46:26,897 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:26,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 87 [2018-04-12 18:46:26,932 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:26,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, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 76 [2018-04-12 18:46:26,965 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 18:46:26,999 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:26,999 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:27,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 113 [2018-04-12 18:46:27,012 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-04-12 18:46:27,073 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 70 treesize of output 53 [2018-04-12 18:46:27,073 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 18:46:27,108 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 54 treesize of output 36 [2018-04-12 18:46:27,108 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:27,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 46 [2018-04-12 18:46:27,109 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 18:46:27,139 INFO L267 ElimStorePlain]: Start of recursive call 22: 7 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-04-12 18:46:27,143 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 185 treesize of output 113 [2018-04-12 18:46:27,145 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 48 treesize of output 44 [2018-04-12 18:46:27,145 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:27,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-12 18:46:27,160 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 18:46:27,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-12 18:46:27,174 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:27,186 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:27,187 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-12 18:46:27,188 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 18:46:27,197 INFO L267 ElimStorePlain]: Start of recursive call 31: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 18:46:27,205 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 6 new quantified variables, introduced 1 case distinctions, treesize of input 175 treesize of output 119 [2018-04-12 18:46:27,207 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:27,209 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 101 treesize of output 88 [2018-04-12 18:46:27,209 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:27,242 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 82 treesize of output 74 [2018-04-12 18:46:27,242 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:27,273 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 107 treesize of output 103 [2018-04-12 18:46:27,273 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:27,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, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 82 [2018-04-12 18:46:27,302 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 18:46:27,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 73 [2018-04-12 18:46:27,331 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:27,359 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:27,360 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 73 treesize of output 58 [2018-04-12 18:46:27,360 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 18:46:27,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 54 [2018-04-12 18:46:27,387 INFO L267 ElimStorePlain]: Start of recursive call 43: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 18:46:27,411 INFO L267 ElimStorePlain]: Start of recursive call 36: 7 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-12 18:46:27,420 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 6 new quantified variables, introduced 1 case distinctions, treesize of input 175 treesize of output 119 [2018-04-12 18:46:27,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 96 [2018-04-12 18:46:27,422 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:27,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 99 [2018-04-12 18:46:27,462 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:27,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 90 [2018-04-12 18:46:27,498 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:27,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 79 [2018-04-12 18:46:27,530 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 18:46:27,563 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 96 treesize of output 84 [2018-04-12 18:46:27,564 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:27,593 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:27,594 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 73 treesize of output 58 [2018-04-12 18:46:27,594 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 18:46:27,623 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:27,623 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:27,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 83 [2018-04-12 18:46:27,632 INFO L267 ElimStorePlain]: Start of recursive call 51: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-04-12 18:46:27,681 INFO L267 ElimStorePlain]: Start of recursive call 44: 7 dim-1 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2018-04-12 18:46:27,684 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:27,690 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 6 new quantified variables, introduced 1 case distinctions, treesize of input 160 treesize of output 116 [2018-04-12 18:46:27,692 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:27,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 104 treesize of output 96 [2018-04-12 18:46:27,693 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:27,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, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 92 [2018-04-12 18:46:27,729 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:27,765 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:27,769 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 86 treesize of output 80 [2018-04-12 18:46:27,769 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-12 18:46:27,815 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 90 treesize of output 79 [2018-04-12 18:46:27,816 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 18:46:27,858 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 73 treesize of output 58 [2018-04-12 18:46:27,859 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 18:46:27,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 54 treesize of output 49 [2018-04-12 18:46:27,904 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:27,945 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 64 treesize of output 49 [2018-04-12 18:46:27,945 INFO L267 ElimStorePlain]: Start of recursive call 59: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 18:46:27,947 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 70 treesize of output 55 [2018-04-12 18:46:27,947 INFO L267 ElimStorePlain]: Start of recursive call 60: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 18:46:27,984 INFO L267 ElimStorePlain]: Start of recursive call 52: 7 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-04-12 18:46:28,165 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 63 treesize of output 53 [2018-04-12 18:46:28,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-12 18:46:28,166 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:28,176 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:46:28,177 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-12 18:46:28,177 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:28,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-12 18:46:28,185 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-04-12 18:46:28,190 INFO L267 ElimStorePlain]: Start of recursive call 61: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:46:28,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 4 dim-2 vars, End of recursive call: 20 dim-0 vars, and 13 xjuncts. [2018-04-12 18:46:28,367 INFO L202 ElimStorePlain]: Needed 64 recursive calls to eliminate 13 variables, input treesize:366, output treesize:336 [2018-04-12 18:46:28,526 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:46:28,543 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:46:28,543 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 43 [2018-04-12 18:46:28,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-12 18:46:28,543 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-12 18:46:28,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1682, Unknown=0, NotChecked=0, Total=1892 [2018-04-12 18:46:28,543 INFO L87 Difference]: Start difference. First operand 878 states and 1062 transitions. Second operand 44 states. [2018-04-12 18:46:40,711 WARN L151 SmtUtils]: Spent 10046ms on a formula simplification. DAG size of input: 215 DAG size of output 113 [2018-04-12 18:46:47,080 WARN L151 SmtUtils]: Spent 5551ms on a formula simplification. DAG size of input: 150 DAG size of output 124 [2018-04-12 18:46:51,610 WARN L151 SmtUtils]: Spent 4424ms on a formula simplification. DAG size of input: 220 DAG size of output 117 [2018-04-12 18:46:53,483 WARN L151 SmtUtils]: Spent 426ms on a formula simplification. DAG size of input: 202 DAG size of output 170 [2018-04-12 18:46:57,035 WARN L151 SmtUtils]: Spent 3185ms on a formula simplification. DAG size of input: 237 DAG size of output 122 [2018-04-12 18:46:57,615 WARN L151 SmtUtils]: Spent 357ms on a formula simplification. DAG size of input: 207 DAG size of output 175 [2018-04-12 18:46:59,156 WARN L151 SmtUtils]: Spent 1243ms on a formula simplification. DAG size of input: 123 DAG size of output 108 [2018-04-12 18:47:04,225 WARN L151 SmtUtils]: Spent 4139ms on a formula simplification. DAG size of input: 128 DAG size of output 111 [2018-04-12 18:47:04,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:47:04,689 INFO L93 Difference]: Finished difference Result 1707 states and 2068 transitions. [2018-04-12 18:47:04,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-12 18:47:04,689 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 59 [2018-04-12 18:47:04,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:47:04,692 INFO L225 Difference]: With dead ends: 1707 [2018-04-12 18:47:04,692 INFO L226 Difference]: Without dead ends: 1707 [2018-04-12 18:47:04,693 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1689 ImplicationChecksByTransitivity, 38.5s TimeCoverageRelationStatistics Valid=1176, Invalid=5630, Unknown=0, NotChecked=0, Total=6806 [2018-04-12 18:47:04,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2018-04-12 18:47:04,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 921. [2018-04-12 18:47:04,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2018-04-12 18:47:04,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1113 transitions. [2018-04-12 18:47:04,699 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1113 transitions. Word has length 59 [2018-04-12 18:47:04,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:47:04,699 INFO L459 AbstractCegarLoop]: Abstraction has 921 states and 1113 transitions. [2018-04-12 18:47:04,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-12 18:47:04,699 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1113 transitions. [2018-04-12 18:47:04,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-12 18:47:04,700 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:47:04,700 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:47:04,700 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:47:04,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1956802800, now seen corresponding path program 1 times [2018-04-12 18:47:04,700 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:47:04,700 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:47:04,701 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:47:04,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-12 18:47:04,701 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:47:04,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:47:04,706 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:47:04,957 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:47:04,957 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:47:04,957 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 18:47:04,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:47:04,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:47:04,980 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:47:05,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 18:47:05,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:05,011 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:05,011 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:05,012 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-12 18:47:05,012 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:05,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:05,015 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-12 18:47:05,030 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-12 18:47:05,031 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-12 18:47:05,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:05,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:05,038 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-12 18:47:05,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:47:05,040 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:05,040 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:05,045 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-12 18:47:05,045 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-04-12 18:47:05,090 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:05,092 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 36 treesize of output 37 [2018-04-12 18:47:05,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-12 18:47:05,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:05,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:05,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-04-12 18:47:05,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-12 18:47:05,108 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:05,111 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:05,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:05,117 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:57, output treesize:49 [2018-04-12 18:47:05,139 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 11 [2018-04-12 18:47:05,139 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:05,148 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-12 18:47:05,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:47:05,149 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:05,150 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:05,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:05,157 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:69, output treesize:56 [2018-04-12 18:47:05,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 80 [2018-04-12 18:47:05,191 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:05,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 35 [2018-04-12 18:47:05,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:05,200 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:05,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-04-12 18:47:05,216 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:05,216 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:47:05,217 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 42 [2018-04-12 18:47:05,217 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:05,222 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:05,230 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-12 18:47:05,230 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:103, output treesize:87 [2018-04-12 18:47:05,295 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 81 treesize of output 57 [2018-04-12 18:47:05,296 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 52 treesize of output 53 [2018-04-12 18:47:05,297 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:05,303 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:05,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 36 [2018-04-12 18:47:05,305 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:05,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:05,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-12 18:47:05,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-12 18:47:05,319 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:05,323 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:05,323 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:47:05,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, 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 10 [2018-04-12 18:47:05,324 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:05,326 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:05,330 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-12 18:47:05,330 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:101, output treesize:19 [2018-04-12 18:47:05,379 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-12 18:47:05,379 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:47:05,380 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-12 18:47:05,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:05,381 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:05,384 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-12 18:47:05,384 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:3 [2018-04-12 18:47:05,444 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:47:05,462 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:47:05,462 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 32 [2018-04-12 18:47:05,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-12 18:47:05,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-12 18:47:05,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=912, Unknown=0, NotChecked=0, Total=992 [2018-04-12 18:47:05,462 INFO L87 Difference]: Start difference. First operand 921 states and 1113 transitions. Second operand 32 states. [2018-04-12 18:47:08,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:47:08,370 INFO L93 Difference]: Finished difference Result 1503 states and 1758 transitions. [2018-04-12 18:47:08,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-12 18:47:08,370 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 59 [2018-04-12 18:47:08,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:47:08,372 INFO L225 Difference]: With dead ends: 1503 [2018-04-12 18:47:08,372 INFO L226 Difference]: Without dead ends: 1503 [2018-04-12 18:47:08,373 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1197 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=808, Invalid=4741, Unknown=1, NotChecked=0, Total=5550 [2018-04-12 18:47:08,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2018-04-12 18:47:08,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1024. [2018-04-12 18:47:08,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1024 states. [2018-04-12 18:47:08,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1227 transitions. [2018-04-12 18:47:08,379 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1227 transitions. Word has length 59 [2018-04-12 18:47:08,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:47:08,380 INFO L459 AbstractCegarLoop]: Abstraction has 1024 states and 1227 transitions. [2018-04-12 18:47:08,380 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-12 18:47:08,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1227 transitions. [2018-04-12 18:47:08,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-12 18:47:08,380 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:47:08,380 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:47:08,380 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:47:08,380 INFO L82 PathProgramCache]: Analyzing trace with hash 2094764041, now seen corresponding path program 1 times [2018-04-12 18:47:08,381 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:47:08,381 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:47:08,381 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:47:08,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:47:08,381 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:47:08,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:47:08,386 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:47:08,623 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:47:08,624 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:47:08,624 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 18:47:08,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:47:08,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:47:08,644 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:47:08,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:47:08,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:08,671 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:08,671 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:08,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-12 18:47:08,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:08,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:08,676 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-12 18:47:08,692 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-12 18:47:08,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-12 18:47:08,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:08,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:08,701 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-12 18:47:08,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 18:47:08,702 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:08,704 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:08,709 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-12 18:47:08,709 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-04-12 18:47:08,762 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:08,765 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 36 treesize of output 37 [2018-04-12 18:47:08,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:47:08,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:08,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:08,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-04-12 18:47:08,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-12 18:47:08,782 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:08,785 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:08,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:08,792 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:57, output treesize:49 [2018-04-12 18:47:08,816 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 11 [2018-04-12 18:47:08,816 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:08,826 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-12 18:47:08,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:47:08,827 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:08,828 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:08,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:08,836 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:69, output treesize:56 [2018-04-12 18:47:08,864 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 90 treesize of output 80 [2018-04-12 18:47:08,866 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:08,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 35 [2018-04-12 18:47:08,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:08,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:08,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-04-12 18:47:08,890 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:08,890 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:47:08,890 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 42 [2018-04-12 18:47:08,891 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:08,895 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:08,904 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-12 18:47:08,905 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:103, output treesize:87 [2018-04-12 18:47:08,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 57 [2018-04-12 18:47:08,975 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:08,976 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 6 [2018-04-12 18:47:08,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:08,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2018-04-12 18:47:08,983 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:08,986 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:08,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-12 18:47:08,996 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:08,997 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:47:08,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 13 treesize of output 10 [2018-04-12 18:47:08,997 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:09,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-12 18:47:09,001 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:09,002 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:09,006 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-12 18:47:09,006 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:101, output treesize:19 [2018-04-12 18:47:09,059 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-12 18:47:09,060 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:47:09,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, 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-12 18:47:09,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:09,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:09,064 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-12 18:47:09,064 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:3 [2018-04-12 18:47:09,106 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:47:09,123 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:47:09,124 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 32 [2018-04-12 18:47:09,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-12 18:47:09,124 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-12 18:47:09,124 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=913, Unknown=0, NotChecked=0, Total=992 [2018-04-12 18:47:09,124 INFO L87 Difference]: Start difference. First operand 1024 states and 1227 transitions. Second operand 32 states. [2018-04-12 18:47:12,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:47:12,365 INFO L93 Difference]: Finished difference Result 1415 states and 1651 transitions. [2018-04-12 18:47:12,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-12 18:47:12,365 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 59 [2018-04-12 18:47:12,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:47:12,367 INFO L225 Difference]: With dead ends: 1415 [2018-04-12 18:47:12,367 INFO L226 Difference]: Without dead ends: 1415 [2018-04-12 18:47:12,368 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1191 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=873, Invalid=4674, Unknown=3, NotChecked=0, Total=5550 [2018-04-12 18:47:12,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2018-04-12 18:47:12,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 929. [2018-04-12 18:47:12,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 929 states. [2018-04-12 18:47:12,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1113 transitions. [2018-04-12 18:47:12,375 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1113 transitions. Word has length 59 [2018-04-12 18:47:12,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:47:12,376 INFO L459 AbstractCegarLoop]: Abstraction has 929 states and 1113 transitions. [2018-04-12 18:47:12,376 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-12 18:47:12,376 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1113 transitions. [2018-04-12 18:47:12,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-12 18:47:12,376 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:47:12,376 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:47:12,377 INFO L408 AbstractCegarLoop]: === Iteration 42 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:47:12,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1784465383, now seen corresponding path program 1 times [2018-04-12 18:47:12,377 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:47:12,377 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:47:12,377 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:47:12,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:47:12,377 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:47:12,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:47:12,382 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:47:12,690 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:47:12,691 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:47:12,691 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 18:47:12,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:47:12,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:47:12,728 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:47:12,759 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:12,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2018-04-12 18:47:12,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:12,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:12,768 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:28 [2018-04-12 18:47:12,784 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-12 18:47:12,785 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-12 18:47:12,785 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:12,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:12,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:12,792 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:46 [2018-04-12 18:47:12,830 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-12 18:47:12,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:47:12,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:12,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:12,842 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-12 18:47:12,842 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:59 [2018-04-12 18:47:13,084 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 47 treesize of output 38 [2018-04-12 18:47:13,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-12 18:47:13,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:13,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 25 [2018-04-12 18:47:13,107 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-12 18:47:13,115 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-12 18:47:13,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-04-12 18:47:13,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-12 18:47:13,130 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:13,131 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:13,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-12 18:47:13,142 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:66, output treesize:57 [2018-04-12 18:47:13,182 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:13,190 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 4 case distinctions, treesize of input 35 treesize of output 42 [2018-04-12 18:47:13,190 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-12 18:47:13,227 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:13,228 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 31 treesize of output 35 [2018-04-12 18:47:13,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:13,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2018-04-12 18:47:13,255 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:67, output treesize:106 [2018-04-12 18:47:13,355 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:13,356 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:13,356 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-12 18:47:13,356 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:13,361 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-12 18:47:13,361 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:25 [2018-04-12 18:47:13,413 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:47:13,431 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:47:13,431 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 28 [2018-04-12 18:47:13,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-12 18:47:13,431 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-12 18:47:13,431 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=730, Unknown=1, NotChecked=0, Total=812 [2018-04-12 18:47:13,432 INFO L87 Difference]: Start difference. First operand 929 states and 1113 transitions. Second operand 29 states. [2018-04-12 18:47:15,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:47:15,052 INFO L93 Difference]: Finished difference Result 1017 states and 1206 transitions. [2018-04-12 18:47:15,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-12 18:47:15,052 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 61 [2018-04-12 18:47:15,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:47:15,054 INFO L225 Difference]: With dead ends: 1017 [2018-04-12 18:47:15,054 INFO L226 Difference]: Without dead ends: 976 [2018-04-12 18:47:15,054 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 43 SyntacticMatches, 8 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=294, Invalid=1773, Unknown=3, NotChecked=0, Total=2070 [2018-04-12 18:47:15,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2018-04-12 18:47:15,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 900. [2018-04-12 18:47:15,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2018-04-12 18:47:15,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1083 transitions. [2018-04-12 18:47:15,059 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1083 transitions. Word has length 61 [2018-04-12 18:47:15,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:47:15,059 INFO L459 AbstractCegarLoop]: Abstraction has 900 states and 1083 transitions. [2018-04-12 18:47:15,059 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-12 18:47:15,059 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1083 transitions. [2018-04-12 18:47:15,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-12 18:47:15,060 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:47:15,060 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:47:15,060 INFO L408 AbstractCegarLoop]: === Iteration 43 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:47:15,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1079948289, now seen corresponding path program 1 times [2018-04-12 18:47:15,060 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:47:15,060 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:47:15,061 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:47:15,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:47:15,061 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:47:15,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:47:15,078 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:47:15,532 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:47:15,532 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:47:15,532 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 18:47:15,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:47:15,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:47:15,561 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:47:15,580 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:15,581 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:15,581 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-12 18:47:15,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:15,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:15,585 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-04-12 18:47:15,606 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-12 18:47:15,607 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-12 18:47:15,607 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:15,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:15,612 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-12 18:47:15,612 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-04-12 18:47:15,640 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-12 18:47:15,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:47:15,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:15,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:15,649 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-12 18:47:15,649 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:43 [2018-04-12 18:47:15,706 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:15,706 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:15,707 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:15,707 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-12 18:47:15,707 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:15,717 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-12 18:47:15,717 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:68 [2018-04-12 18:47:15,754 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-12 18:47:15,756 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:15,756 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-12 18:47:15,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:15,763 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:15,774 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-12 18:47:15,774 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:82, output treesize:83 [2018-04-12 18:47:15,887 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:15,891 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 84 treesize of output 98 [2018-04-12 18:47:15,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 8 treesize of output 7 [2018-04-12 18:47:15,892 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:15,901 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:15,913 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-12 18:47:15,913 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:98, output treesize:90 [2018-04-12 18:47:15,957 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:15,958 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:15,959 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:15,959 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:15,959 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-12 18:47:15,960 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:15,982 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-12 18:47:15,983 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:121 [2018-04-12 18:47:16,039 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:16,044 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-12 18:47:16,047 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:16,048 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-12 18:47:16,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:16,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:16,083 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-12 18:47:16,083 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:134, output treesize:145 [2018-04-12 18:47:16,201 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:16,209 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 154 treesize of output 175 [2018-04-12 18:47:16,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 18:47:16,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:16,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:16,248 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-12 18:47:16,248 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:168, output treesize:154 [2018-04-12 18:47:16,315 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:16,316 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:16,317 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:16,317 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:16,318 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:16,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 156 [2018-04-12 18:47:16,319 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:16,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-12 18:47:16,347 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:165, output treesize:191 [2018-04-12 18:47:16,419 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:16,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 182 [2018-04-12 18:47:16,429 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:16,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 84 [2018-04-12 18:47:16,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:16,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:16,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-12 18:47:16,480 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:202, output treesize:204 [2018-04-12 18:47:16,663 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:16,664 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:16,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 253 treesize of output 247 [2018-04-12 18:47:16,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 8 treesize of output 7 [2018-04-12 18:47:16,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:16,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:16,729 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-12 18:47:16,730 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:267, output treesize:239 [2018-04-12 18:47:16,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 283 treesize of output 226 [2018-04-12 18:47:16,823 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:16,824 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 32 treesize of output 47 [2018-04-12 18:47:16,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:16,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:16,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-04-12 18:47:16,878 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:297, output treesize:285 [2018-04-12 18:47:17,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 266 treesize of output 157 [2018-04-12 18:47:17,061 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:17,062 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 6 [2018-04-12 18:47:17,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:17,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 53 [2018-04-12 18:47:17,083 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 18:47:17,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-12 18:47:17,101 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:17,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 43 [2018-04-12 18:47:17,117 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 18:47:17,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-12 18:47:17,132 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:17,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-12 18:47:17,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-12 18:47:17,159 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:277, output treesize:66 [2018-04-12 18:47:17,244 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:47:17,261 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:47:17,261 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26] total 45 [2018-04-12 18:47:17,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-04-12 18:47:17,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-04-12 18:47:17,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=1776, Unknown=0, NotChecked=0, Total=2070 [2018-04-12 18:47:17,262 INFO L87 Difference]: Start difference. First operand 900 states and 1083 transitions. Second operand 46 states. [2018-04-12 18:47:19,867 WARN L151 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 114 DAG size of output 106 [2018-04-12 18:47:22,726 WARN L151 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 192 DAG size of output 88 [2018-04-12 18:47:24,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:47:24,030 INFO L93 Difference]: Finished difference Result 1520 states and 1813 transitions. [2018-04-12 18:47:24,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-04-12 18:47:24,030 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 62 [2018-04-12 18:47:24,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:47:24,032 INFO L225 Difference]: With dead ends: 1520 [2018-04-12 18:47:24,032 INFO L226 Difference]: Without dead ends: 1520 [2018-04-12 18:47:24,033 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5563 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=2960, Invalid=14862, Unknown=0, NotChecked=0, Total=17822 [2018-04-12 18:47:24,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2018-04-12 18:47:24,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 872. [2018-04-12 18:47:24,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2018-04-12 18:47:24,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1047 transitions. [2018-04-12 18:47:24,041 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1047 transitions. Word has length 62 [2018-04-12 18:47:24,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:47:24,041 INFO L459 AbstractCegarLoop]: Abstraction has 872 states and 1047 transitions. [2018-04-12 18:47:24,042 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-04-12 18:47:24,042 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1047 transitions. [2018-04-12 18:47:24,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-12 18:47:24,042 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:47:24,042 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:47:24,042 INFO L408 AbstractCegarLoop]: === Iteration 44 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:47:24,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1079948288, now seen corresponding path program 1 times [2018-04-12 18:47:24,042 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:47:24,043 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:47:24,043 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:47:24,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:47:24,043 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:47:24,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:47:24,054 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:47:24,689 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:47:24,689 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:47:24,689 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 18:47:24,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:47:24,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:47:24,719 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:47:24,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 18:47:24,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:24,731 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:24,731 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:24,732 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-12 18:47:24,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:24,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:24,737 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2018-04-12 18:47:24,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 18:47:24,764 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-12 18:47:24,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:24,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:24,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 18:47:24,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:47:24,775 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:24,776 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:24,782 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-12 18:47:24,783 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:49, output treesize:50 [2018-04-12 18:47:24,798 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-12 18:47:24,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:47:24,799 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:24,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:24,817 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-12 18:47:24,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 18:47:24,818 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:24,822 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:24,829 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-12 18:47:24,829 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:96, output treesize:76 [2018-04-12 18:47:24,912 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:24,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-12 18:47:24,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:24,930 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:24,930 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:24,931 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:24,931 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-12 18:47:24,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:24,947 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-12 18:47:24,947 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:99, output treesize:106 [2018-04-12 18:47:24,998 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-12 18:47:25,000 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:25,002 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-12 18:47:25,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:25,008 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:25,035 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-12 18:47:25,037 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:25,038 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-12 18:47:25,038 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:25,047 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:25,066 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-12 18:47:25,067 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:131, output treesize:125 [2018-04-12 18:47:25,208 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:25,214 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 117 treesize of output 131 [2018-04-12 18:47:25,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 18:47:25,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:25,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:25,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 59 [2018-04-12 18:47:25,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-12 18:47:25,258 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:25,264 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:25,285 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-12 18:47:25,285 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:151, output treesize:143 [2018-04-12 18:47:25,342 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:25,343 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:25,343 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 0 case distinctions, treesize of input 27 treesize of output 58 [2018-04-12 18:47:25,344 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:25,375 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:25,376 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:25,376 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:25,377 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:25,377 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-12 18:47:25,377 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:25,408 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-12 18:47:25,408 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:160, output treesize:175 [2018-04-12 18:47:25,478 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 147 treesize of output 159 [2018-04-12 18:47:25,481 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:25,482 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-12 18:47:25,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:25,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:25,546 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 47 treesize of output 73 [2018-04-12 18:47:25,549 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:25,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-12 18:47:25,550 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:25,558 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:25,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 18:47:25,591 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:206, output treesize:201 [2018-04-12 18:47:25,749 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 215 treesize of output 236 [2018-04-12 18:47:25,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 14 treesize of output 13 [2018-04-12 18:47:25,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:25,776 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:25,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 120 [2018-04-12 18:47:25,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:47:25,822 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:25,832 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:25,865 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-12 18:47:25,865 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:247, output treesize:223 [2018-04-12 18:47:25,953 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:25,954 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:25,955 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:25,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 109 [2018-04-12 18:47:25,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:25,999 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:25,999 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:26,000 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:26,000 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:26,001 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:26,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 89 [2018-04-12 18:47:26,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:26,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-12 18:47:26,034 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:234, output treesize:220 [2018-04-12 18:47:26,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 196 treesize of output 187 [2018-04-12 18:47:26,132 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:26,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 97 [2018-04-12 18:47:26,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:26,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:26,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 120 [2018-04-12 18:47:26,213 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 18 treesize of output 11 [2018-04-12 18:47:26,213 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:26,224 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:26,259 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-12 18:47:26,259 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:242, output treesize:222 [2018-04-12 18:47:26,487 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:26,488 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:26,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 283 treesize of output 273 [2018-04-12 18:47:26,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:47:26,507 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:26,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:26,578 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:26,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 128 [2018-04-12 18:47:26,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-12 18:47:26,590 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:26,600 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:26,637 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-12 18:47:26,637 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:312, output treesize:304 [2018-04-12 18:47:26,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 357 treesize of output 284 [2018-04-12 18:47:26,744 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:26,745 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 32 treesize of output 47 [2018-04-12 18:47:26,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:26,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:26,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 159 [2018-04-12 18:47:26,840 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:26,841 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 39 [2018-04-12 18:47:26,842 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:26,855 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:26,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-04-12 18:47:26,898 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:375, output treesize:351 [2018-04-12 18:47:27,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 326 treesize of output 197 [2018-04-12 18:47:27,110 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:27,111 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 6 [2018-04-12 18:47:27,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:27,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-12 18:47:27,138 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:27,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 62 [2018-04-12 18:47:27,164 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-12 18:47:27,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-12 18:47:27,196 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:27,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 68 [2018-04-12 18:47:27,218 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 18:47:27,238 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-12 18:47:27,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, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 57 [2018-04-12 18:47:27,270 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:27,271 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-12 18:47:27,271 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:27,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-12 18:47:27,281 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:27,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-12 18:47:27,285 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:27,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 11 treesize of output 3 [2018-04-12 18:47:27,288 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:27,289 INFO L267 ElimStorePlain]: Start of recursive call 8: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:27,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-12 18:47:27,304 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 8 variables, input treesize:346, output treesize:48 [2018-04-12 18:47:27,399 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:47:27,416 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:47:27,417 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 45 [2018-04-12 18:47:27,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-04-12 18:47:27,417 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-04-12 18:47:27,417 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=1797, Unknown=0, NotChecked=0, Total=2070 [2018-04-12 18:47:27,417 INFO L87 Difference]: Start difference. First operand 872 states and 1047 transitions. Second operand 46 states. [2018-04-12 18:47:29,131 WARN L151 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 116 DAG size of output 108 [2018-04-12 18:47:29,765 WARN L151 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 120 DAG size of output 112 [2018-04-12 18:47:30,222 WARN L151 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 159 DAG size of output 140 [2018-04-12 18:47:31,334 WARN L151 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 126 DAG size of output 120 [2018-04-12 18:47:33,387 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 222 DAG size of output 115 [2018-04-12 18:47:34,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:47:34,900 INFO L93 Difference]: Finished difference Result 1446 states and 1720 transitions. [2018-04-12 18:47:34,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-04-12 18:47:34,900 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 62 [2018-04-12 18:47:34,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:47:34,902 INFO L225 Difference]: With dead ends: 1446 [2018-04-12 18:47:34,902 INFO L226 Difference]: Without dead ends: 1446 [2018-04-12 18:47:34,903 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3801 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=2287, Invalid=10823, Unknown=0, NotChecked=0, Total=13110 [2018-04-12 18:47:34,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2018-04-12 18:47:34,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 829. [2018-04-12 18:47:34,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2018-04-12 18:47:34,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 994 transitions. [2018-04-12 18:47:34,909 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 994 transitions. Word has length 62 [2018-04-12 18:47:34,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:47:34,909 INFO L459 AbstractCegarLoop]: Abstraction has 829 states and 994 transitions. [2018-04-12 18:47:34,909 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-04-12 18:47:34,909 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 994 transitions. [2018-04-12 18:47:34,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-12 18:47:34,910 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:47:34,910 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:47:34,910 INFO L408 AbstractCegarLoop]: === Iteration 45 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:47:34,910 INFO L82 PathProgramCache]: Analyzing trace with hash -518239810, now seen corresponding path program 1 times [2018-04-12 18:47:34,910 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:47:34,910 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:47:34,911 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:47:34,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:47:34,911 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:47:34,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:47:34,920 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:47:35,228 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:47:35,228 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:47:35,228 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 18:47:35,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:47:35,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:47:35,255 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:47:35,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:47:35,276 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:35,283 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:35,284 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:35,284 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-12 18:47:35,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:35,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:35,290 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-12 18:47:35,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12 18:47:35,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 18:47:35,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:35,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:35,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 18:47:35,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 18:47:35,321 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:35,322 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:35,328 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-12 18:47:35,329 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:48, output treesize:45 [2018-04-12 18:47:35,379 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:35,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 46 [2018-04-12 18:47:35,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 18:47:35,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:35,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:35,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-04-12 18:47:35,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-12 18:47:35,401 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:35,404 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:35,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:35,412 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:63 [2018-04-12 18:47:35,437 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 11 [2018-04-12 18:47:35,437 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:35,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:35,444 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:70, output treesize:57 [2018-04-12 18:47:35,468 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:35,469 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:35,469 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:35,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2018-04-12 18:47:35,470 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:35,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:35,483 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:68, output treesize:74 [2018-04-12 18:47:35,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 55 [2018-04-12 18:47:35,520 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:35,521 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-12 18:47:35,521 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:35,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:35,553 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 32 treesize of output 38 [2018-04-12 18:47:35,555 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:35,556 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-12 18:47:35,556 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:35,560 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:35,573 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-12 18:47:35,573 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:100, output treesize:92 [2018-04-12 18:47:35,639 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 50 treesize of output 77 [2018-04-12 18:47:35,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 18 treesize of output 17 [2018-04-12 18:47:35,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:35,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:35,665 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 135 treesize of output 108 [2018-04-12 18:47:35,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:47:35,667 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:35,676 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:35,688 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-12 18:47:35,689 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:167, output treesize:139 [2018-04-12 18:47:35,779 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 43 treesize of output 61 [2018-04-12 18:47:35,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-12 18:47:35,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:35,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-12 18:47:35,787 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:35,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-12 18:47:35,790 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:35,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:35,803 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-12 18:47:35,803 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:153, output treesize:114 [2018-04-12 18:47:35,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 68 [2018-04-12 18:47:35,879 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:35,880 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:35,880 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:47:35,881 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 38 treesize of output 31 [2018-04-12 18:47:35,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:35,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 5 treesize of output 1 [2018-04-12 18:47:35,889 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:35,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2018-04-12 18:47:35,894 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-12 18:47:35,897 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-12 18:47:35,903 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-12 18:47:35,903 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:115, output treesize:28 [2018-04-12 18:47:35,948 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:47:35,965 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:47:35,965 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2018-04-12 18:47:35,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-12 18:47:35,966 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-12 18:47:35,966 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1073, Unknown=0, NotChecked=0, Total=1190 [2018-04-12 18:47:35,966 INFO L87 Difference]: Start difference. First operand 829 states and 994 transitions. Second operand 35 states. [2018-04-12 18:47:38,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:47:38,899 INFO L93 Difference]: Finished difference Result 1181 states and 1396 transitions. [2018-04-12 18:47:38,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-12 18:47:38,899 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 62 [2018-04-12 18:47:38,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:47:38,901 INFO L225 Difference]: With dead ends: 1181 [2018-04-12 18:47:38,901 INFO L226 Difference]: Without dead ends: 1181 [2018-04-12 18:47:38,902 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1256 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=758, Invalid=4066, Unknown=6, NotChecked=0, Total=4830 [2018-04-12 18:47:38,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2018-04-12 18:47:38,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 829. [2018-04-12 18:47:38,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2018-04-12 18:47:38,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 990 transitions. [2018-04-12 18:47:38,907 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 990 transitions. Word has length 62 [2018-04-12 18:47:38,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:47:38,907 INFO L459 AbstractCegarLoop]: Abstraction has 829 states and 990 transitions. [2018-04-12 18:47:38,907 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-12 18:47:38,908 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 990 transitions. [2018-04-12 18:47:38,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-12 18:47:38,908 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:47:38,908 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:47:38,908 INFO L408 AbstractCegarLoop]: === Iteration 46 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:47:38,909 INFO L82 PathProgramCache]: Analyzing trace with hash -518239809, now seen corresponding path program 1 times [2018-04-12 18:47:38,909 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:47:38,909 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:47:38,909 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:47:38,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:47:38,910 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:47:38,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:47:38,919 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:47:39,229 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:47:39,229 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:47:39,229 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 18:47:39,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:47:39,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:47:39,252 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:47:39,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:47:39,272 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:39,280 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:39,280 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:39,280 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-12 18:47:39,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:39,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:39,287 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-12 18:47:39,306 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-12 18:47:39,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:47:39,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:39,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:39,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12 18:47:39,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-12 18:47:39,319 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:39,320 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:39,327 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-12 18:47:39,327 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:48, output treesize:45 [2018-04-12 18:47:39,383 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:39,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-04-12 18:47:39,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-12 18:47:39,387 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:39,391 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:39,401 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:39,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 57 [2018-04-12 18:47:39,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:47:39,422 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:39,429 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:39,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:39,437 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:63 [2018-04-12 18:47:39,500 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:39,500 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:39,501 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:39,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-12 18:47:39,501 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:39,516 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 37 [2018-04-12 18:47:39,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:39,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:39,528 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:84, output treesize:80 [2018-04-12 18:47:39,560 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 67 treesize of output 66 [2018-04-12 18:47:39,562 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:39,563 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-12 18:47:39,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:39,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:39,591 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 32 treesize of output 38 [2018-04-12 18:47:39,592 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:39,593 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-12 18:47:39,593 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:39,598 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:39,611 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-12 18:47:39,612 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:103, output treesize:108 [2018-04-12 18:47:39,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 142 [2018-04-12 18:47:39,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, 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-12 18:47:39,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:39,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:39,716 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 63 treesize of output 90 [2018-04-12 18:47:39,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 18 treesize of output 17 [2018-04-12 18:47:39,718 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:39,724 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:39,739 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-12 18:47:39,739 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:183, output treesize:155 [2018-04-12 18:47:39,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 129 [2018-04-12 18:47:39,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-12 18:47:39,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:39,939 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:47:39,939 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:39,940 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 55 treesize of output 40 [2018-04-12 18:47:39,941 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:39,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 50 [2018-04-12 18:47:39,953 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-12 18:47:39,963 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-12 18:47:39,978 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 44 treesize of output 44 [2018-04-12 18:47:39,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 15 treesize of output 5 [2018-04-12 18:47:39,979 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:39,986 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:47:39,986 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:39,986 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 19 [2018-04-12 18:47:39,987 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:39,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-12 18:47:39,991 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:39,992 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:39,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 18:47:39,999 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:189, output treesize:23 [2018-04-12 18:47:40,056 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:47:40,074 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:47:40,074 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2018-04-12 18:47:40,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-12 18:47:40,074 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-12 18:47:40,074 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1076, Unknown=1, NotChecked=0, Total=1190 [2018-04-12 18:47:40,074 INFO L87 Difference]: Start difference. First operand 829 states and 990 transitions. Second operand 35 states. [2018-04-12 18:47:43,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:47:43,330 INFO L93 Difference]: Finished difference Result 1175 states and 1379 transitions. [2018-04-12 18:47:43,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-12 18:47:43,330 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 62 [2018-04-12 18:47:43,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:47:43,333 INFO L225 Difference]: With dead ends: 1175 [2018-04-12 18:47:43,333 INFO L226 Difference]: Without dead ends: 1175 [2018-04-12 18:47:43,334 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1099 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=675, Invalid=3610, Unknown=5, NotChecked=0, Total=4290 [2018-04-12 18:47:43,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2018-04-12 18:47:43,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 829. [2018-04-12 18:47:43,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2018-04-12 18:47:43,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 986 transitions. [2018-04-12 18:47:43,341 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 986 transitions. Word has length 62 [2018-04-12 18:47:43,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:47:43,341 INFO L459 AbstractCegarLoop]: Abstraction has 829 states and 986 transitions. [2018-04-12 18:47:43,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-12 18:47:43,342 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 986 transitions. [2018-04-12 18:47:43,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-12 18:47:43,342 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:47:43,342 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:47:43,342 INFO L408 AbstractCegarLoop]: === Iteration 47 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:47:43,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1266248304, now seen corresponding path program 1 times [2018-04-12 18:47:43,342 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:47:43,342 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:47:43,343 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:47:43,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:47:43,343 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:47:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:47:43,350 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:47:43,450 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-12 18:47:43,450 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:47:43,450 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 18:47:43,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:47:43,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:47:43,479 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:47:43,483 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:43,484 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:43,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 18:47:43,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:43,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:43,488 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2018-04-12 18:47:43,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 18:47:43,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 18:47:43,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:43,495 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:43,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:43,499 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-04-12 18:47:43,554 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:43,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-04-12 18:47:43,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 18:47:43,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:43,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:43,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:43,573 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:27 [2018-04-12 18:47:43,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 43 [2018-04-12 18:47:43,600 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:43,601 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 24 treesize of output 35 [2018-04-12 18:47:43,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:43,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:43,615 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-12 18:47:43,615 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:45 [2018-04-12 18:47:43,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 32 [2018-04-12 18:47:43,680 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:43,693 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:43,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2018-04-12 18:47:43,694 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:43,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-04-12 18:47:43,701 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:43,704 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:43,707 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-12 18:47:43,707 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:52, output treesize:9 [2018-04-12 18:47:43,750 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-12 18:47:43,780 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:47:43,780 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 20 [2018-04-12 18:47:43,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-12 18:47:43,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-12 18:47:43,781 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2018-04-12 18:47:43,781 INFO L87 Difference]: Start difference. First operand 829 states and 986 transitions. Second operand 20 states. [2018-04-12 18:47:44,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:47:44,415 INFO L93 Difference]: Finished difference Result 919 states and 1074 transitions. [2018-04-12 18:47:44,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-12 18:47:44,415 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 63 [2018-04-12 18:47:44,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:47:44,417 INFO L225 Difference]: With dead ends: 919 [2018-04-12 18:47:44,417 INFO L226 Difference]: Without dead ends: 919 [2018-04-12 18:47:44,417 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=866, Unknown=0, NotChecked=0, Total=1056 [2018-04-12 18:47:44,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2018-04-12 18:47:44,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 811. [2018-04-12 18:47:44,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2018-04-12 18:47:44,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 963 transitions. [2018-04-12 18:47:44,425 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 963 transitions. Word has length 63 [2018-04-12 18:47:44,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:47:44,426 INFO L459 AbstractCegarLoop]: Abstraction has 811 states and 963 transitions. [2018-04-12 18:47:44,426 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-12 18:47:44,426 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 963 transitions. [2018-04-12 18:47:44,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-12 18:47:44,427 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:47:44,427 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:47:44,427 INFO L408 AbstractCegarLoop]: === Iteration 48 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:47:44,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1383646111, now seen corresponding path program 2 times [2018-04-12 18:47:44,427 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:47:44,427 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:47:44,428 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:47:44,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:47:44,428 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:47:44,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:47:44,435 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:47:44,524 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:47:44,525 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:47:44,525 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 18:47:44,530 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-12 18:47:44,549 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-12 18:47:44,549 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 18:47:44,551 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:47:44,591 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:44,591 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:44,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 18:47:44,591 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:44,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:44,595 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-12 18:47:44,608 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-12 18:47:44,609 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-12 18:47:44,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:44,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:44,615 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-12 18:47:44,615 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2018-04-12 18:47:44,664 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:44,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-04-12 18:47:44,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:47:44,667 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:44,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:44,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:44,674 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:27 [2018-04-12 18:47:44,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-04-12 18:47:44,698 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:44,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-12 18:47:44,699 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:44,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:44,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:44,708 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2018-04-12 18:47:44,729 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:44,730 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:44,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 18:47:44,730 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:44,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:44,735 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:35 [2018-04-12 18:47:44,758 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 35 treesize of output 32 [2018-04-12 18:47:44,760 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:44,762 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 21 treesize of output 23 [2018-04-12 18:47:44,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:44,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:44,772 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-12 18:47:44,772 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:37 [2018-04-12 18:47:44,841 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:44,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 76 [2018-04-12 18:47:44,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 77 [2018-04-12 18:47:44,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:44,879 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:44,880 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:47:44,890 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 4 case distinctions, treesize of input 47 treesize of output 72 [2018-04-12 18:47:44,890 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-04-12 18:47:44,916 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-12 18:47:44,936 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 3 xjuncts. [2018-04-12 18:47:44,937 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:72, output treesize:157 [2018-04-12 18:47:44,997 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:47:44,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 58 [2018-04-12 18:47:45,000 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:45,001 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 35 treesize of output 35 [2018-04-12 18:47:45,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:45,008 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:45,059 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 74 treesize of output 58 [2018-04-12 18:47:45,068 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:45,068 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:45,069 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:45,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, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 66 [2018-04-12 18:47:45,070 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:45,080 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:45,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 84 [2018-04-12 18:47:45,123 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:45,125 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 97 treesize of output 112 [2018-04-12 18:47:45,125 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:45,160 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:45,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-12 18:47:45,192 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:251, output treesize:206 [2018-04-12 18:47:45,414 WARN L151 SmtUtils]: Spent 174ms on a formula simplification. DAG size of input: 55 DAG size of output 42 [2018-04-12 18:47:45,486 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 59 treesize of output 44 [2018-04-12 18:47:45,487 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:47:45,488 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 28 treesize of output 28 [2018-04-12 18:47:45,488 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:45,495 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:45,496 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 30 treesize of output 16 [2018-04-12 18:47:45,496 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:45,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:45,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 72 [2018-04-12 18:47:45,522 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:47:45,523 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 62 treesize of output 64 [2018-04-12 18:47:45,523 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:45,546 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 58 treesize of output 40 [2018-04-12 18:47:45,546 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:45,565 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:47:45,565 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 54 treesize of output 54 [2018-04-12 18:47:45,565 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:45,583 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:45,584 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 34 treesize of output 27 [2018-04-12 18:47:45,584 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:45,591 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:45,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:45,596 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 9 variables, input treesize:160, output treesize:5 [2018-04-12 18:47:45,613 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:47:45,630 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:47:45,630 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20] total 32 [2018-04-12 18:47:45,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-12 18:47:45,630 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-12 18:47:45,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=925, Unknown=4, NotChecked=0, Total=1056 [2018-04-12 18:47:45,631 INFO L87 Difference]: Start difference. First operand 811 states and 963 transitions. Second operand 33 states. [2018-04-12 18:47:46,738 WARN L151 SmtUtils]: Spent 284ms on a formula simplification. DAG size of input: 89 DAG size of output 54 [2018-04-12 18:47:53,637 WARN L151 SmtUtils]: Spent 4113ms on a formula simplification. DAG size of input: 69 DAG size of output 67 [2018-04-12 18:47:54,086 WARN L151 SmtUtils]: Spent 343ms on a formula simplification. DAG size of input: 86 DAG size of output 51 [2018-04-12 18:47:54,262 WARN L151 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 92 DAG size of output 57 [2018-04-12 18:47:54,505 WARN L151 SmtUtils]: Spent 206ms on a formula simplification. DAG size of input: 50 DAG size of output 50 [2018-04-12 18:47:54,889 WARN L151 SmtUtils]: Spent 288ms on a formula simplification. DAG size of input: 89 DAG size of output 54 [2018-04-12 18:47:55,342 WARN L151 SmtUtils]: Spent 396ms on a formula simplification. DAG size of input: 47 DAG size of output 47 [2018-04-12 18:47:55,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:47:55,902 INFO L93 Difference]: Finished difference Result 1105 states and 1304 transitions. [2018-04-12 18:47:55,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-12 18:47:55,902 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2018-04-12 18:47:55,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:47:55,904 INFO L225 Difference]: With dead ends: 1105 [2018-04-12 18:47:55,904 INFO L226 Difference]: Without dead ends: 1105 [2018-04-12 18:47:55,905 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=589, Invalid=2917, Unknown=34, NotChecked=0, Total=3540 [2018-04-12 18:47:55,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2018-04-12 18:47:55,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 900. [2018-04-12 18:47:55,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2018-04-12 18:47:55,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1067 transitions. [2018-04-12 18:47:55,912 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1067 transitions. Word has length 64 [2018-04-12 18:47:55,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:47:55,912 INFO L459 AbstractCegarLoop]: Abstraction has 900 states and 1067 transitions. [2018-04-12 18:47:55,912 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-12 18:47:55,912 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1067 transitions. [2018-04-12 18:47:55,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-12 18:47:55,912 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:47:55,913 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:47:55,913 INFO L408 AbstractCegarLoop]: === Iteration 49 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:47:55,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1383646112, now seen corresponding path program 2 times [2018-04-12 18:47:55,913 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:47:55,913 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:47:55,914 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:47:55,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-12 18:47:55,914 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:47:55,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:47:55,919 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:47:56,142 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:47:56,143 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:47:56,143 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 18:47:56,149 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-12 18:47:56,169 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-12 18:47:56,169 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 18:47:56,172 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:47:56,220 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:56,221 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:56,222 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-12 18:47:56,222 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:56,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:56,229 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-12 18:47:56,252 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-12 18:47:56,254 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-12 18:47:56,254 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:56,256 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:56,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12 18:47:56,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 18:47:56,265 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:56,266 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:56,272 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-12 18:47:56,272 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-04-12 18:47:56,332 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:56,335 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 36 treesize of output 37 [2018-04-12 18:47:56,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-12 18:47:56,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:56,341 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:56,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-04-12 18:47:56,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-12 18:47:56,354 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:56,357 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:56,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:56,366 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:65, output treesize:57 [2018-04-12 18:47:56,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2018-04-12 18:47:56,429 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:56,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-12 18:47:56,430 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:56,436 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:56,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 38 [2018-04-12 18:47:56,456 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:56,457 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-12 18:47:56,457 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:56,462 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:56,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:56,474 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:90, output treesize:86 [2018-04-12 18:47:56,511 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:56,512 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 14 treesize of output 21 [2018-04-12 18:47:56,512 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:56,531 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:56,531 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:56,532 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:56,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-12 18:47:56,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:56,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:56,546 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:97, output treesize:93 [2018-04-12 18:47:56,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 75 [2018-04-12 18:47:56,586 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:56,587 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:56,588 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 0 case distinctions, treesize of input 21 treesize of output 33 [2018-04-12 18:47:56,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:56,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:56,620 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 43 [2018-04-12 18:47:56,622 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:56,624 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 25 treesize of output 31 [2018-04-12 18:47:56,625 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:56,630 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:56,643 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-12 18:47:56,643 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:115, output treesize:87 [2018-04-12 18:47:56,737 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:56,738 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:56,743 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 113 treesize of output 109 [2018-04-12 18:47:56,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 18:47:56,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:56,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:56,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2018-04-12 18:47:56,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-12 18:47:56,778 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:56,783 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:56,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 18:47:56,798 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:137, output treesize:121 [2018-04-12 18:47:56,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 80 [2018-04-12 18:47:56,847 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:56,848 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 39 [2018-04-12 18:47:56,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:56,857 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:56,882 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 175 treesize of output 132 [2018-04-12 18:47:56,884 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:56,885 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 32 treesize of output 47 [2018-04-12 18:47:56,885 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:56,899 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:56,916 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-12 18:47:56,916 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:200, output treesize:176 [2018-04-12 18:47:57,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 106 [2018-04-12 18:47:57,027 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:57,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 6 [2018-04-12 18:47:57,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:57,040 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:47:57,041 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 49 treesize of output 53 [2018-04-12 18:47:57,041 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:57,051 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 83 treesize of output 56 [2018-04-12 18:47:57,052 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-12 18:47:57,060 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-12 18:47:57,086 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 40 treesize of output 42 [2018-04-12 18:47:57,087 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:57,088 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-12 18:47:57,088 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:57,095 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:47:57,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-12 18:47:57,095 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:57,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-12 18:47:57,099 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:57,100 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:57,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 18:47:57,108 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:193, output treesize:21 [2018-04-12 18:47:57,202 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:47:57,218 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:47:57,218 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21] total 36 [2018-04-12 18:47:57,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-12 18:47:57,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-12 18:47:57,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1169, Unknown=9, NotChecked=0, Total=1332 [2018-04-12 18:47:57,219 INFO L87 Difference]: Start difference. First operand 900 states and 1067 transitions. Second operand 37 states. [2018-04-12 18:47:59,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:47:59,783 INFO L93 Difference]: Finished difference Result 1256 states and 1471 transitions. [2018-04-12 18:47:59,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-12 18:47:59,784 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 64 [2018-04-12 18:47:59,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:47:59,785 INFO L225 Difference]: With dead ends: 1256 [2018-04-12 18:47:59,786 INFO L226 Difference]: Without dead ends: 1256 [2018-04-12 18:47:59,786 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1350 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=785, Invalid=4290, Unknown=37, NotChecked=0, Total=5112 [2018-04-12 18:47:59,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2018-04-12 18:47:59,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 948. [2018-04-12 18:47:59,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2018-04-12 18:47:59,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1126 transitions. [2018-04-12 18:47:59,795 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1126 transitions. Word has length 64 [2018-04-12 18:47:59,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:47:59,795 INFO L459 AbstractCegarLoop]: Abstraction has 948 states and 1126 transitions. [2018-04-12 18:47:59,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-12 18:47:59,795 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1126 transitions. [2018-04-12 18:47:59,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-12 18:47:59,796 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:47:59,796 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:47:59,796 INFO L408 AbstractCegarLoop]: === Iteration 50 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:47:59,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1645597525, now seen corresponding path program 1 times [2018-04-12 18:47:59,797 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:47:59,797 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:47:59,798 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:47:59,798 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-12 18:47:59,798 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:47:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:47:59,807 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:47:59,902 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:47:59,902 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:47:59,902 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 18:47:59,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:47:59,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:47:59,924 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:47:59,928 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:59,929 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:59,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 18:47:59,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:59,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:59,932 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2018-04-12 18:47:59,935 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-12 18:47: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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 18:47:59,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:59,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:59,942 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-12 18:47:59,942 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:28 [2018-04-12 18:47:59,980 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:47:59,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-04-12 18:47:59,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 8 treesize of output 7 [2018-04-12 18:47:59,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:47:59,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:59,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:47:59,991 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:32 [2018-04-12 18:48:00,006 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:00,007 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:00,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 18:48:00,007 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:00,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:00,011 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:31 [2018-04-12 18:48:00,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-04-12 18:48:00,028 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:00,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-12 18:48:00,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:00,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:00,038 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-12 18:48:00,038 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:37 [2018-04-12 18:48:00,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 69 [2018-04-12 18:48:00,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 77 [2018-04-12 18:48:00,100 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:00,121 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:00,122 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:00,126 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 45 treesize of output 68 [2018-04-12 18:48:00,127 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-12 18:48:00,150 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:48:00,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-12 18:48:00,163 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:73, output treesize:101 [2018-04-12 18:48:00,290 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 48 treesize of output 30 [2018-04-12 18:48:00,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-04-12 18:48:00,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:00,294 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:00,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-12 18:48:00,295 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:00,297 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:00,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:00,312 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:115, output treesize:9 [2018-04-12 18:48:00,346 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:48:00,364 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:48:00,364 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 26 [2018-04-12 18:48:00,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-12 18:48:00,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-12 18:48:00,364 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2018-04-12 18:48:00,364 INFO L87 Difference]: Start difference. First operand 948 states and 1126 transitions. Second operand 26 states. [2018-04-12 18:48:04,735 WARN L151 SmtUtils]: Spent 4043ms on a formula simplification. DAG size of input: 51 DAG size of output 49 [2018-04-12 18:48:05,064 WARN L151 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 51 DAG size of output 49 [2018-04-12 18:48:05,206 WARN L151 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 78 DAG size of output 45 [2018-04-12 18:48:05,652 WARN L151 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 83 DAG size of output 50 [2018-04-12 18:48:05,856 WARN L151 SmtUtils]: Spent 185ms on a formula simplification. DAG size of input: 50 DAG size of output 46 [2018-04-12 18:48:06,172 WARN L148 SmtUtils]: Spent 193ms on a formula simplification that was a NOOP. DAG size: 41 [2018-04-12 18:48:06,381 WARN L151 SmtUtils]: Spent 168ms on a formula simplification. DAG size of input: 46 DAG size of output 44 [2018-04-12 18:48:06,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:48:06,591 INFO L93 Difference]: Finished difference Result 1148 states and 1363 transitions. [2018-04-12 18:48:06,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-12 18:48:06,591 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 66 [2018-04-12 18:48:06,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:48:06,592 INFO L225 Difference]: With dead ends: 1148 [2018-04-12 18:48:06,592 INFO L226 Difference]: Without dead ends: 1148 [2018-04-12 18:48:06,592 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=310, Invalid=1496, Unknown=0, NotChecked=0, Total=1806 [2018-04-12 18:48:06,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2018-04-12 18:48:06,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 948. [2018-04-12 18:48:06,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2018-04-12 18:48:06,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1123 transitions. [2018-04-12 18:48:06,598 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1123 transitions. Word has length 66 [2018-04-12 18:48:06,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:48:06,598 INFO L459 AbstractCegarLoop]: Abstraction has 948 states and 1123 transitions. [2018-04-12 18:48:06,598 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-12 18:48:06,598 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1123 transitions. [2018-04-12 18:48:06,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-12 18:48:06,598 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:48:06,598 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:48:06,598 INFO L408 AbstractCegarLoop]: === Iteration 51 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:48:06,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1909032369, now seen corresponding path program 1 times [2018-04-12 18:48:06,599 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:48:06,599 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:48:06,599 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:48:06,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:48:06,599 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:48:06,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:48:06,605 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:48:06,907 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:48:06,907 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:48:06,907 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 18:48:06,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:48:06,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:48:06,939 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:48:06,963 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:06,964 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:06,964 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-12 18:48:06,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:06,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:06,967 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-12 18:48:06,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 11 treesize of output 8 [2018-04-12 18:48:06,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, 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-12 18:48:06,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:06,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:06,990 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-12 18:48:06,991 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-04-12 18:48:07,039 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:07,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-04-12 18:48:07,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:48:07,043 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:07,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:07,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:07,051 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:24 [2018-04-12 18:48:07,090 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:07,090 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:07,091 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 17 treesize of output 21 [2018-04-12 18:48:07,091 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:07,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:07,098 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:33 [2018-04-12 18:48:07,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-04-12 18:48:07,143 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:07,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-12 18:48:07,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:07,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:07,159 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-12 18:48:07,159 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:45 [2018-04-12 18:48:07,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 66 [2018-04-12 18:48:07,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 63 [2018-04-12 18:48:07,226 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:07,249 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:07,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 47 [2018-04-12 18:48:07,257 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-12 18:48:07,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:48:07,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-12 18:48:07,285 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:68, output treesize:97 [2018-04-12 18:48:07,325 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:07,325 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:07,325 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:07,326 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 43 treesize of output 36 [2018-04-12 18:48:07,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:07,341 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:07,342 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:07,343 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:07,343 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 63 treesize of output 56 [2018-04-12 18:48:07,343 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:07,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-12 18:48:07,357 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:107, output treesize:93 [2018-04-12 18:48:07,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2018-04-12 18:48:07,396 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:07,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-04-12 18:48:07,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:07,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:07,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 79 [2018-04-12 18:48:07,439 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:07,443 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 69 treesize of output 77 [2018-04-12 18:48:07,443 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:07,478 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:07,485 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 3 case distinctions, treesize of input 58 treesize of output 70 [2018-04-12 18:48:07,486 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-12 18:48:07,512 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:48:07,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-04-12 18:48:07,540 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:125, output treesize:159 [2018-04-12 18:48:07,806 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:07,807 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:07,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 81 [2018-04-12 18:48:07,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 18:48:07,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:07,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:07,853 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:07,854 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:07,854 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:07,858 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 97 treesize of output 97 [2018-04-12 18:48:07,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:48:07,860 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:07,869 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:07,898 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:07,913 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 105 treesize of output 105 [2018-04-12 18:48:07,926 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 85 treesize of output 83 [2018-04-12 18:48:07,927 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-12 18:48:07,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, 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 85 [2018-04-12 18:48:07,990 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:08,026 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-04-12 18:48:08,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 7 dim-0 vars, and 5 xjuncts. [2018-04-12 18:48:08,073 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:284, output treesize:361 [2018-04-12 18:48:08,243 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 135 treesize of output 102 [2018-04-12 18:48:08,246 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:08,247 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 130 treesize of output 145 [2018-04-12 18:48:08,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:08,278 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:08,286 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 75 treesize of output 98 [2018-04-12 18:48:08,287 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-12 18:48:08,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-12 18:48:08,445 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:08,448 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 103 treesize of output 78 [2018-04-12 18:48:08,449 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:08,451 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 54 [2018-04-12 18:48:08,451 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 18:48:08,458 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 18:48:08,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 80 [2018-04-12 18:48:08,571 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:08,572 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 32 treesize of output 47 [2018-04-12 18:48:08,572 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:08,580 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:08,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 74 [2018-04-12 18:48:08,678 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:08,679 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:08,679 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:08,681 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 35 treesize of output 66 [2018-04-12 18:48:08,681 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:08,691 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:08,764 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:08,764 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:08,769 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 127 treesize of output 108 [2018-04-12 18:48:08,771 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:08,772 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 32 treesize of output 47 [2018-04-12 18:48:08,772 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:08,781 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:08,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 5 dim-2 vars, End of recursive call: 16 dim-0 vars, and 6 xjuncts. [2018-04-12 18:48:08,849 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 17 variables, input treesize:567, output treesize:565 [2018-04-12 18:48:09,428 WARN L151 SmtUtils]: Spent 456ms on a formula simplification. DAG size of input: 144 DAG size of output 99 [2018-04-12 18:48:09,796 WARN L148 SmtUtils]: Spent 312ms on a formula simplification that was a NOOP. DAG size: 99 [2018-04-12 18:48:09,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 90 [2018-04-12 18:48:09,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 59 [2018-04-12 18:48:09,863 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:09,907 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 76 treesize of output 67 [2018-04-12 18:48:09,907 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:09,945 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 45 treesize of output 36 [2018-04-12 18:48:09,945 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:09,990 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 2 case distinctions, treesize of input 59 treesize of output 71 [2018-04-12 18:48:09,991 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-04-12 18:48:10,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2018-04-12 18:48:10,048 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:10,111 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:10,112 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:10,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 77 [2018-04-12 18:48:10,117 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-12 18:48:10,195 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:10,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-04-12 18:48:10,196 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:10,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 12 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:10,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 59 [2018-04-12 18:48:10,261 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:10,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, 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 6 [2018-04-12 18:48:10,262 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:10,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-04-12 18:48:10,269 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:10,273 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:10,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2018-04-12 18:48:10,274 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:10,277 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:10,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 48 [2018-04-12 18:48:10,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-12 18:48:10,303 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:10,310 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:10,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 6 [2018-04-12 18:48:10,311 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:10,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-04-12 18:48:10,316 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:10,319 INFO L267 ElimStorePlain]: Start of recursive call 14: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:10,338 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:10,339 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:10,341 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 122 treesize of output 79 [2018-04-12 18:48:10,342 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:10,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 15 treesize of output 6 [2018-04-12 18:48:10,343 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:10,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2018-04-12 18:48:10,351 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:10,356 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 41 treesize of output 24 [2018-04-12 18:48:10,356 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:10,358 INFO L267 ElimStorePlain]: Start of recursive call 18: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:10,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 18 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:10,368 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 22 variables, input treesize:431, output treesize:5 [2018-04-12 18:48:10,426 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:48:10,443 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:48:10,444 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 42 [2018-04-12 18:48:10,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-12 18:48:10,444 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-12 18:48:10,444 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1631, Unknown=6, NotChecked=0, Total=1806 [2018-04-12 18:48:10,444 INFO L87 Difference]: Start difference. First operand 948 states and 1123 transitions. Second operand 43 states. [2018-04-12 18:48:12,653 WARN L151 SmtUtils]: Spent 386ms on a formula simplification. DAG size of input: 108 DAG size of output 96 [2018-04-12 18:48:13,588 WARN L151 SmtUtils]: Spent 207ms on a formula simplification. DAG size of input: 110 DAG size of output 108 [2018-04-12 18:48:13,925 WARN L151 SmtUtils]: Spent 289ms on a formula simplification. DAG size of input: 109 DAG size of output 99 [2018-04-12 18:48:15,902 WARN L151 SmtUtils]: Spent 1009ms on a formula simplification. DAG size of input: 126 DAG size of output 125 [2018-04-12 18:48:16,846 WARN L151 SmtUtils]: Spent 550ms on a formula simplification. DAG size of input: 183 DAG size of output 109 [2018-04-12 18:48:18,232 WARN L151 SmtUtils]: Spent 380ms on a formula simplification. DAG size of input: 186 DAG size of output 112 [2018-04-12 18:48:18,640 WARN L148 SmtUtils]: Spent 327ms on a formula simplification that was a NOOP. DAG size: 108 [2018-04-12 18:48:19,271 WARN L151 SmtUtils]: Spent 492ms on a formula simplification. DAG size of input: 115 DAG size of output 113 [2018-04-12 18:48:19,735 WARN L148 SmtUtils]: Spent 219ms on a formula simplification that was a NOOP. DAG size: 105 [2018-04-12 18:48:20,267 WARN L148 SmtUtils]: Spent 326ms on a formula simplification that was a NOOP. DAG size: 103 [2018-04-12 18:48:20,770 WARN L151 SmtUtils]: Spent 385ms on a formula simplification. DAG size of input: 117 DAG size of output 115 [2018-04-12 18:48:22,372 WARN L151 SmtUtils]: Spent 1238ms on a formula simplification. DAG size of input: 119 DAG size of output 117 [2018-04-12 18:48:22,891 WARN L151 SmtUtils]: Spent 377ms on a formula simplification. DAG size of input: 120 DAG size of output 119 [2018-04-12 18:48:22,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:48:22,931 INFO L93 Difference]: Finished difference Result 1630 states and 1943 transitions. [2018-04-12 18:48:22,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-04-12 18:48:22,931 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 67 [2018-04-12 18:48:22,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:48:22,932 INFO L225 Difference]: With dead ends: 1630 [2018-04-12 18:48:22,932 INFO L226 Difference]: Without dead ends: 1630 [2018-04-12 18:48:22,932 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2566 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=1342, Invalid=6944, Unknown=86, NotChecked=0, Total=8372 [2018-04-12 18:48:22,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1630 states. [2018-04-12 18:48:22,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1630 to 1110. [2018-04-12 18:48:22,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1110 states. [2018-04-12 18:48:22,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1309 transitions. [2018-04-12 18:48:22,938 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1309 transitions. Word has length 67 [2018-04-12 18:48:22,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:48:22,938 INFO L459 AbstractCegarLoop]: Abstraction has 1110 states and 1309 transitions. [2018-04-12 18:48:22,938 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-12 18:48:22,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1309 transitions. [2018-04-12 18:48:22,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-12 18:48:22,938 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:48:22,939 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:48:22,939 INFO L408 AbstractCegarLoop]: === Iteration 52 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:48:22,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1909032370, now seen corresponding path program 1 times [2018-04-12 18:48:22,939 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:48:22,939 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:48:22,939 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:48:22,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:48:22,939 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:48:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:48:22,945 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:48:23,205 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:48:23,205 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:48:23,206 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 18:48:23,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:48:23,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:48:23,230 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:48:23,234 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:23,235 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:23,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-12 18:48:23,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:23,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:23,240 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-12 18:48:23,258 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-12 18:48:23,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:48:23,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:23,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:23,268 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-12 18:48:23,276 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-12 18:48:23,276 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:23,277 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:23,283 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-12 18:48:23,283 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-04-12 18:48:23,338 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:23,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-04-12 18:48:23,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-12 18:48:23,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:23,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:23,354 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:23,356 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 47 treesize of output 48 [2018-04-12 18:48:23,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:48:23,358 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:23,363 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:23,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:23,370 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:62, output treesize:54 [2018-04-12 18:48:23,422 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:23,423 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:23,423 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:23,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2018-04-12 18:48:23,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:23,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 21 [2018-04-12 18:48:23,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:23,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:23,455 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:87 [2018-04-12 18:48:23,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 38 [2018-04-12 18:48:23,500 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:23,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12 18:48:23,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:23,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:23,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 70 [2018-04-12 18:48:23,532 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:23,533 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-12 18:48:23,533 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:23,541 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:23,557 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-12 18:48:23,557 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:118, output treesize:107 [2018-04-12 18:48:23,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 137 [2018-04-12 18:48:23,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 18:48:23,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:23,667 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:23,702 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 42 treesize of output 65 [2018-04-12 18:48:23,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:48:23,704 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:23,711 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:23,728 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-12 18:48:23,728 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:153, output treesize:133 [2018-04-12 18:48:23,784 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:23,784 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:23,786 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 0 case distinctions, treesize of input 29 treesize of output 60 [2018-04-12 18:48:23,786 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:23,809 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:23,810 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:23,810 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:23,811 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:23,811 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 27 treesize of output 43 [2018-04-12 18:48:23,811 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:23,831 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-12 18:48:23,831 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:144, output treesize:131 [2018-04-12 18:48:23,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 105 [2018-04-12 18:48:23,891 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:23,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 81 [2018-04-12 18:48:23,893 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:23,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:23,943 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 43 treesize of output 69 [2018-04-12 18:48:23,946 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 18 treesize of output 11 [2018-04-12 18:48:23,946 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:23,953 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:23,971 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-12 18:48:23,971 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:153, output treesize:129 [2018-04-12 18:48:24,100 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:24,100 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:24,109 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 186 treesize of output 171 [2018-04-12 18:48:24,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:48:24,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:24,132 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:24,156 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:24,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 73 [2018-04-12 18:48:24,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-12 18:48:24,162 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:24,169 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:24,190 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-12 18:48:24,191 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:207, output treesize:191 [2018-04-12 18:48:24,252 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 260 treesize of output 192 [2018-04-12 18:48:24,255 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:24,256 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 32 treesize of output 47 [2018-04-12 18:48:24,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:24,280 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:24,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 96 [2018-04-12 18:48:24,322 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:24,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 39 [2018-04-12 18:48:24,323 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:24,333 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:24,354 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-12 18:48:24,355 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:270, output treesize:246 [2018-04-12 18:48:24,521 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 243 treesize of output 141 [2018-04-12 18:48:24,523 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:24,525 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 6 [2018-04-12 18:48:24,525 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:24,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-12 18:48:24,552 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:24,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 26 [2018-04-12 18:48:24,570 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:24,583 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 60 [2018-04-12 18:48:24,584 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 18:48:24,595 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-12 18:48:24,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2018-04-12 18:48:24,614 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:24,615 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-12 18:48:24,615 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:24,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-12 18:48:24,621 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:24,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-12 18:48:24,625 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:24,626 INFO L267 ElimStorePlain]: Start of recursive call 7: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:24,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 18:48:24,636 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 7 variables, input treesize:260, output treesize:31 [2018-04-12 18:48:24,757 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:48:24,775 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:48:24,775 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22] total 38 [2018-04-12 18:48:24,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-12 18:48:24,775 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-12 18:48:24,775 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1344, Unknown=0, NotChecked=0, Total=1482 [2018-04-12 18:48:24,775 INFO L87 Difference]: Start difference. First operand 1110 states and 1309 transitions. Second operand 39 states. [2018-04-12 18:48:28,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:48:28,895 INFO L93 Difference]: Finished difference Result 1721 states and 2047 transitions. [2018-04-12 18:48:28,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-12 18:48:28,896 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 67 [2018-04-12 18:48:28,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:48:28,897 INFO L225 Difference]: With dead ends: 1721 [2018-04-12 18:48:28,897 INFO L226 Difference]: Without dead ends: 1721 [2018-04-12 18:48:28,898 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=633, Invalid=4479, Unknown=0, NotChecked=0, Total=5112 [2018-04-12 18:48:28,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2018-04-12 18:48:28,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1093. [2018-04-12 18:48:28,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1093 states. [2018-04-12 18:48:28,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 1093 states and 1289 transitions. [2018-04-12 18:48:28,905 INFO L78 Accepts]: Start accepts. Automaton has 1093 states and 1289 transitions. Word has length 67 [2018-04-12 18:48:28,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:48:28,905 INFO L459 AbstractCegarLoop]: Abstraction has 1093 states and 1289 transitions. [2018-04-12 18:48:28,905 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-12 18:48:28,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 1289 transitions. [2018-04-12 18:48:28,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-12 18:48:28,905 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:48:28,906 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:48:28,906 INFO L408 AbstractCegarLoop]: === Iteration 53 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:48:28,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1921252145, now seen corresponding path program 3 times [2018-04-12 18:48:28,906 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:48:28,906 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:48:28,906 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:48:28,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:48:28,906 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:48:28,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:48:28,911 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:48:29,033 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:48:29,033 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:48:29,033 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 18:48:29,039 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-12 18:48:29,087 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-12 18:48:29,088 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 18:48:29,090 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:48:29,146 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:29,146 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:29,147 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-12 18:48:29,147 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:29,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 18:48:29,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:29,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:29,157 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-04-12 18:48:29,175 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-12 18:48:29,176 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-12 18:48:29,176 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:29,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:29,187 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-12 18:48:29,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:48:29,188 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:29,189 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:29,195 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-12 18:48:29,195 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:41, output treesize:34 [2018-04-12 18:48:29,258 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:29,260 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 36 treesize of output 37 [2018-04-12 18:48:29,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 11 [2018-04-12 18:48:29,261 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:29,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:29,277 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 37 treesize of output 42 [2018-04-12 18:48:29,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-12 18:48:29,279 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:29,283 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:29,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:29,291 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:64, output treesize:64 [2018-04-12 18:48:29,319 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 106 treesize of output 96 [2018-04-12 18:48:29,320 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:29,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 51 [2018-04-12 18:48:29,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:29,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:29,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 83 [2018-04-12 18:48:29,343 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:29,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 51 [2018-04-12 18:48:29,343 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:29,350 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:29,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:29,359 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:116, output treesize:100 [2018-04-12 18:48:29,490 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:48:29,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 11 [2018-04-12 18:48:29,490 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:29,503 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-12 18:48:29,503 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:124, output treesize:108 [2018-04-12 18:48:29,542 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 111 treesize of output 88 [2018-04-12 18:48:29,543 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 65 treesize of output 76 [2018-04-12 18:48:29,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:29,551 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:29,551 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:48:29,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 83 [2018-04-12 18:48:29,553 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-12 18:48:29,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 18:48:29,569 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 54 treesize of output 40 [2018-04-12 18:48:29,570 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:48:29,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2018-04-12 18:48:29,570 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:29,576 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:29,576 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:48:29,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 18 treesize of output 13 [2018-04-12 18:48:29,577 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:29,579 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:29,583 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-12 18:48:29,583 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:131, output treesize:10 [2018-04-12 18:48:29,614 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:48:29,631 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:48:29,631 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 29 [2018-04-12 18:48:29,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-12 18:48:29,631 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-12 18:48:29,632 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=726, Unknown=1, NotChecked=0, Total=812 [2018-04-12 18:48:29,632 INFO L87 Difference]: Start difference. First operand 1093 states and 1289 transitions. Second operand 29 states. [2018-04-12 18:48:30,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:48:30,782 INFO L93 Difference]: Finished difference Result 1112 states and 1281 transitions. [2018-04-12 18:48:30,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-12 18:48:30,782 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 67 [2018-04-12 18:48:30,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:48:30,783 INFO L225 Difference]: With dead ends: 1112 [2018-04-12 18:48:30,783 INFO L226 Difference]: Without dead ends: 1112 [2018-04-12 18:48:30,784 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=367, Invalid=2082, Unknown=1, NotChecked=0, Total=2450 [2018-04-12 18:48:30,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2018-04-12 18:48:30,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 1061. [2018-04-12 18:48:30,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1061 states. [2018-04-12 18:48:30,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1233 transitions. [2018-04-12 18:48:30,794 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1233 transitions. Word has length 67 [2018-04-12 18:48:30,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:48:30,794 INFO L459 AbstractCegarLoop]: Abstraction has 1061 states and 1233 transitions. [2018-04-12 18:48:30,794 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-12 18:48:30,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1233 transitions. [2018-04-12 18:48:30,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-12 18:48:30,795 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:48:30,795 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:48:30,796 INFO L408 AbstractCegarLoop]: === Iteration 54 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:48:30,796 INFO L82 PathProgramCache]: Analyzing trace with hash 719858104, now seen corresponding path program 2 times [2018-04-12 18:48:30,796 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:48:30,796 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:48:30,797 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:48:30,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-12 18:48:30,797 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:48:30,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:48:30,808 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:48:31,129 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:48:31,129 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:48:31,129 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 18:48:31,134 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-12 18:48:31,155 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-12 18:48:31,155 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 18:48:31,157 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:48:31,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:48:31,163 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:31,171 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:31,172 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:31,172 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-12 18:48:31,172 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:31,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:31,188 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2018-04-12 18:48:31,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 18:48:31,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-12 18:48:31,213 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:31,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:31,224 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-12 18:48:31,225 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-12 18:48:31,226 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:31,227 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:31,235 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-12 18:48:31,235 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:48 [2018-04-12 18:48:31,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-04-12 18:48:31,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-12 18:48:31,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:31,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:31,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-04-12 18:48:31,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:48:31,317 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:31,321 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:31,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:31,329 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:59, output treesize:55 [2018-04-12 18:48:31,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 38 [2018-04-12 18:48:31,375 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:31,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-12 18:48:31,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:31,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:31,399 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 52 treesize of output 51 [2018-04-12 18:48:31,401 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:31,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-12 18:48:31,402 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:31,408 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:31,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:31,420 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:81, output treesize:77 [2018-04-12 18:48:31,457 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:31,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 19 [2018-04-12 18:48:31,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:31,480 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:31,480 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:31,482 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:31,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 42 [2018-04-12 18:48:31,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:31,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:31,501 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:94, output treesize:103 [2018-04-12 18:48:31,550 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 43 [2018-04-12 18:48:31,552 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:31,555 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 25 treesize of output 31 [2018-04-12 18:48:31,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:31,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:31,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 74 [2018-04-12 18:48:31,587 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:31,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-04-12 18:48:31,588 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:31,597 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:31,613 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-12 18:48:31,613 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:130, output treesize:101 [2018-04-12 18:48:31,735 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:31,735 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:31,740 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 133 treesize of output 125 [2018-04-12 18:48:31,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 18:48:31,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:31,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:31,776 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:31,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2018-04-12 18:48:31,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-12 18:48:31,782 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:31,788 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:31,805 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-12 18:48:31,806 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:159, output treesize:151 [2018-04-12 18:48:31,855 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:31,856 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:31,856 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 29 treesize of output 64 [2018-04-12 18:48:31,857 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:31,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:31,882 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:31,883 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:31,883 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:31,883 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 33 treesize of output 61 [2018-04-12 18:48:31,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:31,903 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-12 18:48:31,903 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:162, output treesize:153 [2018-04-12 18:48:31,954 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:31,960 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 147 treesize of output 129 [2018-04-12 18:48:31,962 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:31,963 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-12 18:48:31,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:31,982 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:32,015 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 49 treesize of output 91 [2018-04-12 18:48:32,017 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:32,018 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 39 [2018-04-12 18:48:32,018 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:32,026 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:32,050 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-12 18:48:32,050 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:179, output treesize:177 [2018-04-12 18:48:32,169 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 282 treesize of output 194 [2018-04-12 18:48:32,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-12 18:48:32,171 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:32,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:32,227 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 75 treesize of output 160 [2018-04-12 18:48:32,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-12 18:48:32,229 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:32,240 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:32,273 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-12 18:48:32,273 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:292, output treesize:256 [2018-04-12 18:48:32,407 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 7 new quantified variables, introduced 0 case distinctions, treesize of input 253 treesize of output 144 [2018-04-12 18:48:32,409 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:48:32,409 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 57 treesize of output 63 [2018-04-12 18:48:32,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:32,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 61 [2018-04-12 18:48:32,428 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-12 18:48:32,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-12 18:48:32,444 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:32,460 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:32,461 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-12 18:48:32,461 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 18:48:32,473 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-12 18:48:32,494 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 38 treesize of output 52 [2018-04-12 18:48:32,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-12 18:48:32,495 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:32,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-12 18:48:32,505 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:32,509 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:48:32,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-12 18:48:32,509 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:32,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-12 18:48:32,513 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:32,514 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:32,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 18:48:32,524 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:273, output treesize:34 [2018-04-12 18:48:32,625 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:48:32,643 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:48:32,644 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 39 [2018-04-12 18:48:32,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-12 18:48:32,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-12 18:48:32,644 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1365, Unknown=12, NotChecked=0, Total=1560 [2018-04-12 18:48:32,644 INFO L87 Difference]: Start difference. First operand 1061 states and 1233 transitions. Second operand 40 states. [2018-04-12 18:48:36,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:48:36,368 INFO L93 Difference]: Finished difference Result 1793 states and 2113 transitions. [2018-04-12 18:48:36,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-12 18:48:36,375 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 67 [2018-04-12 18:48:36,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:48:36,377 INFO L225 Difference]: With dead ends: 1793 [2018-04-12 18:48:36,377 INFO L226 Difference]: Without dead ends: 1793 [2018-04-12 18:48:36,377 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2033 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=939, Invalid=6168, Unknown=33, NotChecked=0, Total=7140 [2018-04-12 18:48:36,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1793 states. [2018-04-12 18:48:36,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1793 to 1033. [2018-04-12 18:48:36,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1033 states. [2018-04-12 18:48:36,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1198 transitions. [2018-04-12 18:48:36,384 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1198 transitions. Word has length 67 [2018-04-12 18:48:36,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:48:36,384 INFO L459 AbstractCegarLoop]: Abstraction has 1033 states and 1198 transitions. [2018-04-12 18:48:36,384 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-12 18:48:36,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1198 transitions. [2018-04-12 18:48:36,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-04-12 18:48:36,384 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:48:36,385 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:48:36,385 INFO L408 AbstractCegarLoop]: === Iteration 55 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:48:36,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1000066691, now seen corresponding path program 2 times [2018-04-12 18:48:36,385 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:48:36,385 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:48:36,385 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:48:36,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-12 18:48:36,385 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:48:36,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:48:36,391 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:48:36,648 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:48:36,648 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:48:36,648 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 18:48:36,653 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-12 18:48:36,676 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-12 18:48:36,676 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 18:48:36,678 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:48:36,735 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:36,736 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:36,736 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-12 18:48:36,736 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:36,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:36,744 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-12 18:48:36,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12 18:48:36,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-12 18:48:36,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:36,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:36,783 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-12 18:48:36,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 8 treesize of output 7 [2018-04-12 18:48:36,784 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:36,785 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:36,794 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-12 18:48:36,794 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-04-12 18:48:36,875 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:36,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-04-12 18:48:36,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 11 [2018-04-12 18:48:36,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:36,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:36,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2018-04-12 18:48:36,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-12 18:48:36,902 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:36,907 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:36,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:36,917 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:72, output treesize:69 [2018-04-12 18:48:36,955 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:36,956 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:36,957 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:36,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-12 18:48:36,957 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:36,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:36,968 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:74, output treesize:67 [2018-04-12 18:48:37,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 60 [2018-04-12 18:48:37,005 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:37,006 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 39 [2018-04-12 18:48:37,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:37,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:37,030 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 68 treesize of output 67 [2018-04-12 18:48:37,032 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:37,033 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 20 treesize of output 31 [2018-04-12 18:48:37,033 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:37,041 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:37,052 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-12 18:48:37,052 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:93, output treesize:79 [2018-04-12 18:48:37,119 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 156 treesize of output 150 [2018-04-12 18:48:37,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-12 18:48:37,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:37,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:37,153 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 139 treesize of output 112 [2018-04-12 18:48:37,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-12 18:48:37,155 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:37,163 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:37,173 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-12 18:48:37,174 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:167, output treesize:131 [2018-04-12 18:48:37,365 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:37,365 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:48:37,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 134 [2018-04-12 18:48:37,370 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:37,371 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:37,371 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:48:37,372 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 74 treesize of output 77 [2018-04-12 18:48:37,372 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-12 18:48:37,384 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:48:37,385 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 39 treesize of output 34 [2018-04-12 18:48:37,385 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-12 18:48:37,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-12 18:48:37,393 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:37,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 18:48:37,409 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 44 treesize of output 42 [2018-04-12 18:48:37,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, 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-12 18:48:37,411 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:37,422 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 18:48:37,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-04-12 18:48:37,423 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:37,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-04-12 18:48:37,427 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:37,429 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:37,434 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-12 18:48:37,434 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:164, output treesize:7 [2018-04-12 18:48:37,473 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:48:37,492 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:48:37,492 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 34 [2018-04-12 18:48:37,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-12 18:48:37,493 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-12 18:48:37,493 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=993, Unknown=1, NotChecked=0, Total=1122 [2018-04-12 18:48:37,493 INFO L87 Difference]: Start difference. First operand 1033 states and 1198 transitions. Second operand 34 states. [2018-04-12 18:48:39,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:48:39,947 INFO L93 Difference]: Finished difference Result 1151 states and 1314 transitions. [2018-04-12 18:48:39,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-12 18:48:39,947 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 70 [2018-04-12 18:48:39,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:48:39,949 INFO L225 Difference]: With dead ends: 1151 [2018-04-12 18:48:39,949 INFO L226 Difference]: Without dead ends: 1114 [2018-04-12 18:48:39,949 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1239 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=710, Invalid=3980, Unknown=2, NotChecked=0, Total=4692 [2018-04-12 18:48:39,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2018-04-12 18:48:39,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 1017. [2018-04-12 18:48:39,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1017 states. [2018-04-12 18:48:39,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1179 transitions. [2018-04-12 18:48:39,957 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1179 transitions. Word has length 70 [2018-04-12 18:48:39,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:48:39,957 INFO L459 AbstractCegarLoop]: Abstraction has 1017 states and 1179 transitions. [2018-04-12 18:48:39,957 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-12 18:48:39,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1179 transitions. [2018-04-12 18:48:39,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-04-12 18:48:39,958 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:48:39,958 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:48:39,958 INFO L408 AbstractCegarLoop]: === Iteration 56 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:48:39,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1641043558, now seen corresponding path program 2 times [2018-04-12 18:48:39,958 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:48:39,958 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:48:39,958 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:48:39,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-12 18:48:39,959 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:48:39,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:48:39,966 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:48:40,435 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:48:40,435 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:48:40,435 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 18:48:40,440 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-12 18:48:40,461 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-12 18:48:40,461 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 18:48:40,464 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:48:40,470 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:40,471 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:40,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-12 18:48:40,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:40,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:40,478 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-12 18:48:40,504 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-12 18:48:40,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:48:40,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:40,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:40,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12 18:48:40,517 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-12 18:48:40,517 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:40,521 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:40,528 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-12 18:48:40,529 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-04-12 18:48:40,611 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:40,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-04-12 18:48:40,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-12 18:48:40,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:40,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:40,629 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:40,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2018-04-12 18:48:40,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:48:40,632 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:40,638 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:40,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:40,647 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:65, output treesize:57 [2018-04-12 18:48:40,715 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:40,716 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:40,717 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:40,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2018-04-12 18:48:40,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:40,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 21 [2018-04-12 18:48:40,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:40,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:40,789 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:81, output treesize:90 [2018-04-12 18:48:40,841 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 32 treesize of output 38 [2018-04-12 18:48:40,843 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:40,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-12 18:48:40,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:40,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:40,875 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 71 treesize of output 70 [2018-04-12 18:48:40,877 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:40,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12 18:48:40,878 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:40,887 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:40,905 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-12 18:48:40,905 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:121, output treesize:110 [2018-04-12 18:48:41,015 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 42 treesize of output 65 [2018-04-12 18:48:41,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 14 treesize of output 13 [2018-04-12 18:48:41,017 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:41,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:41,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 127 [2018-04-12 18:48:41,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 18:48:41,051 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:41,065 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:41,084 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-12 18:48:41,084 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:156, output treesize:136 [2018-04-12 18:48:41,148 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:41,148 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:41,150 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 0 case distinctions, treesize of input 29 treesize of output 60 [2018-04-12 18:48:41,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:41,185 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:41,186 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:41,187 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:41,187 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:41,188 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 27 treesize of output 43 [2018-04-12 18:48:41,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:41,215 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-12 18:48:41,215 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:147, output treesize:134 [2018-04-12 18:48:41,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 105 [2018-04-12 18:48:41,291 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:41,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 81 [2018-04-12 18:48:41,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:41,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:41,402 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 43 treesize of output 69 [2018-04-12 18:48:41,406 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 18 treesize of output 11 [2018-04-12 18:48:41,406 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:41,417 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:41,442 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-12 18:48:41,443 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:161, output treesize:137 [2018-04-12 18:48:41,596 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:41,596 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:41,605 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 195 treesize of output 180 [2018-04-12 18:48:41,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:48:41,607 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:41,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:41,653 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:41,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 73 [2018-04-12 18:48:41,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-12 18:48:41,660 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:41,666 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:41,698 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-12 18:48:41,698 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:219, output treesize:211 [2018-04-12 18:48:41,761 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:41,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 109 [2018-04-12 18:48:41,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:41,797 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:41,798 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:41,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-04-12 18:48:41,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:41,824 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-12 18:48:41,824 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:225, output treesize:218 [2018-04-12 18:48:41,884 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:41,885 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:41,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 210 treesize of output 183 [2018-04-12 18:48:41,897 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:41,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-12 18:48:41,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:41,924 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:41,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 91 [2018-04-12 18:48:41,967 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:48:41,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 39 [2018-04-12 18:48:41,968 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:48:41,976 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:48:42,004 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-12 18:48:42,004 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:241, output treesize:244 [2018-04-12 18:48:42,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 12 case distinctions, treesize of input 302 treesize of output 254 [2018-04-12 18:48:42,178 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-04-12 18:48:42,235 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. Received shutdown request... [2018-04-12 18:59:15,388 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-12 18:59:15,388 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-12 18:59:15,391 WARN L197 ceAbstractionStarter]: Timeout [2018-04-12 18:59:15,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.04 06:59:15 BoogieIcfgContainer [2018-04-12 18:59:15,392 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-12 18:59:15,392 INFO L168 Benchmark]: Toolchain (without parser) took 841152.55 ms. Allocated memory was 392.2 MB in the beginning and 673.7 MB in the end (delta: 281.5 MB). Free memory was 329.2 MB in the beginning and 534.5 MB in the end (delta: -205.4 MB). Peak memory consumption was 281.1 MB. Max. memory is 5.3 GB. [2018-04-12 18:59:15,393 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 392.2 MB. Free memory is still 355.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-12 18:59:15,393 INFO L168 Benchmark]: CACSL2BoogieTranslator took 270.53 ms. Allocated memory is still 392.2 MB. Free memory was 327.9 MB in the beginning and 301.3 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 5.3 GB. [2018-04-12 18:59:15,394 INFO L168 Benchmark]: Boogie Preprocessor took 42.13 ms. Allocated memory is still 392.2 MB. Free memory was 301.3 MB in the beginning and 298.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 5.3 GB. [2018-04-12 18:59:15,394 INFO L168 Benchmark]: RCFGBuilder took 528.28 ms. Allocated memory was 392.2 MB in the beginning and 591.4 MB in the end (delta: 199.2 MB). Free memory was 298.6 MB in the beginning and 508.5 MB in the end (delta: -209.8 MB). Peak memory consumption was 25.2 MB. Max. memory is 5.3 GB. [2018-04-12 18:59:15,394 INFO L168 Benchmark]: TraceAbstraction took 840308.67 ms. Allocated memory was 591.4 MB in the beginning and 673.7 MB in the end (delta: 82.3 MB). Free memory was 508.5 MB in the beginning and 534.5 MB in the end (delta: -26.1 MB). Peak memory consumption was 261.1 MB. Max. memory is 5.3 GB. [2018-04-12 18:59:15,396 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.15 ms. Allocated memory is still 392.2 MB. Free memory is still 355.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 270.53 ms. Allocated memory is still 392.2 MB. Free memory was 327.9 MB in the beginning and 301.3 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.13 ms. Allocated memory is still 392.2 MB. Free memory was 301.3 MB in the beginning and 298.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 5.3 GB. * RCFGBuilder took 528.28 ms. Allocated memory was 392.2 MB in the beginning and 591.4 MB in the end (delta: 199.2 MB). Free memory was 298.6 MB in the beginning and 508.5 MB in the end (delta: -209.8 MB). Peak memory consumption was 25.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 840308.67 ms. Allocated memory was 591.4 MB in the beginning and 673.7 MB in the end (delta: 82.3 MB). Free memory was 508.5 MB in the beginning and 534.5 MB in the end (delta: -26.1 MB). Peak memory consumption was 261.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 997]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 1006]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 986]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 986). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 1007]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1007). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 1006]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 982]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 982). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 1007]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1007). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1008). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 997]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 1007]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1007). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 1007]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1007). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 986]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 986). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1008). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 2007. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 148 locations, 63 error locations. TIMEOUT Result, 840.2s OverallTime, 56 OverallIterations, 3 TraceHistogramMax, 145.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6061 SDtfs, 40081 SDslu, 58471 SDs, 0 SdLazy, 73949 SolverSat, 5869 SolverUnsat, 115 SolverUnknown, 0 SolverNotchecked, 43.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3934 GetRequests, 1541 SyntacticMatches, 146 SemanticMatches, 2247 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39963 ImplicationChecksByTransitivity, 127.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1110occurred in iteration=51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 55 MinimizatonAttempts, 12156 StatesRemovedByMinimization, 55 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 56.3s InterpolantComputationTime, 4488 NumberOfCodeBlocks, 4488 NumberOfCodeBlocksAsserted, 98 NumberOfCheckSat, 4398 ConstructedInterpolants, 880 QuantifiedInterpolants, 10271013 SizeOfPredicates, 560 NumberOfNonLiveVariables, 7200 ConjunctsInSsa, 1489 ConjunctsInUnsatCore, 90 InterpolantComputations, 21 PerfectInterpolantSequences, 48/726 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/sll-optional_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-12_18-59-15-402.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-optional_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-12_18-59-15-402.csv Completed graceful shutdown