java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-token_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-10 16:34:49,807 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-10 16:34:49,808 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-10 16:34:49,819 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-10 16:34:49,819 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-10 16:34:49,820 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-10 16:34:49,820 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-10 16:34:49,821 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-10 16:34:49,824 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-10 16:34:49,824 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-10 16:34:49,825 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-10 16:34:49,825 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-10 16:34:49,826 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-10 16:34:49,827 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-10 16:34:49,828 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-10 16:34:49,829 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-10 16:34:49,831 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-10 16:34:49,832 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-10 16:34:49,833 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-10 16:34:49,834 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-10 16:34:49,835 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-10 16:34:49,835 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-10 16:34:49,836 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-10 16:34:49,836 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-10 16:34:49,837 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-10 16:34:49,838 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-10 16:34:49,838 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-10 16:34:49,839 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-10 16:34:49,839 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-10 16:34:49,839 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-10 16:34:49,840 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-10 16:34:49,840 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-04-10 16:34:49,858 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-10 16:34:49,859 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-10 16:34:49,859 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-10 16:34:49,860 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-10 16:34:49,860 INFO L133 SettingsManager]: * Use SBE=true [2018-04-10 16:34:49,860 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-10 16:34:49,860 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-10 16:34:49,860 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-10 16:34:49,860 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-10 16:34:49,861 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-10 16:34:49,861 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-10 16:34:49,861 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-10 16:34:49,861 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-10 16:34:49,861 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-10 16:34:49,861 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-10 16:34:49,862 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-10 16:34:49,862 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-10 16:34:49,862 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-10 16:34:49,862 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-10 16:34:49,862 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 16:34:49,862 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-10 16:34:49,863 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-10 16:34:49,863 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-10 16:34:49,863 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-04-10 16:34:49,894 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-10 16:34:49,904 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-10 16:34:49,907 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-10 16:34:49,908 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-10 16:34:49,909 INFO L276 PluginConnector]: CDTParser initialized [2018-04-10 16:34:49,909 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,186 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG83fb893f1 [2018-04-10 16:34:50,350 INFO L287 CDTParser]: IsIndexed: true [2018-04-10 16:34:50,350 INFO L288 CDTParser]: Found 1 translation units. [2018-04-10 16:34:50,351 INFO L168 CDTParser]: Scanning dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,359 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-10 16:34:50,359 INFO L215 ultiparseSymbolTable]: [2018-04-10 16:34:50,359 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-10 16:34:50,359 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,359 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-10 16:34:50,359 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____int8_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,360 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__register_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,360 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__timer_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,360 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____nlink_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,360 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__pthread_once_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,360 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__off_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,360 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__idtype_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,360 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____mode_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,360 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____ssize_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,360 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____intptr_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,360 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____sig_atomic_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,360 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__int32_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,360 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__pid_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,360 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__fsfilcnt_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,360 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____uint64_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,360 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____blkcnt64_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,361 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__id_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,361 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__gid_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,361 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__ssize_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,361 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____fsword_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,361 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__u_short in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,361 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____uid_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,361 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__nlink_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,361 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__uint in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,361 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____daddr_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,361 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__mode_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,361 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__SLL in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,361 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____clock_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,361 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____u_short in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,361 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__int64_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,361 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__pthread_mutex_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,362 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__suseconds_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,362 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__pthread_condattr_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,362 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__dev_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,362 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____syscall_slong_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,362 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____blkcnt_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,362 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__time_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,362 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__fsid_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,362 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____u_int in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,362 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____loff_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,362 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__pthread_rwlock_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,362 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____int64_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,362 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____blksize_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,362 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__int8_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,363 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____qaddr_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,363 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____fsblkcnt_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,363 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__ino_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,363 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____uint16_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,363 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____useconds_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,363 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____fsfilcnt64_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,363 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____rlim64_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,363 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____fsfilcnt_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,363 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__ushort in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,363 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__ldiv_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,363 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____time_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,363 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____uint8_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,364 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____key_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,364 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__u_quad_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,364 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__u_int64_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,364 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__loff_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,364 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__ulong in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,364 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____u_long in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,364 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__pthread_barrierattr_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,364 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____int16_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,364 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__sigset_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,364 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__u_int32_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,365 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__u_char in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,365 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__blkcnt_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,365 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__pthread_key_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,365 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__daddr_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,365 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__blksize_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,365 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____ino64_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,365 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____off_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,365 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__u_long in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,365 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____dev_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,365 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____caddr_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,366 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__fd_set in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,366 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__clock_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,366 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__pthread_rwlockattr_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,366 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__fd_mask in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,366 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____sigset_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,366 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____ino_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,366 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____fsid_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,366 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__pthread_spinlock_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,366 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__clockid_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,366 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__u_int16_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,366 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____clockid_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,367 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__caddr_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,367 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____int32_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,367 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__div_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,367 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__u_int in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,367 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__fsblkcnt_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,367 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____rlim_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,367 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__u_int8_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,367 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____uint32_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,367 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__uid_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,367 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__key_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,367 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__pthread_cond_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,367 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__size_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,368 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__quad_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,368 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____fd_mask in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,368 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____pthread_slist_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,368 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____gid_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,368 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____syscall_ulong_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,368 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__pthread_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,368 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____id_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,368 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__int16_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,368 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____u_quad_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,368 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__wchar_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,368 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____timer_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,368 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____socklen_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,368 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__lldiv_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,368 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__pthread_attr_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,369 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__pthread_barrier_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,369 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__pthread_mutexattr_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,369 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____pid_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,369 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____quad_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,369 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____fsblkcnt64_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,369 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____u_char in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,369 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____off64_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,369 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____suseconds_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:50,383 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG83fb893f1 [2018-04-10 16:34:50,385 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-10 16:34:50,386 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-10 16:34:50,387 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-10 16:34:50,387 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-10 16:34:50,391 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-10 16:34:50,391 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 04:34:50" (1/1) ... [2018-04-10 16:34:50,393 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@338305e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:34:50, skipping insertion in model container [2018-04-10 16:34:50,393 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 04:34:50" (1/1) ... [2018-04-10 16:34:50,404 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 16:34:50,428 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 16:34:50,548 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 16:34:50,585 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 16:34:50,590 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 115 non ball SCCs. Number of states in SCCs 115. [2018-04-10 16:34:50,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:34:50 WrapperNode [2018-04-10 16:34:50,623 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-10 16:34:50,624 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-10 16:34:50,624 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-10 16:34:50,624 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-10 16:34:50,633 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:34:50" (1/1) ... [2018-04-10 16:34:50,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:34:50" (1/1) ... [2018-04-10 16:34:50,645 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:34:50" (1/1) ... [2018-04-10 16:34:50,645 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:34:50" (1/1) ... [2018-04-10 16:34:50,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:34:50" (1/1) ... [2018-04-10 16:34:50,660 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:34:50" (1/1) ... [2018-04-10 16:34:50,663 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:34:50" (1/1) ... [2018-04-10 16:34:50,666 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-10 16:34:50,667 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-10 16:34:50,667 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-10 16:34:50,667 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-10 16:34:50,668 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:34:50" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 16:34:50,749 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-10 16:34:50,749 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-10 16:34:50,749 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-10 16:34:50,749 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-10 16:34:50,749 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-10 16:34:50,749 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-10 16:34:50,750 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-10 16:34:50,750 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-10 16:34:50,750 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-10 16:34:50,750 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-10 16:34:50,750 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-10 16:34:50,750 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-10 16:34:50,750 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-10 16:34:50,750 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-10 16:34:50,750 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-10 16:34:50,750 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-10 16:34:50,750 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-10 16:34:50,751 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-10 16:34:50,751 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-10 16:34:50,751 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-10 16:34:50,751 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-10 16:34:50,751 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-10 16:34:50,751 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-10 16:34:50,751 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-10 16:34:50,752 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-10 16:34:50,752 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-10 16:34:50,752 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-10 16:34:50,752 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-10 16:34:50,752 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-10 16:34:50,752 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-10 16:34:50,752 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-10 16:34:50,752 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-10 16:34:50,752 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-10 16:34:50,752 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-10 16:34:50,753 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-10 16:34:50,753 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-10 16:34:50,753 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-10 16:34:50,753 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-10 16:34:50,753 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-10 16:34:50,753 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-10 16:34:50,753 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-10 16:34:50,753 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-10 16:34:50,753 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-10 16:34:50,754 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-10 16:34:50,754 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-10 16:34:50,754 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-10 16:34:50,754 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-10 16:34:50,754 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-10 16:34:50,754 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-10 16:34:50,754 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-10 16:34:50,754 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-10 16:34:50,754 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-10 16:34:50,755 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-10 16:34:50,755 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-10 16:34:50,755 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-10 16:34:50,755 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-10 16:34:50,755 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-10 16:34:50,755 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-10 16:34:50,755 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-10 16:34:50,755 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-10 16:34:50,755 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-10 16:34:50,755 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-10 16:34:50,756 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-10 16:34:50,756 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-10 16:34:50,756 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-10 16:34:50,756 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-10 16:34:50,756 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-10 16:34:50,756 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-10 16:34:50,756 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-10 16:34:50,756 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-10 16:34:50,756 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-10 16:34:50,756 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-10 16:34:50,757 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-10 16:34:50,757 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-10 16:34:50,757 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-10 16:34:50,757 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-10 16:34:50,757 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-10 16:34:50,757 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-10 16:34:50,757 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-10 16:34:50,757 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-10 16:34:50,757 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-10 16:34:50,757 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-10 16:34:50,758 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-10 16:34:50,758 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-10 16:34:50,758 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-10 16:34:50,758 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-10 16:34:50,758 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-10 16:34:50,758 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-10 16:34:50,758 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-10 16:34:50,758 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-10 16:34:50,758 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-10 16:34:50,758 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-10 16:34:50,759 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-10 16:34:50,759 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-10 16:34:50,759 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-10 16:34:50,759 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-10 16:34:50,759 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-10 16:34:50,759 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-10 16:34:50,759 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-10 16:34:50,759 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-10 16:34:50,759 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-10 16:34:50,759 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-10 16:34:50,759 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-10 16:34:50,760 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-10 16:34:50,760 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-10 16:34:50,760 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-10 16:34:50,760 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-10 16:34:50,760 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-10 16:34:50,760 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-10 16:34:50,760 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-10 16:34:50,760 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-10 16:34:50,760 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-10 16:34:50,760 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-10 16:34:50,761 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-10 16:34:50,761 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-10 16:34:50,761 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-10 16:34:50,761 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-10 16:34:50,761 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-10 16:34:51,115 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-10 16:34:51,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 04:34:51 BoogieIcfgContainer [2018-04-10 16:34:51,116 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-10 16:34:51,117 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-10 16:34:51,117 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-10 16:34:51,119 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-10 16:34:51,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.04 04:34:50" (1/3) ... [2018-04-10 16:34:51,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@668a92fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 04:34:51, skipping insertion in model container [2018-04-10 16:34:51,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:34:50" (2/3) ... [2018-04-10 16:34:51,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@668a92fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 04:34:51, skipping insertion in model container [2018-04-10 16:34:51,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 04:34:51" (3/3) ... [2018-04-10 16:34:51,121 INFO L107 eAbstractionObserver]: Analyzing ICFG dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:34:51,128 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-10 16:34:51,135 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-04-10 16:34:51,160 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-10 16:34:51,160 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-10 16:34:51,160 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-10 16:34:51,160 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-10 16:34:51,160 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-10 16:34:51,160 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-10 16:34:51,161 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-10 16:34:51,161 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-10 16:34:51,161 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-10 16:34:51,161 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-10 16:34:51,172 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states. [2018-04-10 16:34:51,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-10 16:34:51,179 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:34:51,180 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:34:51,180 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:34:51,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1243505339, now seen corresponding path program 1 times [2018-04-10 16:34:51,184 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:34:51,184 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:34:51,222 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:34:51,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:34:51,223 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:34:51,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:34:51,252 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:34:51,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:34:51,294 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:34:51,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 16:34:51,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 16:34:51,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 16:34:51,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 16:34:51,305 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 4 states. [2018-04-10 16:34:51,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:34:51,499 INFO L93 Difference]: Finished difference Result 162 states and 165 transitions. [2018-04-10 16:34:51,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 16:34:51,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-10 16:34:51,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:34:51,509 INFO L225 Difference]: With dead ends: 162 [2018-04-10 16:34:51,509 INFO L226 Difference]: Without dead ends: 159 [2018-04-10 16:34:51,511 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:34:51,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-04-10 16:34:51,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 131. [2018-04-10 16:34:51,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-04-10 16:34:51,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 133 transitions. [2018-04-10 16:34:51,542 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 133 transitions. Word has length 8 [2018-04-10 16:34:51,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:34:51,542 INFO L459 AbstractCegarLoop]: Abstraction has 131 states and 133 transitions. [2018-04-10 16:34:51,543 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 16:34:51,543 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 133 transitions. [2018-04-10 16:34:51,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-10 16:34:51,543 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:34:51,543 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:34:51,543 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:34:51,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1243505338, now seen corresponding path program 1 times [2018-04-10 16:34:51,543 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:34:51,543 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:34:51,545 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:34:51,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:34:51,545 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:34:51,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:34:51,559 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:34:51,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:34:51,595 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:34:51,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 16:34:51,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 16:34:51,597 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 16:34:51,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 16:34:51,597 INFO L87 Difference]: Start difference. First operand 131 states and 133 transitions. Second operand 4 states. [2018-04-10 16:34:51,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:34:51,727 INFO L93 Difference]: Finished difference Result 156 states and 158 transitions. [2018-04-10 16:34:51,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 16:34:51,727 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-10 16:34:51,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:34:51,729 INFO L225 Difference]: With dead ends: 156 [2018-04-10 16:34:51,729 INFO L226 Difference]: Without dead ends: 156 [2018-04-10 16:34:51,730 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:34:51,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-04-10 16:34:51,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 128. [2018-04-10 16:34:51,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-10 16:34:51,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 130 transitions. [2018-04-10 16:34:51,736 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 130 transitions. Word has length 8 [2018-04-10 16:34:51,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:34:51,736 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 130 transitions. [2018-04-10 16:34:51,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 16:34:51,737 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 130 transitions. [2018-04-10 16:34:51,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-10 16:34:51,737 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:34:51,737 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:34:51,737 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:34:51,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1332672851, now seen corresponding path program 1 times [2018-04-10 16:34:51,738 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:34:51,738 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:34:51,739 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:34:51,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:34:51,739 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:34:51,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:34:51,755 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:34:51,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:34:51,784 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:34:51,784 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 16:34:51,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 16:34:51,784 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 16:34:51,785 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 16:34:51,785 INFO L87 Difference]: Start difference. First operand 128 states and 130 transitions. Second operand 4 states. [2018-04-10 16:34:51,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:34:51,927 INFO L93 Difference]: Finished difference Result 132 states and 135 transitions. [2018-04-10 16:34:51,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:34:51,927 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-04-10 16:34:51,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:34:51,928 INFO L225 Difference]: With dead ends: 132 [2018-04-10 16:34:51,928 INFO L226 Difference]: Without dead ends: 132 [2018-04-10 16:34:51,928 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:34:51,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-04-10 16:34:51,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 117. [2018-04-10 16:34:51,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-04-10 16:34:51,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 121 transitions. [2018-04-10 16:34:51,934 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 121 transitions. Word has length 15 [2018-04-10 16:34:51,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:34:51,935 INFO L459 AbstractCegarLoop]: Abstraction has 117 states and 121 transitions. [2018-04-10 16:34:51,935 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 16:34:51,935 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2018-04-10 16:34:51,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-10 16:34:51,935 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:34:51,935 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:34:51,935 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:34:51,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1332672852, now seen corresponding path program 1 times [2018-04-10 16:34:51,936 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:34:51,936 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:34:51,937 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:34:51,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:34:51,937 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:34:51,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:34:51,949 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:34:52,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:34:52,005 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:34:52,005 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:34:52,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:34:52,006 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:34:52,006 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:34:52,006 INFO L87 Difference]: Start difference. First operand 117 states and 121 transitions. Second operand 5 states. [2018-04-10 16:34:52,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:34:52,179 INFO L93 Difference]: Finished difference Result 205 states and 209 transitions. [2018-04-10 16:34:52,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:34:52,179 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-04-10 16:34:52,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:34:52,180 INFO L225 Difference]: With dead ends: 205 [2018-04-10 16:34:52,181 INFO L226 Difference]: Without dead ends: 205 [2018-04-10 16:34:52,181 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-10 16:34:52,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-04-10 16:34:52,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 158. [2018-04-10 16:34:52,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-10 16:34:52,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 169 transitions. [2018-04-10 16:34:52,189 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 169 transitions. Word has length 15 [2018-04-10 16:34:52,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:34:52,189 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 169 transitions. [2018-04-10 16:34:52,189 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:34:52,189 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 169 transitions. [2018-04-10 16:34:52,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-10 16:34:52,190 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:34:52,190 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:34:52,190 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:34:52,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1020098763, now seen corresponding path program 1 times [2018-04-10 16:34:52,190 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:34:52,190 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:34:52,192 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:34:52,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:34:52,192 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:34:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:34:52,204 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:34:52,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:34:52,234 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:34:52,234 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:34:52,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:34:52,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:34:52,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:34:52,235 INFO L87 Difference]: Start difference. First operand 158 states and 169 transitions. Second operand 5 states. [2018-04-10 16:34:52,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:34:52,398 INFO L93 Difference]: Finished difference Result 225 states and 236 transitions. [2018-04-10 16:34:52,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:34:52,399 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-10 16:34:52,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:34:52,400 INFO L225 Difference]: With dead ends: 225 [2018-04-10 16:34:52,400 INFO L226 Difference]: Without dead ends: 225 [2018-04-10 16:34:52,400 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-10 16:34:52,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-04-10 16:34:52,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 157. [2018-04-10 16:34:52,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-04-10 16:34:52,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 167 transitions. [2018-04-10 16:34:52,405 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 167 transitions. Word has length 18 [2018-04-10 16:34:52,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:34:52,406 INFO L459 AbstractCegarLoop]: Abstraction has 157 states and 167 transitions. [2018-04-10 16:34:52,406 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:34:52,406 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 167 transitions. [2018-04-10 16:34:52,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-10 16:34:52,406 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:34:52,406 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:34:52,407 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:34:52,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1020098762, now seen corresponding path program 1 times [2018-04-10 16:34:52,407 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:34:52,407 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:34:52,408 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:34:52,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:34:52,409 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:34:52,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:34:52,420 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:34:52,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:34:52,453 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:34:52,453 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:34:52,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:34:52,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:34:52,454 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:34:52,454 INFO L87 Difference]: Start difference. First operand 157 states and 167 transitions. Second operand 5 states. [2018-04-10 16:34:52,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:34:52,630 INFO L93 Difference]: Finished difference Result 255 states and 267 transitions. [2018-04-10 16:34:52,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 16:34:52,631 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-10 16:34:52,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:34:52,631 INFO L225 Difference]: With dead ends: 255 [2018-04-10 16:34:52,631 INFO L226 Difference]: Without dead ends: 255 [2018-04-10 16:34:52,631 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-10 16:34:52,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-04-10 16:34:52,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 156. [2018-04-10 16:34:52,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-04-10 16:34:52,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 165 transitions. [2018-04-10 16:34:52,635 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 165 transitions. Word has length 18 [2018-04-10 16:34:52,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:34:52,635 INFO L459 AbstractCegarLoop]: Abstraction has 156 states and 165 transitions. [2018-04-10 16:34:52,635 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:34:52,635 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 165 transitions. [2018-04-10 16:34:52,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-10 16:34:52,635 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:34:52,635 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-10 16:34:52,635 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:34:52,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1578271401, now seen corresponding path program 1 times [2018-04-10 16:34:52,636 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:34:52,636 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:34:52,636 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:34:52,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:34:52,636 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:34:52,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:34:52,643 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:34:52,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:34:52,667 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:34:52,667 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:34:52,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:34:52,667 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:34:52,667 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:34:52,667 INFO L87 Difference]: Start difference. First operand 156 states and 165 transitions. Second operand 5 states. [2018-04-10 16:34:52,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:34:52,745 INFO L93 Difference]: Finished difference Result 159 states and 165 transitions. [2018-04-10 16:34:52,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:34:52,745 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-04-10 16:34:52,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:34:52,746 INFO L225 Difference]: With dead ends: 159 [2018-04-10 16:34:52,746 INFO L226 Difference]: Without dead ends: 159 [2018-04-10 16:34:52,746 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-10 16:34:52,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-04-10 16:34:52,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 155. [2018-04-10 16:34:52,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-04-10 16:34:52,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 163 transitions. [2018-04-10 16:34:52,750 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 163 transitions. Word has length 19 [2018-04-10 16:34:52,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:34:52,750 INFO L459 AbstractCegarLoop]: Abstraction has 155 states and 163 transitions. [2018-04-10 16:34:52,750 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:34:52,750 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 163 transitions. [2018-04-10 16:34:52,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-10 16:34:52,750 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:34:52,750 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-10 16:34:52,750 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:34:52,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1578271400, now seen corresponding path program 1 times [2018-04-10 16:34:52,751 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:34:52,751 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:34:52,751 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:34:52,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:34:52,752 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:34:52,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:34:52,758 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:34:52,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:34:52,800 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:34:52,800 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:34:52,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:34:52,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:34:52,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:34:52,803 INFO L87 Difference]: Start difference. First operand 155 states and 163 transitions. Second operand 5 states. [2018-04-10 16:34:52,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:34:52,910 INFO L93 Difference]: Finished difference Result 154 states and 161 transitions. [2018-04-10 16:34:52,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 16:34:52,910 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-04-10 16:34:52,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:34:52,911 INFO L225 Difference]: With dead ends: 154 [2018-04-10 16:34:52,911 INFO L226 Difference]: Without dead ends: 154 [2018-04-10 16:34:52,911 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-10 16:34:52,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-04-10 16:34:52,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-04-10 16:34:52,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-04-10 16:34:52,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 161 transitions. [2018-04-10 16:34:52,913 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 161 transitions. Word has length 19 [2018-04-10 16:34:52,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:34:52,914 INFO L459 AbstractCegarLoop]: Abstraction has 154 states and 161 transitions. [2018-04-10 16:34:52,914 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:34:52,914 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 161 transitions. [2018-04-10 16:34:52,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-10 16:34:52,914 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:34:52,914 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:34:52,915 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:34:52,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1276271173, now seen corresponding path program 1 times [2018-04-10 16:34:52,915 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:34:52,915 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:34:52,916 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:34:52,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:34:52,916 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:34:52,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:34:52,929 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:34:52,934 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:34:52,935 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:34:52,935 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:34:52,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:34:52,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:34:52,982 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:34:53,024 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:53,025 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:53,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-10 16:34:53,031 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:53,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:53,036 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-10 16:34:53,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:34:53,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:34:53,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:53,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:53,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:53,060 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-04-10 16:34:53,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-04-10 16:34:53,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:34:53,089 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:53,092 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:53,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:34:53,097 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-04-10 16:34:53,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2018-04-10 16:34:53,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-10 16:34:53,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:53,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:34:53,132 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:53,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:53,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:34:53,139 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:43, output treesize:15 [2018-04-10 16:34:53,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:34:53,150 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:34:53,150 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 16:34:53,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 16:34:53,151 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 16:34:53,151 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-10 16:34:53,151 INFO L87 Difference]: Start difference. First operand 154 states and 161 transitions. Second operand 8 states. [2018-04-10 16:34:53,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:34:53,358 INFO L93 Difference]: Finished difference Result 153 states and 160 transitions. [2018-04-10 16:34:53,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 16:34:53,358 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-04-10 16:34:53,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:34:53,359 INFO L225 Difference]: With dead ends: 153 [2018-04-10 16:34:53,359 INFO L226 Difference]: Without dead ends: 153 [2018-04-10 16:34:53,359 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2018-04-10 16:34:53,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-04-10 16:34:53,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-04-10 16:34:53,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-04-10 16:34:53,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 160 transitions. [2018-04-10 16:34:53,363 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 160 transitions. Word has length 22 [2018-04-10 16:34:53,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:34:53,363 INFO L459 AbstractCegarLoop]: Abstraction has 153 states and 160 transitions. [2018-04-10 16:34:53,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 16:34:53,363 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 160 transitions. [2018-04-10 16:34:53,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-10 16:34:53,364 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:34:53,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] [2018-04-10 16:34:53,364 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:34:53,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1276271172, now seen corresponding path program 1 times [2018-04-10 16:34:53,364 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:34:53,364 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:34:53,366 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:34:53,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:34:53,366 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:34:53,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:34:53,376 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:34:53,379 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:34:53,379 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:34:53,379 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:34:53,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:34:53,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:34:53,410 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:34:53,419 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:53,419 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:53,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-10 16:34:53,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:53,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-10 16:34:53,424 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:53,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:53,427 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-10 16:34:53,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:34:53,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:34:53,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:53,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:53,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:34:53,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:34:53,445 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:53,446 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:53,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:53,456 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-04-10 16:34:53,474 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 9 treesize of output 1 [2018-04-10 16:34:53,474 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:53,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-10 16:34:53,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:34:53,487 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:53,491 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:53,500 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 52 treesize of output 48 [2018-04-10 16:34:53,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:34:53,502 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:53,507 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:53,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:34:53,513 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:76, output treesize:51 [2018-04-10 16:34:53,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2018-04-10 16:34:53,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 19 [2018-04-10 16:34:53,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:53,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:34:53,536 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:53,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:53,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-04-10 16:34:53,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-10 16:34:53,547 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:53,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:34:53,551 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:53,552 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:53,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:53,554 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:65, output treesize:9 [2018-04-10 16:34:53,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:34:53,561 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:34:53,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 16:34:53,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 16:34:53,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 16:34:53,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-10 16:34:53,561 INFO L87 Difference]: Start difference. First operand 153 states and 160 transitions. Second operand 8 states. [2018-04-10 16:34:53,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:34:53,838 INFO L93 Difference]: Finished difference Result 152 states and 159 transitions. [2018-04-10 16:34:53,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 16:34:53,838 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-04-10 16:34:53,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:34:53,839 INFO L225 Difference]: With dead ends: 152 [2018-04-10 16:34:53,839 INFO L226 Difference]: Without dead ends: 152 [2018-04-10 16:34:53,840 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-04-10 16:34:53,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-04-10 16:34:53,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-04-10 16:34:53,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-04-10 16:34:53,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 159 transitions. [2018-04-10 16:34:53,843 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 159 transitions. Word has length 22 [2018-04-10 16:34:53,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:34:53,844 INFO L459 AbstractCegarLoop]: Abstraction has 152 states and 159 transitions. [2018-04-10 16:34:53,844 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 16:34:53,844 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 159 transitions. [2018-04-10 16:34:53,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-10 16:34:53,844 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:34:53,844 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:34:53,844 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:34:53,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1266958903, now seen corresponding path program 1 times [2018-04-10 16:34:53,845 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:34:53,845 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:34:53,846 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:34:53,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:34:53,846 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:34:53,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:34:53,854 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:34:53,856 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:34:53,857 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:34:53,857 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:34:53,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:34:53,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:34:53,880 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:34:53,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:34:53,894 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:53,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:53,901 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-10 16:34:53,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:34:53,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:34:53,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:53,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:53,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:34:53,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:34:53,931 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:53,932 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:53,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:53,940 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:34, output treesize:20 [2018-04-10 16:34:53,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-10 16:34:53,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 16:34:53,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:53,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:53,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:53,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:16 [2018-04-10 16:34:53,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-04-10 16:34:54,001 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:54,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 28 [2018-04-10 16:34:54,004 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:54,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-10 16:34:54,019 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:54,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:54,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:34:54,032 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:29, output treesize:25 [2018-04-10 16:34:54,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2018-04-10 16:34:54,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-10 16:34:54,065 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:54,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-10 16:34:54,074 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:54,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:54,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:54,099 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:5 [2018-04-10 16:34:54,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:34:54,116 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:34:54,116 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-10 16:34:54,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 16:34:54,117 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 16:34:54,117 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-04-10 16:34:54,117 INFO L87 Difference]: Start difference. First operand 152 states and 159 transitions. Second operand 11 states. [2018-04-10 16:34:54,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:34:54,441 INFO L93 Difference]: Finished difference Result 161 states and 166 transitions. [2018-04-10 16:34:54,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-10 16:34:54,441 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-04-10 16:34:54,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:34:54,442 INFO L225 Difference]: With dead ends: 161 [2018-04-10 16:34:54,442 INFO L226 Difference]: Without dead ends: 161 [2018-04-10 16:34:54,443 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=317, Unknown=0, NotChecked=0, Total=462 [2018-04-10 16:34:54,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-04-10 16:34:54,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 154. [2018-04-10 16:34:54,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-04-10 16:34:54,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 162 transitions. [2018-04-10 16:34:54,446 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 162 transitions. Word has length 22 [2018-04-10 16:34:54,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:34:54,446 INFO L459 AbstractCegarLoop]: Abstraction has 154 states and 162 transitions. [2018-04-10 16:34:54,446 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 16:34:54,446 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 162 transitions. [2018-04-10 16:34:54,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-10 16:34:54,447 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:34:54,447 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:34:54,447 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:34:54,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1266958904, now seen corresponding path program 1 times [2018-04-10 16:34:54,447 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:34:54,447 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:34:54,448 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:34:54,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:34:54,448 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:34:54,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:34:54,456 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:34:54,459 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:34:54,460 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:34:54,460 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:34:54,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:34:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:34:54,483 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:34:54,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:34:54,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:54,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:54,502 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-10 16:34:54,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:34:54,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:34:54,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:54,520 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:54,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:34:54,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:34:54,533 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:54,536 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:54,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:54,542 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:20 [2018-04-10 16:34:54,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-04-10 16:34:54,587 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:54,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 28 [2018-04-10 16:34:54,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:54,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-10 16:34:54,602 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:54,609 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:54,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 56 [2018-04-10 16:34:54,637 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:54,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2018-04-10 16:34:54,639 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:54,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-04-10 16:34:54,663 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:54,671 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:54,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:34:54,678 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:53, output treesize:57 [2018-04-10 16:34:54,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 91 [2018-04-10 16:34:54,711 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:54,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 57 [2018-04-10 16:34:54,714 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:34:54,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 68 [2018-04-10 16:34:54,735 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:34:54,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 68 treesize of output 49 [2018-04-10 16:34:54,749 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:54,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-10 16:34:54,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 44 [2018-04-10 16:34:54,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2018-04-10 16:34:54,793 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:34:54,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10 16:34:54,803 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:54,808 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:54,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 48 [2018-04-10 16:34:54,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 23 [2018-04-10 16:34:54,817 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:54,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-10 16:34:54,830 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:54,842 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:54,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 24 [2018-04-10 16:34:54,844 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:54,850 INFO L267 ElimStorePlain]: Start of recursive call 9: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:54,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:54,857 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:107, output treesize:9 [2018-04-10 16:34:54,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:34:54,872 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:34:54,872 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-10 16:34:54,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 16:34:54,873 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 16:34:54,873 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-04-10 16:34:54,873 INFO L87 Difference]: Start difference. First operand 154 states and 162 transitions. Second operand 11 states. [2018-04-10 16:34:55,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:34:55,273 INFO L93 Difference]: Finished difference Result 170 states and 176 transitions. [2018-04-10 16:34:55,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-10 16:34:55,273 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-04-10 16:34:55,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:34:55,273 INFO L225 Difference]: With dead ends: 170 [2018-04-10 16:34:55,274 INFO L226 Difference]: Without dead ends: 170 [2018-04-10 16:34:55,274 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=202, Invalid=398, Unknown=0, NotChecked=0, Total=600 [2018-04-10 16:34:55,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-04-10 16:34:55,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 139. [2018-04-10 16:34:55,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-04-10 16:34:55,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 146 transitions. [2018-04-10 16:34:55,276 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 146 transitions. Word has length 22 [2018-04-10 16:34:55,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:34:55,277 INFO L459 AbstractCegarLoop]: Abstraction has 139 states and 146 transitions. [2018-04-10 16:34:55,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 16:34:55,277 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 146 transitions. [2018-04-10 16:34:55,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-10 16:34:55,277 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:34:55,277 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:34:55,277 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:34:55,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1106429151, now seen corresponding path program 1 times [2018-04-10 16:34:55,278 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:34:55,278 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:34:55,279 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:34:55,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:34:55,279 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:34:55,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:34:55,290 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:34:55,294 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:34:55,294 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:34:55,294 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:34:55,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:34:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:34:55,338 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:34:55,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:34:55,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-10 16:34:55,358 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:55,359 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:55,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:55,362 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-04-10 16:34:55,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 38 [2018-04-10 16:34:55,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-04-10 16:34:55,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:55,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:55,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:34:55,423 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 [2018-04-10 16:34:55,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:34:55,470 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:55,483 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-10 16:34:55,483 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:57 [2018-04-10 16:34:55,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:34:55,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:34:55,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:55,510 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:55,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 60 treesize of output 77 [2018-04-10 16:34:55,542 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:55,544 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:55,549 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 49 treesize of output 67 [2018-04-10 16:34:55,550 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-10 16:34:55,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 56 [2018-04-10 16:34:55,629 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:55,698 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 54 treesize of output 49 [2018-04-10 16:34:55,698 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-10 16:34:55,716 INFO L267 ElimStorePlain]: Start of recursive call 4: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:34:55,751 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 2 xjuncts. [2018-04-10 16:34:55,751 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:79, output treesize:104 [2018-04-10 16:34:55,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 78 [2018-04-10 16:34:55,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2018-04-10 16:34:55,822 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:55,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 50 [2018-04-10 16:34:55,919 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:34:56,012 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:56,013 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:56,018 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 52 [2018-04-10 16:34:56,020 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:56,120 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:56,121 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:56,126 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 52 [2018-04-10 16:34:56,126 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:56,262 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:56,263 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:56,268 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 48 [2018-04-10 16:34:56,268 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:56,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 13 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:56,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 45 [2018-04-10 16:34:56,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2018-04-10 16:34:56,302 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:56,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 34 treesize of output 23 [2018-04-10 16:34:56,325 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:56,343 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:56,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2018-04-10 16:34:56,344 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:56,351 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:56,359 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-10 16:34:56,359 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:118, output treesize:16 [2018-04-10 16:34:56,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-04-10 16:34:56,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-04-10 16:34:56,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:56,394 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:56,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:34:56,398 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:25 [2018-04-10 16:34:56,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2018-04-10 16:34:56,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-10 16:34:56,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:56,422 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:56,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:56,429 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:5 [2018-04-10 16:34:56,460 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:34:56,460 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:34:56,460 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-10 16:34:56,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-10 16:34:56,461 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-10 16:34:56,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-04-10 16:34:56,461 INFO L87 Difference]: Start difference. First operand 139 states and 146 transitions. Second operand 17 states. [2018-04-10 16:34:57,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:34:57,246 INFO L93 Difference]: Finished difference Result 179 states and 186 transitions. [2018-04-10 16:34:57,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-10 16:34:57,247 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-04-10 16:34:57,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:34:57,247 INFO L225 Difference]: With dead ends: 179 [2018-04-10 16:34:57,248 INFO L226 Difference]: Without dead ends: 179 [2018-04-10 16:34:57,248 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=373, Invalid=959, Unknown=0, NotChecked=0, Total=1332 [2018-04-10 16:34:57,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-04-10 16:34:57,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 127. [2018-04-10 16:34:57,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-04-10 16:34:57,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 133 transitions. [2018-04-10 16:34:57,251 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 133 transitions. Word has length 36 [2018-04-10 16:34:57,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:34:57,251 INFO L459 AbstractCegarLoop]: Abstraction has 127 states and 133 transitions. [2018-04-10 16:34:57,251 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-10 16:34:57,251 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 133 transitions. [2018-04-10 16:34:57,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-10 16:34:57,252 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:34:57,252 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:34:57,252 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:34:57,252 INFO L82 PathProgramCache]: Analyzing trace with hash 115539414, now seen corresponding path program 1 times [2018-04-10 16:34:57,253 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:34:57,253 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:34:57,254 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:34:57,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:34:57,254 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:34:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:34:57,261 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:34:57,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:34:57,320 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:34:57,320 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 16:34:57,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 16:34:57,321 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 16:34:57,321 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-04-10 16:34:57,321 INFO L87 Difference]: Start difference. First operand 127 states and 133 transitions. Second operand 8 states. [2018-04-10 16:34:57,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:34:57,614 INFO L93 Difference]: Finished difference Result 223 states and 230 transitions. [2018-04-10 16:34:57,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 16:34:57,614 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-04-10 16:34:57,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:34:57,614 INFO L225 Difference]: With dead ends: 223 [2018-04-10 16:34:57,614 INFO L226 Difference]: Without dead ends: 223 [2018-04-10 16:34:57,615 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2018-04-10 16:34:57,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-04-10 16:34:57,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 153. [2018-04-10 16:34:57,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-04-10 16:34:57,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 162 transitions. [2018-04-10 16:34:57,617 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 162 transitions. Word has length 37 [2018-04-10 16:34:57,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:34:57,617 INFO L459 AbstractCegarLoop]: Abstraction has 153 states and 162 transitions. [2018-04-10 16:34:57,617 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 16:34:57,618 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 162 transitions. [2018-04-10 16:34:57,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-10 16:34:57,618 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:34:57,618 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:34:57,619 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:34:57,619 INFO L82 PathProgramCache]: Analyzing trace with hash 115539415, now seen corresponding path program 1 times [2018-04-10 16:34:57,619 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:34:57,619 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:34:57,620 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:34:57,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:34:57,620 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:34:57,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:34:57,628 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:34:57,640 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:34:57,641 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:34:57,641 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:34:57,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:34:57,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:34:57,675 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:34:57,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:34:57,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:34:57,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:57,693 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:57,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:57,697 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2018-04-10 16:34:57,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-10 16:34:57,711 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:57,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 16:34:57,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:57,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:57,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:57,721 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-04-10 16:34:57,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:34:57,744 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:57,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:57,762 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:34 [2018-04-10 16:34:57,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:34:57,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:34:57,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:57,789 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:57,803 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:34:57,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-04-10 16:34:57,806 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:57,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2018-04-10 16:34:57,807 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:57,813 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:57,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:57,822 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:35 [2018-04-10 16:34:57,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 65 [2018-04-10 16:34:57,892 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:57,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 62 [2018-04-10 16:34:57,895 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:34:57,904 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:34:57,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2018-04-10 16:34:57,925 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:57,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:57,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 69 [2018-04-10 16:34:57,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 59 [2018-04-10 16:34:57,975 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:57,998 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:58,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:58,011 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:85, output treesize:69 [2018-04-10 16:34:58,074 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 25 treesize of output 18 [2018-04-10 16:34:58,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-04-10 16:34:58,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:58,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:58,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:58,089 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:97, output treesize:80 [2018-04-10 16:34:58,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2018-04-10 16:34:58,154 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:34:58,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-10 16:34:58,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:58,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-04-10 16:34:58,166 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:58,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-10 16:34:58,173 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:58,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:34:58,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:34:58,188 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:87, output treesize:134 [2018-04-10 16:34:58,267 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 59 treesize of output 45 [2018-04-10 16:34:58,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-04-10 16:34:58,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:58,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 23 [2018-04-10 16:34:58,276 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:58,280 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:58,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2018-04-10 16:34:58,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 11 [2018-04-10 16:34:58,294 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:58,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:34:58,299 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:58,300 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:58,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:58,307 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:80, output treesize:9 [2018-04-10 16:34:58,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:34:58,344 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:34:58,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-04-10 16:34:58,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-10 16:34:58,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-10 16:34:58,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2018-04-10 16:34:58,345 INFO L87 Difference]: Start difference. First operand 153 states and 162 transitions. Second operand 18 states. [2018-04-10 16:34:59,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:34:59,340 INFO L93 Difference]: Finished difference Result 244 states and 253 transitions. [2018-04-10 16:34:59,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-10 16:34:59,340 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 37 [2018-04-10 16:34:59,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:34:59,341 INFO L225 Difference]: With dead ends: 244 [2018-04-10 16:34:59,341 INFO L226 Difference]: Without dead ends: 244 [2018-04-10 16:34:59,341 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=345, Invalid=915, Unknown=0, NotChecked=0, Total=1260 [2018-04-10 16:34:59,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-04-10 16:34:59,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 153. [2018-04-10 16:34:59,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-04-10 16:34:59,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 161 transitions. [2018-04-10 16:34:59,343 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 161 transitions. Word has length 37 [2018-04-10 16:34:59,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:34:59,343 INFO L459 AbstractCegarLoop]: Abstraction has 153 states and 161 transitions. [2018-04-10 16:34:59,343 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-10 16:34:59,343 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 161 transitions. [2018-04-10 16:34:59,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-10 16:34:59,344 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:34:59,344 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] [2018-04-10 16:34:59,344 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:34:59,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1992808857, now seen corresponding path program 1 times [2018-04-10 16:34:59,344 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:34:59,344 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:34:59,344 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:34:59,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:34:59,345 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:34:59,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:34:59,350 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:34:59,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:34:59,400 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:34:59,400 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:34:59,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:34:59,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:34:59,424 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:34:59,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 6 treesize of output 5 [2018-04-10 16:34:59,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:59,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:59,433 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:34:59,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-10 16:34:59,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 16:34:59,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:59,473 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:59,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:59,483 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2018-04-10 16:34:59,504 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:59,505 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 19 treesize of output 25 [2018-04-10 16:34:59,505 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:59,519 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:59,519 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:59,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-10 16:34:59,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:59,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:59,530 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:50 [2018-04-10 16:34:59,554 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 11 treesize of output 4 [2018-04-10 16:34:59,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:59,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:34:59,580 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:37 [2018-04-10 16:34:59,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-04-10 16:34:59,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-04-10 16:34:59,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:59,661 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:59,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 30 [2018-04-10 16:34:59,665 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-10 16:34:59,673 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:34:59,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-04-10 16:34:59,687 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:50, output treesize:84 [2018-04-10 16:34:59,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 35 [2018-04-10 16:34:59,768 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:59,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 26 [2018-04-10 16:34:59,784 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:59,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-10 16:34:59,798 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:98, output treesize:54 [2018-04-10 16:34:59,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2018-04-10 16:34:59,835 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:34:59,836 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:59,836 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:59,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 31 [2018-04-10 16:34:59,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:59,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-04-10 16:34:59,852 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:59,873 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:34:59,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-10 16:34:59,874 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:59,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:34:59,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-10 16:34:59,904 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:34:59,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-10 16:34:59,904 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:59,908 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:59,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:34:59,922 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 10 variables, input treesize:72, output treesize:7 [2018-04-10 16:34:59,938 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-10 16:34:59,938 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:34:59,938 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [7] total 18 [2018-04-10 16:34:59,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-10 16:34:59,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-10 16:34:59,939 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-04-10 16:34:59,939 INFO L87 Difference]: Start difference. First operand 153 states and 161 transitions. Second operand 18 states. [2018-04-10 16:35:01,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:35:01,236 INFO L93 Difference]: Finished difference Result 256 states and 260 transitions. [2018-04-10 16:35:01,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-10 16:35:01,236 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 37 [2018-04-10 16:35:01,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:35:01,237 INFO L225 Difference]: With dead ends: 256 [2018-04-10 16:35:01,237 INFO L226 Difference]: Without dead ends: 253 [2018-04-10 16:35:01,237 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=300, Invalid=1032, Unknown=0, NotChecked=0, Total=1332 [2018-04-10 16:35:01,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-04-10 16:35:01,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 153. [2018-04-10 16:35:01,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-04-10 16:35:01,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 160 transitions. [2018-04-10 16:35:01,240 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 160 transitions. Word has length 37 [2018-04-10 16:35:01,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:35:01,240 INFO L459 AbstractCegarLoop]: Abstraction has 153 states and 160 transitions. [2018-04-10 16:35:01,240 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-10 16:35:01,240 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 160 transitions. [2018-04-10 16:35:01,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-10 16:35:01,240 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:35:01,240 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:35:01,241 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:35:01,241 INFO L82 PathProgramCache]: Analyzing trace with hash -700426646, now seen corresponding path program 1 times [2018-04-10 16:35:01,241 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:35:01,241 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:35:01,242 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:01,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:01,242 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:01,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:01,249 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:35:01,253 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:35:01,253 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:35:01,253 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:35:01,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:01,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:01,282 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:35:01,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:35:01,299 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:01,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:01,302 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:35:01,332 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:01,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 16:35:01,333 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:01,342 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:01,342 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:01,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-10 16:35:01,343 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:01,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:01,350 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:37 [2018-04-10 16:35:01,362 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 11 treesize of output 4 [2018-04-10 16:35:01,362 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:01,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:35:01,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:35:01,374 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:01,375 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:01,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:35:01,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:35:01,390 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:01,391 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:01,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:01,412 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:56, output treesize:39 [2018-04-10 16:35:01,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-04-10 16:35:01,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-10 16:35:01,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:01,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:01,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:01,441 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:28 [2018-04-10 16:35:01,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-04-10 16:35:01,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 16:35:01,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:01,458 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:01,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:01,463 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:34 [2018-04-10 16:35:01,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 18 treesize of output 8 [2018-04-10 16:35:01,597 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:01,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:01,614 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:24 [2018-04-10 16:35:01,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-10 16:35:01,683 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:35:01,684 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-10 16:35:01,684 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:01,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:35:01,694 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:01,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:01,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:01,700 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:34, output treesize:7 [2018-04-10 16:35:01,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:35:01,716 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:35:01,716 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-04-10 16:35:01,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-10 16:35:01,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-10 16:35:01,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-04-10 16:35:01,717 INFO L87 Difference]: Start difference. First operand 153 states and 160 transitions. Second operand 15 states. [2018-04-10 16:35:02,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:35:02,588 INFO L93 Difference]: Finished difference Result 252 states and 256 transitions. [2018-04-10 16:35:02,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-10 16:35:02,588 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 49 [2018-04-10 16:35:02,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:35:02,589 INFO L225 Difference]: With dead ends: 252 [2018-04-10 16:35:02,589 INFO L226 Difference]: Without dead ends: 252 [2018-04-10 16:35:02,589 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=277, Invalid=845, Unknown=0, NotChecked=0, Total=1122 [2018-04-10 16:35:02,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-04-10 16:35:02,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 165. [2018-04-10 16:35:02,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-04-10 16:35:02,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 173 transitions. [2018-04-10 16:35:02,593 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 173 transitions. Word has length 49 [2018-04-10 16:35:02,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:35:02,593 INFO L459 AbstractCegarLoop]: Abstraction has 165 states and 173 transitions. [2018-04-10 16:35:02,593 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-10 16:35:02,593 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 173 transitions. [2018-04-10 16:35:02,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-10 16:35:02,594 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:35:02,594 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:35:02,594 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:35:02,594 INFO L82 PathProgramCache]: Analyzing trace with hash -238389276, now seen corresponding path program 1 times [2018-04-10 16:35:02,594 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:35:02,594 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:35:02,595 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:02,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:02,595 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:02,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:02,604 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:35:02,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:35:02,655 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:35:02,655 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 16:35:02,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 16:35:02,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 16:35:02,656 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-04-10 16:35:02,656 INFO L87 Difference]: Start difference. First operand 165 states and 173 transitions. Second operand 8 states. [2018-04-10 16:35:02,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:35:02,817 INFO L93 Difference]: Finished difference Result 206 states and 212 transitions. [2018-04-10 16:35:02,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 16:35:02,817 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2018-04-10 16:35:02,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:35:02,818 INFO L225 Difference]: With dead ends: 206 [2018-04-10 16:35:02,818 INFO L226 Difference]: Without dead ends: 206 [2018-04-10 16:35:02,818 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-04-10 16:35:02,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-04-10 16:35:02,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 181. [2018-04-10 16:35:02,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-04-10 16:35:02,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 193 transitions. [2018-04-10 16:35:02,820 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 193 transitions. Word has length 50 [2018-04-10 16:35:02,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:35:02,820 INFO L459 AbstractCegarLoop]: Abstraction has 181 states and 193 transitions. [2018-04-10 16:35:02,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 16:35:02,820 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 193 transitions. [2018-04-10 16:35:02,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-10 16:35:02,821 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:35:02,821 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-10 16:35:02,821 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:35:02,821 INFO L82 PathProgramCache]: Analyzing trace with hash -947725780, now seen corresponding path program 1 times [2018-04-10 16:35:02,821 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:35:02,821 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:35:02,822 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:02,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:02,822 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:02,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:02,827 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:35:02,829 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:35:02,830 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:35:02,830 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:35:02,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:02,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:02,847 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:35:02,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-10 16:35:02,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-10 16:35:02,885 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:02,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:02,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:02,887 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-04-10 16:35:02,894 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-10 16:35:02,894 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:35:02,895 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-10 16:35:02,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 16:35:02,895 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 16:35:02,895 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-04-10 16:35:02,895 INFO L87 Difference]: Start difference. First operand 181 states and 193 transitions. Second operand 9 states. [2018-04-10 16:35:03,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:35:03,068 INFO L93 Difference]: Finished difference Result 209 states and 212 transitions. [2018-04-10 16:35:03,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 16:35:03,068 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-04-10 16:35:03,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:35:03,069 INFO L225 Difference]: With dead ends: 209 [2018-04-10 16:35:03,069 INFO L226 Difference]: Without dead ends: 209 [2018-04-10 16:35:03,069 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2018-04-10 16:35:03,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-04-10 16:35:03,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 181. [2018-04-10 16:35:03,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-04-10 16:35:03,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 191 transitions. [2018-04-10 16:35:03,071 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 191 transitions. Word has length 50 [2018-04-10 16:35:03,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:35:03,071 INFO L459 AbstractCegarLoop]: Abstraction has 181 states and 191 transitions. [2018-04-10 16:35:03,071 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 16:35:03,071 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 191 transitions. [2018-04-10 16:35:03,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-10 16:35:03,072 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:35:03,072 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:35:03,072 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:35:03,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1314925652, now seen corresponding path program 1 times [2018-04-10 16:35:03,072 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:35:03,072 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:35:03,073 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:03,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:03,073 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:03,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:03,079 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:35:03,082 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:35:03,082 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:35:03,083 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:35:03,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:03,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:03,111 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:35:03,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:35:03,113 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:03,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:03,115 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:35:03,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-10 16:35:03,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 16:35:03,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:03,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:03,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:03,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-04-10 16:35:03,143 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:03,144 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:03,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-10 16:35:03,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:03,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:03,149 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2018-04-10 16:35:03,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:35:03,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:35:03,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:03,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:03,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:03,167 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-04-10 16:35:03,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 34 [2018-04-10 16:35:03,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:35:03,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:03,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:03,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:03,221 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:37 [2018-04-10 16:35:03,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2018-04-10 16:35:03,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-04-10 16:35:03,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:03,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:35:03,249 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:03,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:03,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:03,254 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:17 [2018-04-10 16:35:03,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-04-10 16:35:03,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 16:35:03,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:03,290 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:03,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:03,295 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2018-04-10 16:35:03,314 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:03,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-04-10 16:35:03,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 9 [2018-04-10 16:35:03,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:03,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:03,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:03,326 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:26 [2018-04-10 16:35:03,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 63 [2018-04-10 16:35:03,378 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:03,385 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 38 treesize of output 47 [2018-04-10 16:35:03,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:35:03,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-04-10 16:35:03,485 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:03,513 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:03,519 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 30 treesize of output 39 [2018-04-10 16:35:03,519 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-10 16:35:03,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-10 16:35:03,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2018-04-10 16:35:03,556 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:39, output treesize:88 [2018-04-10 16:35:03,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 49 [2018-04-10 16:35:03,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2018-04-10 16:35:03,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:03,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2018-04-10 16:35:03,739 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:03,772 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:03,773 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:03,774 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:03,775 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:03,776 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:03,776 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:03,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 36 [2018-04-10 16:35:03,777 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:03,814 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:03,815 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:03,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-04-10 16:35:03,815 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:03,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2018-04-10 16:35:03,840 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:03,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-04-10 16:35:03,862 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:03,884 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:03,885 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:03,885 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 26 treesize of output 22 [2018-04-10 16:35:03,885 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:03,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-04-10 16:35:03,904 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:03,916 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-10 16:35:03,942 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 28 treesize of output 22 [2018-04-10 16:35:03,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-10 16:35:03,943 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:03,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:35:03,955 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:03,966 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:03,989 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 28 treesize of output 22 [2018-04-10 16:35:04,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-10 16:35:04,002 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:04,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:35:04,007 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:04,009 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:04,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:35:04,028 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 14 variables, input treesize:94, output treesize:7 [2018-04-10 16:35:04,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:35:04,053 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:35:04,053 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-10 16:35:04,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-10 16:35:04,053 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-10 16:35:04,054 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-04-10 16:35:04,054 INFO L87 Difference]: Start difference. First operand 181 states and 191 transitions. Second operand 17 states. [2018-04-10 16:35:05,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:35:05,189 INFO L93 Difference]: Finished difference Result 307 states and 317 transitions. [2018-04-10 16:35:05,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-10 16:35:05,190 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 51 [2018-04-10 16:35:05,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:35:05,190 INFO L225 Difference]: With dead ends: 307 [2018-04-10 16:35:05,190 INFO L226 Difference]: Without dead ends: 307 [2018-04-10 16:35:05,191 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=212, Invalid=978, Unknown=0, NotChecked=0, Total=1190 [2018-04-10 16:35:05,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-04-10 16:35:05,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 210. [2018-04-10 16:35:05,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-04-10 16:35:05,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 221 transitions. [2018-04-10 16:35:05,193 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 221 transitions. Word has length 51 [2018-04-10 16:35:05,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:35:05,193 INFO L459 AbstractCegarLoop]: Abstraction has 210 states and 221 transitions. [2018-04-10 16:35:05,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-10 16:35:05,193 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 221 transitions. [2018-04-10 16:35:05,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-10 16:35:05,193 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:35:05,193 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:35:05,194 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:35:05,194 INFO L82 PathProgramCache]: Analyzing trace with hash 562343791, now seen corresponding path program 1 times [2018-04-10 16:35:05,194 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:35:05,194 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:35:05,194 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:05,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:05,195 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:05,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:05,204 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:35:05,209 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:35:05,209 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:35:05,209 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:35:05,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:05,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:05,258 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:35:05,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:35:05,262 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:05,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:05,265 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:35:05,289 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:05,289 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:05,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-10 16:35:05,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:05,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:05,300 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-10 16:35:05,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:35:05,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-10 16:35:05,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:05,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:05,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:35:05,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:35:05,340 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:05,341 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:05,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:05,354 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:49, output treesize:42 [2018-04-10 16:35:05,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-10 16:35:05,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-10 16:35:05,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:05,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:05,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:05,381 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:45 [2018-04-10 16:35:05,426 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 37 treesize of output 41 [2018-04-10 16:35:05,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 12 treesize of output 11 [2018-04-10 16:35:05,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:05,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:05,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:05,446 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:54, output treesize:46 [2018-04-10 16:35:05,498 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 20 treesize of output 12 [2018-04-10 16:35:05,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:05,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:05,506 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:36 [2018-04-10 16:35:05,542 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 38 treesize of output 33 [2018-04-10 16:35:05,549 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 14 treesize of output 19 [2018-04-10 16:35:05,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:35:05,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:35:05,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:35:05,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:35:05,587 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:05,588 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:05,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-10 16:35:05,606 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:63, output treesize:77 [2018-04-10 16:35:05,669 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 47 treesize of output 43 [2018-04-10 16:35:05,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-10 16:35:05,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:05,681 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:05,708 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 40 treesize of output 36 [2018-04-10 16:35:05,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-10 16:35:05,710 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:05,719 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:05,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-10 16:35:05,743 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:88, output treesize:66 [2018-04-10 16:35:05,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 41 [2018-04-10 16:35:05,794 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 34 treesize of output 33 [2018-04-10 16:35:05,795 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:05,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:05,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:05,825 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:38 [2018-04-10 16:35:06,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 34 [2018-04-10 16:35:06,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-04-10 16:35:06,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:06,594 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:35:06,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2018-04-10 16:35:06,594 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:06,602 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:35:06,603 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:06,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 17 [2018-04-10 16:35:06,603 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:06,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:06,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:06,613 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:48, output treesize:5 [2018-04-10 16:35:06,638 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-10 16:35:06,638 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:35:06,638 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-10 16:35:06,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-10 16:35:06,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-10 16:35:06,639 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=284, Unknown=2, NotChecked=0, Total=342 [2018-04-10 16:35:06,639 INFO L87 Difference]: Start difference. First operand 210 states and 221 transitions. Second operand 19 states. [2018-04-10 16:35:09,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:35:09,963 INFO L93 Difference]: Finished difference Result 269 states and 280 transitions. [2018-04-10 16:35:09,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-10 16:35:09,964 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 51 [2018-04-10 16:35:09,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:35:09,965 INFO L225 Difference]: With dead ends: 269 [2018-04-10 16:35:09,965 INFO L226 Difference]: Without dead ends: 269 [2018-04-10 16:35:09,965 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=277, Invalid=1203, Unknown=2, NotChecked=0, Total=1482 [2018-04-10 16:35:09,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-04-10 16:35:09,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 218. [2018-04-10 16:35:09,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-04-10 16:35:09,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 230 transitions. [2018-04-10 16:35:09,968 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 230 transitions. Word has length 51 [2018-04-10 16:35:09,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:35:09,968 INFO L459 AbstractCegarLoop]: Abstraction has 218 states and 230 transitions. [2018-04-10 16:35:09,968 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-10 16:35:09,968 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 230 transitions. [2018-04-10 16:35:09,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-10 16:35:09,968 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:35:09,968 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:35:09,968 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:35:09,968 INFO L82 PathProgramCache]: Analyzing trace with hash 562343792, now seen corresponding path program 1 times [2018-04-10 16:35:09,968 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:35:09,968 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:35:09,969 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:09,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:09,969 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:09,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:09,976 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:35:09,981 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:35:09,981 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:35:09,981 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:35:09,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:10,009 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:35:10,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:35:10,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:10,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:10,013 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:35:10,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:35:10,026 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:10,037 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:10,038 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:10,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-10 16:35:10,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:10,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:10,050 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2018-04-10 16:35:10,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:35:10,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:35:10,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:10,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:10,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:35:10,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 8 treesize of output 7 [2018-04-10 16:35:10,095 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:10,097 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:10,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:10,107 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:54, output treesize:51 [2018-04-10 16:35:10,162 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 73 [2018-04-10 16:35:10,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:35:10,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:10,174 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:10,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-10 16:35:10,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:35:10,199 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:10,204 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:10,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:10,221 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:93, output treesize:77 [2018-04-10 16:35:10,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 13 treesize of output 10 [2018-04-10 16:35:10,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 10 treesize of output 9 [2018-04-10 16:35:10,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:10,323 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:10,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:10,340 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:99, output treesize:95 [2018-04-10 16:35:10,365 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:10,366 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-10 16:35:10,366 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:10,392 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:10,393 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:10,393 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:10,394 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:10,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 55 [2018-04-10 16:35:10,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:10,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:10,436 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:112, output treesize:121 [2018-04-10 16:35:10,468 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2018-04-10 16:35:10,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:10,500 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:10,512 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 92 [2018-04-10 16:35:10,515 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:10,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, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 63 [2018-04-10 16:35:10,608 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:10,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 60 [2018-04-10 16:35:10,680 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-10 16:35:10,750 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:35:10,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2018-04-10 16:35:10,751 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:10,784 INFO L267 ElimStorePlain]: Start of recursive call 3: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-10 16:35:10,832 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:10,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 74 [2018-04-10 16:35:10,838 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:35:10,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-10 16:35:10,839 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:10,847 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:10,849 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:10,860 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 3 case distinctions, treesize of input 88 treesize of output 112 [2018-04-10 16:35:10,863 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:10,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 101 [2018-04-10 16:35:10,865 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:10,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 88 [2018-04-10 16:35:10,903 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:10,919 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:10,921 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:10,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 100 [2018-04-10 16:35:10,928 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:35:10,929 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 29 treesize of output 24 [2018-04-10 16:35:10,929 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:10,941 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:10,946 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 71 treesize of output 68 [2018-04-10 16:35:10,948 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:35:10,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 54 [2018-04-10 16:35:10,949 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:10,958 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:11,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 9 dim-0 vars, and 4 xjuncts. [2018-04-10 16:35:11,014 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 7 variables, input treesize:146, output treesize:426 [2018-04-10 16:35:11,149 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:11,149 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:11,154 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 178 treesize of output 165 [2018-04-10 16:35:11,156 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 26 treesize of output 25 [2018-04-10 16:35:11,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:11,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:11,261 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 162 treesize of output 150 [2018-04-10 16:35:11,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-04-10 16:35:11,264 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:11,276 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:11,357 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 188 treesize of output 188 [2018-04-10 16:35:11,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:35:11,359 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:11,377 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:11,446 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:11,453 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:11,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 176 treesize of output 183 [2018-04-10 16:35:11,465 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 18 treesize of output 17 [2018-04-10 16:35:11,465 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:11,484 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:11,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 151 [2018-04-10 16:35:11,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-04-10 16:35:11,548 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:11,561 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:11,622 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 147 treesize of output 137 [2018-04-10 16:35:11,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 19 [2018-04-10 16:35:11,624 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:11,635 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:11,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 6 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-04-10 16:35:11,685 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 15 variables, input treesize:528, output treesize:444 [2018-04-10 16:35:11,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 177 treesize of output 189 [2018-04-10 16:35:11,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 177 [2018-04-10 16:35:11,770 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:11,867 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:11,873 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 175 treesize of output 188 [2018-04-10 16:35:11,874 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-10 16:35:11,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:35:12,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 146 treesize of output 176 [2018-04-10 16:35:12,073 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:12,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 2 case distinctions, treesize of input 150 treesize of output 165 [2018-04-10 16:35:12,079 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-10 16:35:12,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 148 [2018-04-10 16:35:12,140 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:12,180 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:35:12,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 159 treesize of output 179 [2018-04-10 16:35:12,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 163 [2018-04-10 16:35:12,324 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:12,383 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:12,389 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 157 treesize of output 170 [2018-04-10 16:35:12,389 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-04-10 16:35:12,431 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:35:12,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 15 dim-0 vars, 3 dim-2 vars, End of recursive call: 24 dim-0 vars, and 6 xjuncts. [2018-04-10 16:35:12,586 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 18 variables, input treesize:483, output treesize:926 [2018-04-10 16:35:12,757 WARN L148 SmtUtils]: Spent 113ms on a formula simplification that was a NOOP. DAG size: 257 [2018-04-10 16:35:12,948 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:12,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 182 treesize of output 196 [2018-04-10 16:35:12,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 177 [2018-04-10 16:35:12,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:13,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 166 [2018-04-10 16:35:13,076 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:13,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 173 [2018-04-10 16:35:13,178 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:13,280 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:13,280 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:13,281 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:35:13,281 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:13,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 189 [2018-04-10 16:35:13,282 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:13,398 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:13,398 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:13,399 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 173 treesize of output 167 [2018-04-10 16:35:13,399 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:13,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 159 [2018-04-10 16:35:13,516 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:13,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 180 treesize of output 178 [2018-04-10 16:35:13,618 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-10 16:35:13,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 159 [2018-04-10 16:35:13,741 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:13,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 158 [2018-04-10 16:35:13,743 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:13,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-10 16:35:14,017 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:14,019 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 155 treesize of output 155 [2018-04-10 16:35:14,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-04-10 16:35:14,022 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:14,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:35:14,040 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:14,050 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:14,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 138 [2018-04-10 16:35:14,245 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:35:14,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-10 16:35:14,245 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:14,257 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:14,474 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:14,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 164 treesize of output 182 [2018-04-10 16:35:14,485 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:35:14,485 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:14,486 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:14,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 163 [2018-04-10 16:35:14,486 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:14,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 155 [2018-04-10 16:35:14,597 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:14,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 148 [2018-04-10 16:35:14,675 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:14,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 141 [2018-04-10 16:35:14,751 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:14,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 151 [2018-04-10 16:35:14,826 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:14,915 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:14,916 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:14,916 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 158 treesize of output 152 [2018-04-10 16:35:14,916 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:15,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 151 treesize of output 149 [2018-04-10 16:35:15,005 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 2 xjuncts. [2018-04-10 16:35:15,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 141 [2018-04-10 16:35:15,092 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:15,157 INFO L267 ElimStorePlain]: Start of recursive call 17: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-10 16:35:15,420 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:15,421 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 173 treesize of output 173 [2018-04-10 16:35:15,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:35:15,424 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:15,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-04-10 16:35:15,453 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:15,470 INFO L267 ElimStorePlain]: Start of recursive call 26: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:15,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 157 treesize of output 159 [2018-04-10 16:35:15,724 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:15,725 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:35:15,725 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:15,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 146 [2018-04-10 16:35:15,726 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:15,767 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:35:15,768 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 155 treesize of output 151 [2018-04-10 16:35:15,768 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:15,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 131 [2018-04-10 16:35:15,807 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:15,845 INFO L267 ElimStorePlain]: Start of recursive call 29: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:35:16,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 24 dim-0 vars, 6 dim-2 vars, End of recursive call: 24 dim-0 vars, and 8 xjuncts. [2018-04-10 16:35:16,161 INFO L202 ElimStorePlain]: Needed 32 recursive calls to eliminate 30 variables, input treesize:980, output treesize:1093 [2018-04-10 16:35:16,404 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:16,405 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:16,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 118 [2018-04-10 16:35:16,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-04-10 16:35:16,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:16,425 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:35:16,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 23 [2018-04-10 16:35:16,425 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:16,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 27 [2018-04-10 16:35:16,438 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:16,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:16,474 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:16,476 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:16,481 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 162 treesize of output 156 [2018-04-10 16:35:16,487 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 124 [2018-04-10 16:35:16,488 INFO L267 ElimStorePlain]: Start of recursive call 7: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 16:35:16,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 105 [2018-04-10 16:35:16,555 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:16,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 99 [2018-04-10 16:35:16,563 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:16,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 98 [2018-04-10 16:35:16,629 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:16,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 92 [2018-04-10 16:35:16,632 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:16,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 123 [2018-04-10 16:35:16,704 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:16,762 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:35:16,767 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 2 case distinctions, treesize of input 98 treesize of output 92 [2018-04-10 16:35:16,768 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-04-10 16:35:16,769 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:35:16,769 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 92 treesize of output 80 [2018-04-10 16:35:16,770 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:16,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 96 [2018-04-10 16:35:16,833 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:16,881 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:35:16,881 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 96 treesize of output 86 [2018-04-10 16:35:16,882 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:16,930 INFO L267 ElimStorePlain]: Start of recursive call 6: 7 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-04-10 16:35:16,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 68 [2018-04-10 16:35:16,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-04-10 16:35:16,995 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:17,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 28 [2018-04-10 16:35:17,008 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:17,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 13 [2018-04-10 16:35:17,020 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:17,028 INFO L267 ElimStorePlain]: Start of recursive call 17: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:17,031 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 74 treesize of output 64 [2018-04-10 16:35:17,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-04-10 16:35:17,033 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:17,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:35:17,044 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:17,054 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-10 16:35:17,054 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:17,063 INFO L267 ElimStorePlain]: Start of recursive call 21: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:17,066 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 74 treesize of output 64 [2018-04-10 16:35:17,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 29 [2018-04-10 16:35:17,076 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:17,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-04-10 16:35:17,091 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-10 16:35: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 15 treesize of output 3 [2018-04-10 16:35:17,101 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:17,110 INFO L267 ElimStorePlain]: Start of recursive call 25: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:17,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2018-04-10 16:35:17,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 9 treesize of output 1 [2018-04-10 16:35:17,152 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:17,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 16:35:17,160 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:17,166 INFO L267 ElimStorePlain]: Start of recursive call 29: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:17,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-04-10 16:35:17,202 INFO L202 ElimStorePlain]: Needed 31 recursive calls to eliminate 12 variables, input treesize:303, output treesize:73 [2018-04-10 16:35:17,328 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-10 16:35:17,328 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:35:17,328 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-10 16:35:17,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-10 16:35:17,329 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-10 16:35:17,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2018-04-10 16:35:17,329 INFO L87 Difference]: Start difference. First operand 218 states and 230 transitions. Second operand 23 states. [2018-04-10 16:35:18,717 WARN L151 SmtUtils]: Spent 155ms on a formula simplification. DAG size of input: 187 DAG size of output 184 [2018-04-10 16:35:18,920 WARN L151 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 184 DAG size of output 181 [2018-04-10 16:35:21,307 WARN L151 SmtUtils]: Spent 2279ms on a formula simplification. DAG size of input: 266 DAG size of output 266 [2018-04-10 16:35:21,746 WARN L151 SmtUtils]: Spent 321ms on a formula simplification. DAG size of input: 436 DAG size of output 270 [2018-04-10 16:35:22,313 WARN L151 SmtUtils]: Spent 365ms on a formula simplification. DAG size of input: 490 DAG size of output 315 [2018-04-10 16:35:23,001 WARN L151 SmtUtils]: Spent 540ms on a formula simplification. DAG size of input: 480 DAG size of output 312 [2018-04-10 16:35:25,914 WARN L151 SmtUtils]: Spent 2765ms on a formula simplification. DAG size of input: 492 DAG size of output 317 [2018-04-10 16:35:26,208 WARN L151 SmtUtils]: Spent 224ms on a formula simplification. DAG size of input: 278 DAG size of output 271 [2018-04-10 16:35:27,580 WARN L151 SmtUtils]: Spent 690ms on a formula simplification. DAG size of input: 426 DAG size of output 426 [2018-04-10 16:35:27,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:35:27,809 INFO L93 Difference]: Finished difference Result 318 states and 329 transitions. [2018-04-10 16:35:27,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-10 16:35:27,810 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 51 [2018-04-10 16:35:27,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:35:27,810 INFO L225 Difference]: With dead ends: 318 [2018-04-10 16:35:27,811 INFO L226 Difference]: Without dead ends: 318 [2018-04-10 16:35:27,811 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=305, Invalid=1764, Unknown=1, NotChecked=0, Total=2070 [2018-04-10 16:35:27,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-04-10 16:35:27,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 224. [2018-04-10 16:35:27,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-04-10 16:35:27,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 236 transitions. [2018-04-10 16:35:27,813 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 236 transitions. Word has length 51 [2018-04-10 16:35:27,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:35:27,813 INFO L459 AbstractCegarLoop]: Abstraction has 224 states and 236 transitions. [2018-04-10 16:35:27,813 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-10 16:35:27,813 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 236 transitions. [2018-04-10 16:35:27,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-10 16:35:27,813 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:35:27,814 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:35:27,814 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:35:27,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1765591609, now seen corresponding path program 1 times [2018-04-10 16:35:27,814 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:35:27,814 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:35:27,814 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:27,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:27,815 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:27,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:27,819 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:35:27,822 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:35:27,822 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:35:27,822 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:35:27,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:27,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:27,837 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:35:27,839 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-10 16:35:27,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:27,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:27,842 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2018-04-10 16:35:27,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:35:27,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:35:27,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:27,855 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:27,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:27,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-04-10 16:35:27,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-10 16:35:27,871 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:27,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 16:35:27,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:27,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:27,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:27,881 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2018-04-10 16:35:27,941 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:27,942 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:27,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-10 16:35:27,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:27,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 16:35:27,957 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:27,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:27,971 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:54 [2018-04-10 16:35:27,991 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 24 [2018-04-10 16:35:27,993 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:28,008 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 21 treesize of output 40 [2018-04-10 16:35:28,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-04-10 16:35:28,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-10 16:35:28,054 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 3 xjuncts. [2018-04-10 16:35:28,055 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:185 [2018-04-10 16:35:29,197 WARN L148 SmtUtils]: Spent 1071ms on a formula simplification that was a NOOP. DAG size: 76 [2018-04-10 16:35:29,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 73 [2018-04-10 16:35:29,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:35:29,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:29,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35: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, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 80 [2018-04-10 16:35:29,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:35:29,262 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:29,272 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:29,312 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 77 treesize of output 73 [2018-04-10 16:35:29,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:35:29,314 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:29,322 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:29,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-2 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2018-04-10 16:35:29,355 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 10 variables, input treesize:239, output treesize:215 [2018-04-10 16:35:29,508 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 76 treesize of output 58 [2018-04-10 16:35:29,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:29,542 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 83 treesize of output 65 [2018-04-10 16:35:29,542 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:29,573 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 76 treesize of output 58 [2018-04-10 16:35:29,573 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:29,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-1 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2018-04-10 16:35:29,606 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 10 variables, input treesize:236, output treesize:182 [2018-04-10 16:35:29,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 59 [2018-04-10 16:35:29,672 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:29,673 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:35:29,675 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 26 treesize of output 24 [2018-04-10 16:35:29,675 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:29,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:35:29,685 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:29,692 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-10 16:35:29,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 59 [2018-04-10 16:35:29,727 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:35:29,728 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:29,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2018-04-10 16:35:29,729 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:29,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:35:29,738 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:29,743 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:29,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 64 [2018-04-10 16:35:29,776 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:29,776 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:35:29,782 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 3 case distinctions, treesize of input 31 treesize of output 40 [2018-04-10 16:35:29,783 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 16:35:29,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:35:29,804 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:29,817 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 16:35:29,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-10 16:35:29,854 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 10 variables, input treesize:212, output treesize:106 [2018-04-10 16:35:29,904 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:29,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 40 [2018-04-10 16:35:29,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-10 16:35:29,932 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:29,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2018-04-10 16:35:29,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:29,948 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-10 16:35:29,948 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:63, output treesize:65 [2018-04-10 16:35:30,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:35:30,036 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:35:30,036 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-04-10 16:35:30,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-10 16:35:30,036 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-10 16:35:30,036 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=227, Unknown=6, NotChecked=0, Total=272 [2018-04-10 16:35:30,036 INFO L87 Difference]: Start difference. First operand 224 states and 236 transitions. Second operand 17 states. [2018-04-10 16:35:30,642 WARN L151 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 100 DAG size of output 98 [2018-04-10 16:35:31,414 WARN L151 SmtUtils]: Spent 718ms on a formula simplification. DAG size of input: 184 DAG size of output 125 [2018-04-10 16:35:31,631 WARN L151 SmtUtils]: Spent 176ms on a formula simplification. DAG size of input: 166 DAG size of output 107 [2018-04-10 16:35:31,882 WARN L151 SmtUtils]: Spent 165ms on a formula simplification. DAG size of input: 171 DAG size of output 153 [2018-04-10 16:35:32,319 WARN L151 SmtUtils]: Spent 187ms on a formula simplification. DAG size of input: 188 DAG size of output 162 [2018-04-10 16:35:32,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:35:32,575 INFO L93 Difference]: Finished difference Result 238 states and 247 transitions. [2018-04-10 16:35:32,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-10 16:35:32,575 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2018-04-10 16:35:32,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:35:32,576 INFO L225 Difference]: With dead ends: 238 [2018-04-10 16:35:32,576 INFO L226 Difference]: Without dead ends: 238 [2018-04-10 16:35:32,576 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=163, Invalid=760, Unknown=7, NotChecked=0, Total=930 [2018-04-10 16:35:32,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-04-10 16:35:32,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 229. [2018-04-10 16:35:32,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-04-10 16:35:32,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 241 transitions. [2018-04-10 16:35:32,578 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 241 transitions. Word has length 54 [2018-04-10 16:35:32,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:35:32,578 INFO L459 AbstractCegarLoop]: Abstraction has 229 states and 241 transitions. [2018-04-10 16:35:32,578 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-10 16:35:32,579 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 241 transitions. [2018-04-10 16:35:32,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-10 16:35:32,579 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:35:32,579 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:35:32,579 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:35:32,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1725125489, now seen corresponding path program 1 times [2018-04-10 16:35:32,579 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:35:32,579 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:35:32,580 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:32,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:32,580 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:32,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:32,585 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:35:32,587 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:35:32,587 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:35:32,587 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:35:32,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:32,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:32,606 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:35:32,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:35:32,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:35:32,668 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:32,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:32,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:35:32,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:35:32,688 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:32,689 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:32,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:32,702 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2018-04-10 16:35:32,742 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:32,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 51 [2018-04-10 16:35:32,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:35:32,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:32,752 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:32,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-04-10 16:35:32,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 3 [2018-04-10 16:35:32,761 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:32,762 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:32,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:32,778 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:62, output treesize:47 [2018-04-10 16:35:33,044 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:33,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-04-10 16:35:33,055 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 33 treesize of output 30 [2018-04-10 16:35:33,056 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 16:35:33,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:35:33,068 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:33,075 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-10 16:35:33,086 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-10 16:35:33,086 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:58, output treesize:65 [2018-04-10 16:35:33,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:35:33,216 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:35:33,216 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-04-10 16:35:33,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-10 16:35:33,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-10 16:35:33,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=245, Unknown=22, NotChecked=0, Total=306 [2018-04-10 16:35:33,216 INFO L87 Difference]: Start difference. First operand 229 states and 241 transitions. Second operand 18 states. [2018-04-10 16:35:34,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:35:34,004 INFO L93 Difference]: Finished difference Result 232 states and 243 transitions. [2018-04-10 16:35:34,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-10 16:35:34,004 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 57 [2018-04-10 16:35:34,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:35:34,005 INFO L225 Difference]: With dead ends: 232 [2018-04-10 16:35:34,005 INFO L226 Difference]: Without dead ends: 189 [2018-04-10 16:35:34,005 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 30 SyntacticMatches, 10 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=110, Invalid=611, Unknown=35, NotChecked=0, Total=756 [2018-04-10 16:35:34,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-04-10 16:35:34,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-04-10 16:35:34,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-04-10 16:35:34,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 200 transitions. [2018-04-10 16:35:34,007 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 200 transitions. Word has length 57 [2018-04-10 16:35:34,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:35:34,007 INFO L459 AbstractCegarLoop]: Abstraction has 189 states and 200 transitions. [2018-04-10 16:35:34,008 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-10 16:35:34,008 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 200 transitions. [2018-04-10 16:35:34,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-10 16:35:34,008 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:35:34,008 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] [2018-04-10 16:35:34,008 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:35:34,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1823346732, now seen corresponding path program 1 times [2018-04-10 16:35:34,009 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:35:34,009 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:35:34,009 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:34,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:34,010 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:34,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:34,019 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:35:34,025 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:35:34,025 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:35:34,025 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:35:34,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:34,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:34,073 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:35:34,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:35:34,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:34,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:34,090 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:35:34,108 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:34,109 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:34,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-10 16:35:34,110 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:34,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:34,119 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-10 16:35:34,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:35:34,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:35:34,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:34,140 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:34,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:35:34,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:35:34,160 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:34,162 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:34,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:34,176 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2018-04-10 16:35:34,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 64 [2018-04-10 16:35:34,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:35:34,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:34,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:34,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-10 16:35:34,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:35:34,235 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:34,239 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:34,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:34,251 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:84, output treesize:68 [2018-04-10 16:35:34,319 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:34,320 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:34,320 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:34,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 53 [2018-04-10 16:35:34,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:34,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:34,336 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:90, output treesize:96 [2018-04-10 16:35:34,361 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:34,362 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 70 treesize of output 74 [2018-04-10 16:35:34,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2018-04-10 16:35:34,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:35:34,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:35:34,423 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:34,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 73 [2018-04-10 16:35:34,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 17 [2018-04-10 16:35:34,429 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:34,438 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:34,440 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:34,444 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 70 treesize of output 89 [2018-04-10 16:35:34,446 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:34,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-10 16:35:34,447 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:34,458 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:34,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 16:35:34,493 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:126, output treesize:181 [2018-04-10 16:35:34,563 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:34,566 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:34,568 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 113 treesize of output 104 [2018-04-10 16:35:34,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-10 16:35:34,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:34,580 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:34,600 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 44 treesize of output 45 [2018-04-10 16:35:34,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-04-10 16:35:34,601 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:34,606 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:34,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:34,620 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:144, output treesize:120 [2018-04-10 16:35:34,692 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 39 treesize of output 35 [2018-04-10 16:35:34,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:35:34,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:34,701 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:35:34,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-10 16:35:34,702 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:34,705 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:34,719 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-10 16:35:34,719 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:137, output treesize:105 [2018-04-10 16:35:34,781 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:34,782 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:35:34,782 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:34,783 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:34,785 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 78 [2018-04-10 16:35:34,787 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:35:34,791 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 49 [2018-04-10 16:35:34,792 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 16:35:34,805 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:35:34,805 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 46 treesize of output 38 [2018-04-10 16:35:34,805 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:34,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2018-04-10 16:35:34,811 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:34,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:34,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:34,827 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:112, output treesize:28 [2018-04-10 16:35:34,883 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:35:34,884 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:35:34,884 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-10 16:35:34,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-10 16:35:34,884 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-10 16:35:34,884 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=318, Unknown=1, NotChecked=0, Total=380 [2018-04-10 16:35:34,884 INFO L87 Difference]: Start difference. First operand 189 states and 200 transitions. Second operand 20 states. [2018-04-10 16:35:36,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:35:36,176 INFO L93 Difference]: Finished difference Result 257 states and 268 transitions. [2018-04-10 16:35:36,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-10 16:35:36,176 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 60 [2018-04-10 16:35:36,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:35:36,177 INFO L225 Difference]: With dead ends: 257 [2018-04-10 16:35:36,177 INFO L226 Difference]: Without dead ends: 257 [2018-04-10 16:35:36,178 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=292, Invalid=1429, Unknown=1, NotChecked=0, Total=1722 [2018-04-10 16:35:36,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-04-10 16:35:36,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 192. [2018-04-10 16:35:36,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-04-10 16:35:36,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 204 transitions. [2018-04-10 16:35:36,180 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 204 transitions. Word has length 60 [2018-04-10 16:35:36,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:35:36,180 INFO L459 AbstractCegarLoop]: Abstraction has 192 states and 204 transitions. [2018-04-10 16:35:36,180 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-10 16:35:36,180 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 204 transitions. [2018-04-10 16:35:36,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-10 16:35:36,180 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:35:36,180 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] [2018-04-10 16:35:36,180 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:35:36,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1823346733, now seen corresponding path program 1 times [2018-04-10 16:35:36,181 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:35:36,181 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:35:36,181 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:36,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:36,181 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:36,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:36,187 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:35:36,199 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:35:36,199 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:35:36,199 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:35:36,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:36,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:36,253 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:35:36,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:35:36,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:36,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:36,260 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:35:36,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-10 16:35:36,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 10 treesize of output 9 [2018-04-10 16:35:36,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:36,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:36,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:36,278 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-04-10 16:35:36,299 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:36,300 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:36,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-10 16:35:36,301 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:36,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:36,309 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2018-04-10 16:35:36,327 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 19 [2018-04-10 16:35:36,329 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:36,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 16:35:36,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:36,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:36,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:35:36,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:35:36,347 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:36,348 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:36,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:36,356 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:37 [2018-04-10 16:35:36,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 39 [2018-04-10 16:35:36,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:35:36,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:36,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:36,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 47 [2018-04-10 16:35:36,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:35:36,402 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:36,406 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:36,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:36,416 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:79, output treesize:63 [2018-04-10 16:35:36,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:35:36,489 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:36,506 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:36,507 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:36,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 32 [2018-04-10 16:35:36,507 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:36,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:36,524 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:99, output treesize:100 [2018-04-10 16:35:36,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-04-10 16:35:36,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:36,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 58 [2018-04-10 16:35:36,587 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:35:36,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2018-04-10 16:35:36,587 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:36,595 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:36,621 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:36,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 64 [2018-04-10 16:35:36,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 2 case distinctions, treesize of input 25 treesize of output 31 [2018-04-10 16:35:36,629 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-10 16:35:36,643 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:35:36,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 16:35:36,668 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:127, output treesize:165 [2018-04-10 16:35:36,739 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:36,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 124 [2018-04-10 16:35:36,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 112 [2018-04-10 16:35:36,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:36,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:36,832 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:36,833 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:36,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 101 [2018-04-10 16:35:36,846 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 99 treesize of output 98 [2018-04-10 16:35:36,847 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:36,883 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:36,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:36,898 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:121, output treesize:113 [2018-04-10 16:35:36,961 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 37 treesize of output 26 [2018-04-10 16:35:36,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-04-10 16:35:36,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:36,964 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:36,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:36,980 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:167, output treesize:155 [2018-04-10 16:35:37,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 39 [2018-04-10 16:35:37,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2018-04-10 16:35:37,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:37,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2018-04-10 16:35:37,066 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:37,071 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:35:37,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-10 16:35:37,072 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:37,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:35:37,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-10 16:35:37,096 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:162, output treesize:272 [2018-04-10 16:35:37,294 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:37,294 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:35:37,295 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:37,296 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:37,298 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 112 [2018-04-10 16:35:37,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2018-04-10 16:35:37,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:37,312 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:35:37,313 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 50 treesize of output 43 [2018-04-10 16:35:37,313 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:37,323 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:35:37,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 30 [2018-04-10 16:35:37,324 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:37,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:37,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-04-10 16:35:37,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-04-10 16:35:37,354 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:37,364 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:35:37,364 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-10 16:35:37,364 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:37,370 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:37,371 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:35:37,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-04-10 16:35:37,371 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:37,374 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:37,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:37,382 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:169, output treesize:9 [2018-04-10 16:35:37,451 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:35:37,451 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:35:37,452 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-10 16:35:37,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-10 16:35:37,452 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-10 16:35:37,452 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=590, Unknown=0, NotChecked=0, Total=650 [2018-04-10 16:35:37,452 INFO L87 Difference]: Start difference. First operand 192 states and 204 transitions. Second operand 26 states. [2018-04-10 16:35:41,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:35:41,750 INFO L93 Difference]: Finished difference Result 289 states and 299 transitions. [2018-04-10 16:35:41,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-10 16:35:41,750 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 60 [2018-04-10 16:35:41,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:35:41,750 INFO L225 Difference]: With dead ends: 289 [2018-04-10 16:35:41,751 INFO L226 Difference]: Without dead ends: 289 [2018-04-10 16:35:41,751 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=372, Invalid=2381, Unknown=3, NotChecked=0, Total=2756 [2018-04-10 16:35:41,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-04-10 16:35:41,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 192. [2018-04-10 16:35:41,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-04-10 16:35:41,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 203 transitions. [2018-04-10 16:35:41,753 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 203 transitions. Word has length 60 [2018-04-10 16:35:41,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:35:41,753 INFO L459 AbstractCegarLoop]: Abstraction has 192 states and 203 transitions. [2018-04-10 16:35:41,753 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-10 16:35:41,753 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 203 transitions. [2018-04-10 16:35:41,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-10 16:35:41,753 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:35:41,754 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:35:41,754 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:35:41,754 INFO L82 PathProgramCache]: Analyzing trace with hash -594351121, now seen corresponding path program 2 times [2018-04-10 16:35:41,754 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:35:41,754 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:35:41,754 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:41,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:41,754 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:41,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:41,760 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:35:41,763 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:35:41,763 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:35:41,763 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:35:41,764 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:35:41,784 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 16:35:41,784 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:35:41,786 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:35:41,828 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:41,829 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:41,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-10 16:35:41,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:41,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:41,835 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-04-10 16:35:41,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:35:41,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:35:41,852 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:41,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:41,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:35:41,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:35:41,866 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:41,867 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:41,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:41,875 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:33 [2018-04-10 16:35:41,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-10 16:35:41,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:35:41,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:41,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:41,919 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 43 treesize of output 47 [2018-04-10 16:35:41,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:35:41,920 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:41,924 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:41,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:41,932 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:75, output treesize:59 [2018-04-10 16:35:41,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 14 [2018-04-10 16:35:41,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:35:41,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:41,996 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:42,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:42,010 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:88, output treesize:88 [2018-04-10 16:35:42,030 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:42,031 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:42,031 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:42,032 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:42,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-04-10 16:35:42,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:42,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:42,050 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:102, output treesize:108 [2018-04-10 16:35:42,079 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:42,080 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 75 treesize of output 79 [2018-04-10 16:35:42,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 39 [2018-04-10 16:35:42,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:35:42,101 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:35:42,132 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:42,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 96 [2018-04-10 16:35:42,138 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:42,139 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:35:42,139 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 54 [2018-04-10 16:35:42,140 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:42,150 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:42,152 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:42,153 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:35:42,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 83 [2018-04-10 16:35:42,156 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:35:42,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-04-10 16:35:42,157 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:42,165 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:42,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 16:35:42,192 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:135, output treesize:271 [2018-04-10 16:35:42,255 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:42,255 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:42,256 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:42,257 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:42,261 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 115 treesize of output 139 [2018-04-10 16:35:42,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:35:42,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:42,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:42,292 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:42,292 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:42,293 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:42,297 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 88 treesize of output 109 [2018-04-10 16:35:42,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 14 treesize of output 13 [2018-04-10 16:35:42,298 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:42,307 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:42,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:42,322 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:148, output treesize:132 [2018-04-10 16:35:42,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 60 [2018-04-10 16:35:42,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:35:42,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:42,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:42,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:42,417 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:203, output treesize:187 [2018-04-10 16:35:42,478 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:42,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 45 [2018-04-10 16:35:42,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:42,491 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-10 16:35:42,491 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:187, output treesize:156 [2018-04-10 16:35:42,521 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:42,521 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:42,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 123 [2018-04-10 16:35:42,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-04-10 16:35:42,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:42,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 33 [2018-04-10 16:35:42,534 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:42,542 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:35:42,543 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 46 treesize of output 36 [2018-04-10 16:35:42,543 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:42,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:42,566 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 52 treesize of output 50 [2018-04-10 16:35:42,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 7 treesize of output 7 [2018-04-10 16:35:42,567 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:42,574 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:35:42,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2018-04-10 16:35:42,575 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:42,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 11 [2018-04-10 16:35:42,580 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:42,582 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:42,588 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-10 16:35:42,588 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:167, output treesize:24 [2018-04-10 16:35:42,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2018-04-10 16:35:42,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 10 [2018-04-10 16:35:42,631 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:35:42,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:35:42,635 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:42,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:35:42,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:35:42,640 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:33, output treesize:18 [2018-04-10 16:35:42,689 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:35:42,690 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:35:42,690 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-10 16:35:42,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-10 16:35:42,690 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-10 16:35:42,690 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=508, Unknown=5, NotChecked=0, Total=600 [2018-04-10 16:35:42,691 INFO L87 Difference]: Start difference. First operand 192 states and 203 transitions. Second operand 25 states. [2018-04-10 16:35:44,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:35:44,064 INFO L93 Difference]: Finished difference Result 231 states and 239 transitions. [2018-04-10 16:35:44,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-10 16:35:44,064 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 60 [2018-04-10 16:35:44,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:35:44,065 INFO L225 Difference]: With dead ends: 231 [2018-04-10 16:35:44,065 INFO L226 Difference]: Without dead ends: 226 [2018-04-10 16:35:44,065 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=370, Invalid=2068, Unknown=12, NotChecked=0, Total=2450 [2018-04-10 16:35:44,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-04-10 16:35:44,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 192. [2018-04-10 16:35:44,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-04-10 16:35:44,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 202 transitions. [2018-04-10 16:35:44,067 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 202 transitions. Word has length 60 [2018-04-10 16:35:44,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:35:44,067 INFO L459 AbstractCegarLoop]: Abstraction has 192 states and 202 transitions. [2018-04-10 16:35:44,067 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-10 16:35:44,068 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 202 transitions. [2018-04-10 16:35:44,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-10 16:35:44,068 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:35:44,068 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:35:44,068 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:35:44,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1875985662, now seen corresponding path program 2 times [2018-04-10 16:35:44,068 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:35:44,068 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:35:44,069 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:44,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:35:44,069 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:44,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:44,077 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:35:44,079 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:35:44,080 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:35:44,080 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:35:44,080 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:35:44,100 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 16:35:44,101 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:35:44,103 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:35:44,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-10 16:35:44,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 16:35:44,128 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:44,129 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:44,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:44,132 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-04-10 16:35:44,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 16:35:44,141 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:44,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-04-10 16:35:44,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-04-10 16:35:44,160 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:44,177 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:44,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:44,181 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:31, output treesize:22 [2018-04-10 16:35:44,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 32 treesize of output 59 [2018-04-10 16:35:44,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 35 [2018-04-10 16:35:44,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:44,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-04-10 16:35:44,323 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:44,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:44,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:44,345 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:40, output treesize:36 [2018-04-10 16:35:44,377 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:44,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 41 treesize of output 74 [2018-04-10 16:35:44,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 43 [2018-04-10 16:35:44,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:35:44,532 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:44,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2018-04-10 16:35:44,532 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:44,582 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:44,587 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 41 treesize of output 43 [2018-04-10 16:35:44,588 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-10 16:35:44,636 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:44,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 50 [2018-04-10 16:35:44,645 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-04-10 16:35:44,681 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-04-10 16:35:44,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-04-10 16:35:44,706 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:54, output treesize:139 [2018-04-10 16:35:44,737 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:44,738 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:44,738 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 38 treesize of output 42 [2018-04-10 16:35:44,738 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:44,756 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:44,757 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:44,757 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 41 treesize of output 45 [2018-04-10 16:35:44,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:44,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:35:44,775 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:80, output treesize:76 [2018-04-10 16:35:44,801 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 61 treesize of output 58 [2018-04-10 16:35:44,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:35:44,803 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:44,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:44,862 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 55 treesize of output 52 [2018-04-10 16:35:44,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:35:44,863 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:44,873 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:44,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2018-04-10 16:35:44,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:35:44,903 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:44,912 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:44,937 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 57 treesize of output 54 [2018-04-10 16:35:44,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:35:44,939 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:44,949 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:44,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:35:44,972 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:120, output treesize:103 [2018-04-10 16:35:45,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 92 [2018-04-10 16:35:45,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 14 treesize of output 13 [2018-04-10 16:35:45,043 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:45,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:45,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 81 [2018-04-10 16:35:45,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:35:45,102 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:45,114 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:45,146 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 86 [2018-04-10 16:35:45,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:35:45,151 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:45,165 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:45,197 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 82 treesize of output 75 [2018-04-10 16:35:45,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:35:45,199 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:45,209 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:45,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-10 16:35:45,244 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:187, output treesize:155 [2018-04-10 16:35:45,291 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 94 treesize of output 84 [2018-04-10 16:35:45,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 11 treesize of output 3 [2018-04-10 16:35:45,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:45,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:35:45,320 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:45,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:45,355 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 82 treesize of output 72 [2018-04-10 16:35:45,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 15 [2018-04-10 16:35:45,356 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:45,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 7 [2018-04-10 16:35:45,366 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:45,373 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:45,393 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 2 xjuncts. [2018-04-10 16:35:45,393 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:177, output treesize:129 [2018-04-10 16:35:45,429 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:45,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, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 102 [2018-04-10 16:35:45,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 91 [2018-04-10 16:35:45,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:45,472 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:35:45,473 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:45,473 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 77 treesize of output 76 [2018-04-10 16:35:45,473 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:45,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:35:45,535 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:45,536 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 69 [2018-04-10 16:35:45,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, 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 24 [2018-04-10 16:35:45,538 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:45,545 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:45,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2018-04-10 16:35:45,575 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:147, output treesize:196 [2018-04-10 16:35:45,670 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:45,671 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:45,671 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 60 treesize of output 62 [2018-04-10 16:35:45,675 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10 treesize of output 15 [2018-04-10 16:35:45,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:45,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-10 16:35:45,683 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:45,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:45,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 74 [2018-04-10 16:35:45,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-10 16:35:45,718 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:45,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:35:45,728 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:45,735 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:45,761 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:45,762 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:45,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 88 [2018-04-10 16:35:45,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 77 [2018-04-10 16:35:45,767 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:45,796 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:45,796 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:45,796 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 76 treesize of output 70 [2018-04-10 16:35:45,797 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:45,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 61 [2018-04-10 16:35:45,822 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:45,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 73 treesize of output 68 [2018-04-10 16:35:45,854 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:45,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 57 [2018-04-10 16:35:45,884 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:45,912 INFO L267 ElimStorePlain]: Start of recursive call 8: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:35:45,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-2 vars, End of recursive call: 10 dim-0 vars, and 4 xjuncts. [2018-04-10 16:35:45,958 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 10 variables, input treesize:221, output treesize:213 [2018-04-10 16:35:46,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2018-04-10 16:35:46,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-10 16:35:46,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:46,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:35:46,076 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:46,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:46,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:46,081 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:43, output treesize:15 [2018-04-10 16:35:46,138 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:35:46,138 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:35:46,138 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-04-10 16:35:46,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-10 16:35:46,138 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-10 16:35:46,138 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2018-04-10 16:35:46,139 INFO L87 Difference]: Start difference. First operand 192 states and 202 transitions. Second operand 20 states. [2018-04-10 16:35:46,820 WARN L151 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 93 DAG size of output 80 [2018-04-10 16:35:47,019 WARN L151 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 127 DAG size of output 120 [2018-04-10 16:35:50,503 WARN L151 SmtUtils]: Spent 3449ms on a formula simplification. DAG size of input: 173 DAG size of output 161 [2018-04-10 16:35:50,652 WARN L151 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 134 DAG size of output 120 [2018-04-10 16:35:50,884 WARN L151 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 127 DAG size of output 122 [2018-04-10 16:35:51,072 WARN L151 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 134 DAG size of output 125 [2018-04-10 16:35:51,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:35:51,337 INFO L93 Difference]: Finished difference Result 198 states and 204 transitions. [2018-04-10 16:35:51,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-10 16:35:51,338 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 65 [2018-04-10 16:35:51,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:35:51,338 INFO L225 Difference]: With dead ends: 198 [2018-04-10 16:35:51,338 INFO L226 Difference]: Without dead ends: 198 [2018-04-10 16:35:51,339 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=242, Invalid=1090, Unknown=0, NotChecked=0, Total=1332 [2018-04-10 16:35:51,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-04-10 16:35:51,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 192. [2018-04-10 16:35:51,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-04-10 16:35:51,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 201 transitions. [2018-04-10 16:35:51,341 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 201 transitions. Word has length 65 [2018-04-10 16:35:51,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:35:51,341 INFO L459 AbstractCegarLoop]: Abstraction has 192 states and 201 transitions. [2018-04-10 16:35:51,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-10 16:35:51,342 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 201 transitions. [2018-04-10 16:35:51,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-10 16:35:51,342 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:35:51,342 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:35:51,342 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:35:51,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1875985661, now seen corresponding path program 1 times [2018-04-10 16:35:51,343 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:35:51,343 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:35:51,343 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:51,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:35:51,344 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:51,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:51,357 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:35:51,365 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:35:51,365 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:35:51,365 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:35:51,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:51,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:51,413 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:35:51,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:35:51,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:51,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:51,431 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:35:51,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-10 16:35:51,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 10 treesize of output 9 [2018-04-10 16:35:51,443 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:51,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:51,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:51,448 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-04-10 16:35:51,468 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:51,469 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:51,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-10 16:35:51,470 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:51,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:51,478 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:30 [2018-04-10 16:35:51,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:35:51,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:35:51,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:51,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:51,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-10 16:35:51,508 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:38 [2018-04-10 16:35:51,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 43 [2018-04-10 16:35:51,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:35:51,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:51,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:51,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:51,567 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:51 [2018-04-10 16:35:51,608 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:51,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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 28 [2018-04-10 16:35:51,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:35:51,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:51,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:51,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:51,621 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:73, output treesize:68 [2018-04-10 16:35:51,639 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:51,639 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:51,640 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:51,640 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-10 16:35:51,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:51,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:51,647 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:73, output treesize:66 [2018-04-10 16:35:51,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 56 [2018-04-10 16:35:51,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 16:35:51,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:35:51,687 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:35:51,706 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 2 xjuncts. [2018-04-10 16:35:51,706 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:77, output treesize:132 [2018-04-10 16:35:51,753 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:51,757 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 70 treesize of output 78 [2018-04-10 16:35:51,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:35:51,759 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:51,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:51,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:51,773 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:82, output treesize:70 [2018-04-10 16:35:51,801 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 82 treesize of output 51 [2018-04-10 16:35:51,803 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 35 treesize of output 32 [2018-04-10 16:35:51,803 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:51,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-04-10 16:35:51,808 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:51,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2018-04-10 16:35:51,813 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:51,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:51,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:51,821 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:94, output treesize:34 [2018-04-10 16:35:51,864 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 41 [2018-04-10 16:35:51,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 16:35:51,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:51,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:51,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:51,876 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:43 [2018-04-10 16:35:51,905 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:51,907 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 41 treesize of output 56 [2018-04-10 16:35:51,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 9 [2018-04-10 16:35:51,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:51,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:51,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:51,919 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:56, output treesize:43 [2018-04-10 16:35:51,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 41 treesize of output 95 [2018-04-10 16:35:51,967 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-10 16:35:51,976 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:51,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 68 [2018-04-10 16:35:51,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:35:52,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 37 [2018-04-10 16:35:52,160 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:52,282 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:52,287 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 39 treesize of output 48 [2018-04-10 16:35:52,287 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-10 16:35:52,368 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:52,373 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 39 treesize of output 48 [2018-04-10 16:35:52,373 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-10 16:35:52,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-10 16:35:52,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 18 dim-0 vars, and 4 xjuncts. [2018-04-10 16:35:52,478 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:56, output treesize:182 [2018-04-10 16:35:52,614 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 76 [2018-04-10 16:35:52,616 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:52,617 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:52,618 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:52,618 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 56 treesize of output 53 [2018-04-10 16:35:52,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:52,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10 16:35:52,709 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:52,796 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:52,796 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:52,797 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 52 treesize of output 46 [2018-04-10 16:35:52,797 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:52,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2018-04-10 16:35:52,877 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:52,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 41 [2018-04-10 16:35:52,952 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:53,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 42 [2018-04-10 16:35:53,036 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:53,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-04-10 16:35:53,113 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:53,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2018-04-10 16:35:53,190 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:53,261 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:53,262 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:53,262 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:53,263 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:53,264 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:53,264 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:53,265 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:53,265 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:53,266 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 60 [2018-04-10 16:35:53,266 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:53,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2018-04-10 16:35:53,345 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:53,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2018-04-10 16:35:53,418 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:53,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-10 16:35:53,491 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:53,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 41 [2018-04-10 16:35:53,562 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:53,632 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:53,632 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:53,633 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:53,633 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:53,634 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:53,634 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:53,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 48 [2018-04-10 16:35:53,635 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:53,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2018-04-10 16:35:53,695 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:53,754 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:53,755 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:53,755 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 45 treesize of output 41 [2018-04-10 16:35:53,755 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:53,810 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:53,811 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:53,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2018-04-10 16:35:53,811 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:53,865 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:53,866 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:53,866 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:53,867 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:53,867 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:53,871 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:53,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 44 [2018-04-10 16:35:53,872 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:53,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2018-04-10 16:35:53,922 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:53,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-04-10 16:35:53,968 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:53,998 INFO L267 ElimStorePlain]: Start of recursive call 2: 20 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-10 16:35:54,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2018-04-10 16:35:54,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:35:54,059 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:54,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:35:54,065 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:54,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-10 16:35:54,069 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:54,072 INFO L267 ElimStorePlain]: Start of recursive call 23: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:54,121 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 45 treesize of output 45 [2018-04-10 16:35:54,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-10 16:35:54,122 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:54,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:35:54,129 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:54,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:35:54,133 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:54,136 INFO L267 ElimStorePlain]: Start of recursive call 27: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:54,189 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 45 treesize of output 37 [2018-04-10 16:35:54,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:35:54,190 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:54,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 7 treesize of output 1 [2018-04-10 16:35:54,197 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:54,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-10 16:35:54,202 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:54,205 INFO L267 ElimStorePlain]: Start of recursive call 31: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:54,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 22 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:35:54,244 INFO L202 ElimStorePlain]: Needed 34 recursive calls to eliminate 26 variables, input treesize:190, output treesize:7 [2018-04-10 16:35:54,292 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-10 16:35:54,292 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:35:54,292 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-10 16:35:54,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-10 16:35:54,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-10 16:35:54,293 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2018-04-10 16:35:54,293 INFO L87 Difference]: Start difference. First operand 192 states and 201 transitions. Second operand 24 states. [2018-04-10 16:35:55,515 WARN L151 SmtUtils]: Spent 226ms on a formula simplification. DAG size of input: 152 DAG size of output 152 [2018-04-10 16:35:55,797 WARN L151 SmtUtils]: Spent 234ms on a formula simplification. DAG size of input: 156 DAG size of output 156 [2018-04-10 16:35:56,370 WARN L151 SmtUtils]: Spent 227ms on a formula simplification. DAG size of input: 150 DAG size of output 150 [2018-04-10 16:35:56,761 WARN L151 SmtUtils]: Spent 218ms on a formula simplification. DAG size of input: 144 DAG size of output 144 [2018-04-10 16:35:56,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:35:56,845 INFO L93 Difference]: Finished difference Result 318 states and 327 transitions. [2018-04-10 16:35:56,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-10 16:35:56,846 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 65 [2018-04-10 16:35:56,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:35:56,846 INFO L225 Difference]: With dead ends: 318 [2018-04-10 16:35:56,846 INFO L226 Difference]: Without dead ends: 318 [2018-04-10 16:35:56,847 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=330, Invalid=2120, Unknown=0, NotChecked=0, Total=2450 [2018-04-10 16:35:56,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-04-10 16:35:56,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 221. [2018-04-10 16:35:56,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-04-10 16:35:56,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 231 transitions. [2018-04-10 16:35:56,850 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 231 transitions. Word has length 65 [2018-04-10 16:35:56,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:35:56,850 INFO L459 AbstractCegarLoop]: Abstraction has 221 states and 231 transitions. [2018-04-10 16:35:56,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-10 16:35:56,850 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 231 transitions. [2018-04-10 16:35:56,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-10 16:35:56,851 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:35:56,851 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:35:56,851 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:35:56,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1283781, now seen corresponding path program 3 times [2018-04-10 16:35:56,851 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:35:56,851 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:35:56,852 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:56,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:35:56,852 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:56,863 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:35:56,866 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:35:56,866 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:35:56,866 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:35:56,866 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 16:35:56,937 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-10 16:35:56,938 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:35:56,941 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:35:56,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:35:56,944 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:56,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:56,947 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:35:56,964 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:56,965 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:56,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-10 16:35:56,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:56,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:56,974 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-10 16:35:56,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:35:56,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:35:56,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:56,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:56,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:56,996 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2018-04-10 16:35:57,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 43 [2018-04-10 16:35:57,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:35:57,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:57,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:57,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:57,031 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:45 [2018-04-10 16:35:57,075 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:57,076 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:57,076 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:57,077 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-10 16:35:57,077 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:57,087 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 6 treesize of output 5 [2018-04-10 16:35:57,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:57,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:57,096 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:68 [2018-04-10 16:35:57,118 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 57 treesize of output 52 [2018-04-10 16:35:57,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 16:35:57,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:35:57,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:35:57,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 16:35:57,156 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:79, output treesize:144 [2018-04-10 16:35:57,215 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 76 treesize of output 84 [2018-04-10 16:35:57,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:35:57,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:57,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:57,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:57,247 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:88, output treesize:76 [2018-04-10 16:35:57,319 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 21 treesize of output 15 [2018-04-10 16:35:57,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:57,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:57,330 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:119, output treesize:102 [2018-04-10 16:35:57,355 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:57,355 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:57,356 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:57,357 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:57,357 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 102 [2018-04-10 16:35:57,357 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:57,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:57,372 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:113, output treesize:131 [2018-04-10 16:35:57,411 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:57,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, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 105 [2018-04-10 16:35:57,418 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 2 case distinctions, treesize of input 29 treesize of output 35 [2018-04-10 16:35:57,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:35:57,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:35:57,464 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 2 xjuncts. [2018-04-10 16:35:57,464 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:145, output treesize:248 [2018-04-10 16:35:57,558 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:57,558 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:57,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 131 [2018-04-10 16:35:57,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-04-10 16:35:57,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:57,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:57,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:57,593 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:183, output treesize:167 [2018-04-10 16:35:57,659 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:57,660 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:57,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 92 [2018-04-10 16:35:57,667 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2018-04-10 16:35:57,667 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 16:35:57,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-04-10 16:35:57,684 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:57,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2018-04-10 16:35:57,702 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-10 16:35:57,703 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 48 treesize of output 35 [2018-04-10 16:35:57,703 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:57,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2018-04-10 16:35:57,724 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:57,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2018-04-10 16:35:57,725 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:35:57,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-10 16:35:57,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-04-10 16:35:57,760 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:171, output treesize:91 [2018-04-10 16:35:57,867 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:35:57,867 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:35:57,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-10 16:35:57,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-10 16:35:57,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-10 16:35:57,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=520, Unknown=1, NotChecked=0, Total=600 [2018-04-10 16:35:57,868 INFO L87 Difference]: Start difference. First operand 221 states and 231 transitions. Second operand 25 states. [2018-04-10 16:35:59,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:35:59,815 INFO L93 Difference]: Finished difference Result 288 states and 298 transitions. [2018-04-10 16:35:59,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-10 16:35:59,815 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 65 [2018-04-10 16:35:59,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:35:59,816 INFO L225 Difference]: With dead ends: 288 [2018-04-10 16:35:59,816 INFO L226 Difference]: Without dead ends: 288 [2018-04-10 16:35:59,816 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=351, Invalid=2399, Unknown=6, NotChecked=0, Total=2756 [2018-04-10 16:35:59,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-04-10 16:35:59,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 229. [2018-04-10 16:35:59,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-04-10 16:35:59,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 240 transitions. [2018-04-10 16:35:59,819 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 240 transitions. Word has length 65 [2018-04-10 16:35:59,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:35:59,819 INFO L459 AbstractCegarLoop]: Abstraction has 229 states and 240 transitions. [2018-04-10 16:35:59,819 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-10 16:35:59,819 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 240 transitions. [2018-04-10 16:35:59,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-10 16:35:59,819 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:35:59,819 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:35:59,820 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:35:59,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1283782, now seen corresponding path program 2 times [2018-04-10 16:35:59,820 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:35:59,820 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:35:59,820 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:59,820 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:35:59,821 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:35:59,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:35:59,829 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:35:59,832 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:35:59,832 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:35:59,833 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:35:59,833 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:35:59,875 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 16:35:59,875 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:35:59,877 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:35:59,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:35:59,892 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:59,901 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:59,901 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:35:59,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-10 16:35:59,902 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:59,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:35:59,924 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-10 16:35:59,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:35:59,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:35:59,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:35:59,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:00,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:00,001 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:41 [2018-04-10 16:36:00,047 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 48 treesize of output 52 [2018-04-10 16:36:00,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 14 treesize of output 13 [2018-04-10 16:36:00,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:00,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:00,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:36:00,065 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:54 [2018-04-10 16:36:00,196 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:00,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-04-10 16:36:00,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:00,221 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:00,222 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:00,222 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:00,223 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-10 16:36:00,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:00,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:36:00,244 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:86, output treesize:95 [2018-04-10 16:36:00,284 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:00,285 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 77 treesize of output 81 [2018-04-10 16:36:00,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 39 [2018-04-10 16:36:00,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:36:00,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:36:00,342 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:00,344 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 74 treesize of output 91 [2018-04-10 16:36:00,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-10 16:36:00,346 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:00,356 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:00,357 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:00,360 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 74 treesize of output 79 [2018-04-10 16:36:00,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:36:00,361 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:00,371 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:00,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 16:36:00,402 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:125, output treesize:250 [2018-04-10 16:36:00,480 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:00,483 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 83 treesize of output 84 [2018-04-10 16:36:00,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:36:00,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:00,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:00,511 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:00,512 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:00,512 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:00,516 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 112 treesize of output 128 [2018-04-10 16:36:00,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:36:00,518 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:00,530 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:00,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:36:00,546 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:147, output treesize:119 [2018-04-10 16:36:00,677 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:00,678 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:00,678 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 48 treesize of output 91 [2018-04-10 16:36:00,678 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:00,710 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:00,710 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:00,711 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:00,711 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:00,712 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:00,712 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 37 treesize of output 73 [2018-04-10 16:36:00,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:00,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:36:00,729 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:195, output treesize:186 [2018-04-10 16:36:00,768 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 168 treesize of output 155 [2018-04-10 16:36:00,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2018-04-10 16:36:00,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:36:00,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:36:00,837 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:00,841 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:00,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 170 [2018-04-10 16:36:00,849 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 2 case distinctions, treesize of input 20 treesize of output 27 [2018-04-10 16:36:00,849 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-10 16:36:00,872 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:36:00,873 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:00,875 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:00,877 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:00,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 168 [2018-04-10 16:36:00,881 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 26 treesize of output 21 [2018-04-10 16:36:00,881 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:00,896 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:00,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 16:36:00,940 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:208, output treesize:331 [2018-04-10 16:36:01,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, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 275 treesize of output 259 [2018-04-10 16:36:01,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-04-10 16:36:01,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:01,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:01,066 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:01,067 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:01,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 257 treesize of output 183 [2018-04-10 16:36:01,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 37 [2018-04-10 16:36:01,076 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:01,089 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:01,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:36:01,105 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:287, output treesize:247 [2018-04-10 16:36:01,197 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:01,198 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:01,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 244 treesize of output 140 [2018-04-10 16:36:01,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2018-04-10 16:36:01,204 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:36:01,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-04-10 16:36:01,221 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:01,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 20 [2018-04-10 16:36:01,236 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:36:01,254 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 44 treesize of output 29 [2018-04-10 16:36:01,254 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:01,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:36:01,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2018-04-10 16:36:01,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:36:01,286 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:01,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-04-10 16:36:01,345 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:01,367 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:01,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:36:01,396 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:258, output treesize:38 [2018-04-10 16:36:01,578 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:36:01,578 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:36:01,578 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-10 16:36:01,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-10 16:36:01,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-10 16:36:01,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2018-04-10 16:36:01,579 INFO L87 Difference]: Start difference. First operand 229 states and 240 transitions. Second operand 26 states. [2018-04-10 16:36:03,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:36:03,652 INFO L93 Difference]: Finished difference Result 329 states and 339 transitions. [2018-04-10 16:36:03,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-10 16:36:03,653 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 65 [2018-04-10 16:36:03,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:36:03,653 INFO L225 Difference]: With dead ends: 329 [2018-04-10 16:36:03,653 INFO L226 Difference]: Without dead ends: 329 [2018-04-10 16:36:03,654 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=405, Invalid=2565, Unknown=0, NotChecked=0, Total=2970 [2018-04-10 16:36:03,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-04-10 16:36:03,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 235. [2018-04-10 16:36:03,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-04-10 16:36:03,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 246 transitions. [2018-04-10 16:36:03,656 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 246 transitions. Word has length 65 [2018-04-10 16:36:03,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:36:03,656 INFO L459 AbstractCegarLoop]: Abstraction has 235 states and 246 transitions. [2018-04-10 16:36:03,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-10 16:36:03,656 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 246 transitions. [2018-04-10 16:36:03,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-10 16:36:03,656 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:36:03,657 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:36:03,657 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:36:03,657 INFO L82 PathProgramCache]: Analyzing trace with hash 973379520, now seen corresponding path program 1 times [2018-04-10 16:36:03,657 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:36:03,657 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:36:03,657 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:36:03,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:36:03,658 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:36:03,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:36:03,663 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:36:03,667 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:36:03,667 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:36:03,667 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:36:03,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:36:03,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:36:03,689 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:36:03,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:36:03,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:03,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:03,693 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:36:03,707 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:03,708 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:03,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-10 16:36:03,708 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:03,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:03,713 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-04-10 16:36:03,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:36:03,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 8 treesize of output 7 [2018-04-10 16:36:03,724 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:03,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:03,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:36:03,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:36:03,734 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:03,735 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:03,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:03,742 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:39, output treesize:28 [2018-04-10 16:36:03,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 29 treesize of output 30 [2018-04-10 16:36:03,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 14 treesize of output 13 [2018-04-10 16:36:03,767 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:03,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:03,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 47 [2018-04-10 16:36:03,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:36:03,783 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:03,787 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:03,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-10 16:36:03,798 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:70, output treesize:54 [2018-04-10 16:36:03,818 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 42 treesize of output 30 [2018-04-10 16:36:03,819 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-10 16:36:03,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:03,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:36:03,823 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:03,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:03,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:36:03,831 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:58, output treesize:39 [2018-04-10 16:36:03,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2018-04-10 16:36:03,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2018-04-10 16:36:03,877 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 16:36:03,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 16:36:03,904 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 2 xjuncts. [2018-04-10 16:36:03,904 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:75 [2018-04-10 16:36:03,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 64 [2018-04-10 16:36:03,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 43 [2018-04-10 16:36:03,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:04,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 39 [2018-04-10 16:36:04,038 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-10 16:36:04,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:36:04,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-04-10 16:36:04,095 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:48, output treesize:83 [2018-04-10 16:36:28,785 WARN L148 SmtUtils]: Spent 16640ms on a formula simplification that was a NOOP. DAG size: 49 [2018-04-10 16:36:53,011 WARN L148 SmtUtils]: Spent 22139ms on a formula simplification that was a NOOP. DAG size: 49 [2018-04-10 16:36:53,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 61 [2018-04-10 16:36:53,030 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:36:53,030 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 53 treesize of output 49 [2018-04-10 16:36:53,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:53,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2018-04-10 16:36:53,071 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:53,117 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:36:53,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2018-04-10 16:36:53,118 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:53,158 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:53,159 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:36:53,160 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:36:53,165 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 52 [2018-04-10 16:36:53,166 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-10 16:36:53,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:53,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-04-10 16:36:53,225 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:36:53,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-10 16:36:53,226 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:53,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-04-10 16:36:53,233 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:36:53,237 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:53,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:36:53,247 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 13 variables, input treesize:103, output treesize:3 [2018-04-10 16:36:53,285 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-10 16:36:53,286 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:36:53,286 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-10 16:36:53,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-10 16:36:53,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-10 16:36:53,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=232, Unknown=5, NotChecked=0, Total=272 [2018-04-10 16:36:53,286 INFO L87 Difference]: Start difference. First operand 235 states and 246 transitions. Second operand 17 states. Received shutdown request... [2018-04-10 16:38:14,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-10 16:38:14,083 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-10 16:38:14,087 WARN L197 ceAbstractionStarter]: Timeout [2018-04-10 16:38:14,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.04 04:38:14 BoogieIcfgContainer [2018-04-10 16:38:14,087 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-10 16:38:14,088 INFO L168 Benchmark]: Toolchain (without parser) took 203702.29 ms. Allocated memory was 393.2 MB in the beginning and 909.1 MB in the end (delta: 515.9 MB). Free memory was 327.0 MB in the beginning and 583.9 MB in the end (delta: -257.0 MB). Peak memory consumption was 258.9 MB. Max. memory is 5.3 GB. [2018-04-10 16:38:14,089 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 393.2 MB. Free memory is still 350.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-10 16:38:14,089 INFO L168 Benchmark]: CACSL2BoogieTranslator took 236.60 ms. Allocated memory is still 393.2 MB. Free memory was 327.0 MB in the beginning and 300.5 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 5.3 GB. [2018-04-10 16:38:14,089 INFO L168 Benchmark]: Boogie Preprocessor took 43.05 ms. Allocated memory is still 393.2 MB. Free memory was 300.5 MB in the beginning and 295.3 MB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 5.3 GB. [2018-04-10 16:38:14,090 INFO L168 Benchmark]: RCFGBuilder took 449.42 ms. Allocated memory was 393.2 MB in the beginning and 593.0 MB in the end (delta: 199.8 MB). Free memory was 295.3 MB in the beginning and 511.8 MB in the end (delta: -216.6 MB). Peak memory consumption was 22.7 MB. Max. memory is 5.3 GB. [2018-04-10 16:38:14,090 INFO L168 Benchmark]: TraceAbstraction took 202970.55 ms. Allocated memory was 593.0 MB in the beginning and 909.1 MB in the end (delta: 316.1 MB). Free memory was 511.8 MB in the beginning and 583.9 MB in the end (delta: -72.1 MB). Peak memory consumption was 244.0 MB. Max. memory is 5.3 GB. [2018-04-10 16:38:14,091 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.18 ms. Allocated memory is still 393.2 MB. Free memory is still 350.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 236.60 ms. Allocated memory is still 393.2 MB. Free memory was 327.0 MB in the beginning and 300.5 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 43.05 ms. Allocated memory is still 393.2 MB. Free memory was 300.5 MB in the beginning and 295.3 MB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 449.42 ms. Allocated memory was 393.2 MB in the beginning and 593.0 MB in the end (delta: 199.8 MB). Free memory was 295.3 MB in the beginning and 511.8 MB in the end (delta: -216.6 MB). Peak memory consumption was 22.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 202970.55 ms. Allocated memory was 593.0 MB in the beginning and 909.1 MB in the end (delta: 316.1 MB). Free memory was 511.8 MB in the beginning and 583.9 MB in the end (delta: -72.1 MB). Peak memory consumption was 244.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1013]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1013). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1012]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1012). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1026]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 994]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 994). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1021]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1036]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1036). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1019]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 995]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1038]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1038). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1007]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1007). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1006]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1004]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1004). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1024]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1010]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1010). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1033). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1021]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1013]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1013). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1033). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1034]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1034). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1025]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1006]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1025]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1037). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1019]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1022]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1012]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1012). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1030]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1026]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1010]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1010). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1013]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1013). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 995]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1012]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1012). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1022]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1013]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1013). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 994]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 994). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 990). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1038]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1038). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1034]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1034). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1004]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1004). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1012]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1012). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1037). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1024]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1036]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1036). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1007]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1007). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1030]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 15 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 137 locations, 55 error locations. TIMEOUT Result, 202.9s OverallTime, 32 OverallIterations, 3 TraceHistogramMax, 124.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2377 SDtfs, 11159 SDslu, 13752 SDs, 0 SdLazy, 19156 SolverSat, 1246 SolverUnsat, 122 SolverUnknown, 0 SolverNotchecked, 57.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1518 GetRequests, 707 SyntacticMatches, 14 SemanticMatches, 796 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5917 ImplicationChecksByTransitivity, 110.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=235occurred in iteration=31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 31 MinimizatonAttempts, 1483 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 76.8s InterpolantComputationTime, 2353 NumberOfCodeBlocks, 2353 NumberOfCodeBlocksAsserted, 59 NumberOfCheckSat, 1284 ConstructedInterpolants, 561 QuantifiedInterpolants, 3928699 SizeOfPredicates, 387 NumberOfNonLiveVariables, 4329 ConjunctsInSsa, 882 ConjunctsInUnsatCore, 33 InterpolantComputations, 21 PerfectInterpolantSequences, 36/148 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-token_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-10_16-38-14-096.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-token_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-10_16-38-14-096.csv Completed graceful shutdown