java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 18:00:32,370 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 18:00:32,371 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 18:00:32,384 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 18:00:32,384 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 18:00:32,385 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 18:00:32,386 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 18:00:32,387 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 18:00:32,389 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 18:00:32,390 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 18:00:32,390 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 18:00:32,390 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 18:00:32,391 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 18:00:32,392 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 18:00:32,393 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 18:00:32,394 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 18:00:32,396 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 18:00:32,397 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 18:00:32,398 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 18:00:32,399 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 18:00:32,400 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 18:00:32,400 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 18:00:32,400 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 18:00:32,401 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 18:00:32,402 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 18:00:32,403 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 18:00:32,403 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 18:00:32,403 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 18:00:32,404 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 18:00:32,404 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 18:00:32,405 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 18:00:32,405 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-11 18:00:32,424 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 18:00:32,424 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 18:00:32,425 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 18:00:32,425 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 18:00:32,425 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 18:00:32,426 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 18:00:32,426 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 18:00:32,426 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 18:00:32,426 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 18:00:32,426 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 18:00:32,426 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 18:00:32,426 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 18:00:32,427 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 18:00:32,427 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 18:00:32,427 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 18:00:32,427 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 18:00:32,427 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 18:00:32,427 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 18:00:32,427 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 18:00:32,427 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 18:00:32,428 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 18:00:32,428 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 18:00:32,428 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 18:00:32,428 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-11 18:00:32,455 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 18:00:32,464 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 18:00:32,468 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 18:00:32,470 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 18:00:32,470 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 18:00:32,470 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,763 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGc28341b47 [2018-04-11 18:00:32,884 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 18:00:32,884 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 18:00:32,885 INFO L168 CDTParser]: Scanning sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,892 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 18:00:32,892 INFO L215 ultiparseSymbolTable]: [2018-04-11 18:00:32,893 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 18:00:32,893 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,893 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 18:00:32,893 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__int16_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,893 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____dev_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,893 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsblkcnt_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,893 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____syscall_ulong_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,893 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____qaddr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,893 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____id_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,894 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____off64_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,894 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_rwlock_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,894 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____u_char in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,894 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_key_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,894 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_quad_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,894 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__fd_set in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,894 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__uid_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,894 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__lldiv_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,894 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____caddr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,894 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__mode_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,895 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____int32_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,895 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____suseconds_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,895 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_int32_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,895 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____pthread_slist_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,895 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsfilcnt_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,895 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_mutexattr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,895 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____rlim64_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,895 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____timer_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,895 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__fsblkcnt_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,896 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_int in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,896 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____uint16_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,896 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____blksize_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,896 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__int8_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,896 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____off_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,896 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__fsfilcnt_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,896 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____ino64_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,896 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____ssize_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,896 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____time_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,897 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_int64_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,897 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__ldiv_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,897 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____blkcnt64_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,897 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__ushort in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,897 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____syscall_slong_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,897 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__key_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,897 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__fd_mask in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,897 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_rwlockattr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,897 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____nlink_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,897 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__ino_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,898 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_mutex_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,898 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__idtype_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,898 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsfilcnt64_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,898 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__int32_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,898 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__register_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,898 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_barrierattr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,898 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__time_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,898 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____blkcnt_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,898 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__Colour in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,898 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__dev_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,899 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__sigset_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,899 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__id_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,899 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____int64_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,899 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,899 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____uid_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,899 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__loff_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,899 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_int8_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,899 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____fd_mask in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,899 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__nlink_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,899 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__uint in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,900 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____u_int in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,900 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____uint64_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,900 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__ssize_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,900 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsword_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,900 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____sig_atomic_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,900 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_attr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,900 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__wchar_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,900 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____useconds_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,900 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____int8_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,900 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____daddr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,900 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__clockid_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,901 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____clock_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,901 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__timer_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,901 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____uint8_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,901 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____key_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,901 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsblkcnt64_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,901 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____loff_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,901 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__fsid_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,901 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_condattr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,901 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____pid_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,901 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____gid_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,902 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__int64_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,902 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____mode_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,902 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____quad_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,902 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_long in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,902 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____u_quad_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,902 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__daddr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,902 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____intptr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,902 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__size_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,902 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsid_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,902 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__gid_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,902 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pid_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,903 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__clock_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,903 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_barrier_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,903 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____socklen_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,903 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__suseconds_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,903 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____rlim_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,903 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____u_short in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,903 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_int16_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,903 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__blkcnt_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,903 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__quad_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,903 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__ulong in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,903 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____clockid_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,904 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____u_long in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,904 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__div_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,904 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__caddr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,904 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_cond_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,904 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__SLL in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,904 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_short in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,904 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_char in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,904 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__off_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,904 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____uint32_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,904 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____int16_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,904 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____ino_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,905 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____sigset_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,905 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_once_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,905 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__blksize_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,905 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_spinlock_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:32,916 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGc28341b47 [2018-04-11 18:00:32,919 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 18:00:32,920 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 18:00:32,920 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 18:00:32,920 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 18:00:32,924 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 18:00:32,924 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 06:00:32" (1/1) ... [2018-04-11 18:00:32,926 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f92ed90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 06:00:32, skipping insertion in model container [2018-04-11 18:00:32,926 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 06:00:32" (1/1) ... [2018-04-11 18:00:32,936 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 18:00:32,962 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 18:00:33,103 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 18:00:33,141 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 18:00:33,146 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 115 non ball SCCs. Number of states in SCCs 115. [2018-04-11 18:00:33,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 06:00:33 WrapperNode [2018-04-11 18:00:33,184 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 18:00:33,185 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 18:00:33,185 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 18:00:33,185 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 18:00:33,194 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 06:00:33" (1/1) ... [2018-04-11 18:00:33,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 06:00:33" (1/1) ... [2018-04-11 18:00:33,206 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 06:00:33" (1/1) ... [2018-04-11 18:00:33,207 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 06:00:33" (1/1) ... [2018-04-11 18:00:33,216 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 06:00:33" (1/1) ... [2018-04-11 18:00:33,221 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 06:00:33" (1/1) ... [2018-04-11 18:00:33,223 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 06:00:33" (1/1) ... [2018-04-11 18:00:33,227 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 18:00:33,227 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 18:00:33,227 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 18:00:33,227 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 18:00:33,228 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 06:00:33" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 18:00:33,302 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 18:00:33,302 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 18:00:33,303 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 18:00:33,303 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 18:00:33,303 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 18:00:33,303 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 18:00:33,303 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 18:00:33,303 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 18:00:33,303 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 18:00:33,303 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 18:00:33,303 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 18:00:33,303 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 18:00:33,304 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 18:00:33,304 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 18:00:33,304 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 18:00:33,304 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 18:00:33,304 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 18:00:33,304 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 18:00:33,304 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 18:00:33,304 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 18:00:33,304 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 18:00:33,304 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 18:00:33,305 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 18:00:33,305 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 18:00:33,305 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 18:00:33,305 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 18:00:33,305 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 18:00:33,305 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 18:00:33,305 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 18:00:33,305 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 18:00:33,305 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 18:00:33,305 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 18:00:33,305 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 18:00:33,306 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 18:00:33,306 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 18:00:33,306 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 18:00:33,306 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 18:00:33,306 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 18:00:33,306 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 18:00:33,306 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 18:00:33,306 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 18:00:33,306 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 18:00:33,306 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 18:00:33,307 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 18:00:33,307 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 18:00:33,307 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 18:00:33,307 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 18:00:33,307 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 18:00:33,307 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 18:00:33,307 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 18:00:33,307 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 18:00:33,307 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 18:00:33,308 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 18:00:33,308 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 18:00:33,308 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 18:00:33,308 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 18:00:33,308 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 18:00:33,308 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 18:00:33,308 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 18:00:33,308 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 18:00:33,308 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 18:00:33,308 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-11 18:00:33,308 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 18:00:33,309 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 18:00:33,309 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-11 18:00:33,309 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 18:00:33,309 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 18:00:33,309 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-11 18:00:33,309 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 18:00:33,309 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 18:00:33,309 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 18:00:33,309 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 18:00:33,309 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 18:00:33,309 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 18:00:33,309 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 18:00:33,309 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 18:00:33,309 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 18:00:33,309 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 18:00:33,309 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 18:00:33,310 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 18:00:33,310 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 18:00:33,310 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 18:00:33,310 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 18:00:33,310 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 18:00:33,310 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 18:00:33,310 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 18:00:33,310 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 18:00:33,310 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 18:00:33,310 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 18:00:33,310 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 18:00:33,310 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 18:00:33,310 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 18:00:33,310 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 18:00:33,310 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 18:00:33,310 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 18:00:33,310 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 18:00:33,310 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 18:00:33,311 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 18:00:33,311 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 18:00:33,311 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 18:00:33,311 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 18:00:33,311 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 18:00:33,311 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 18:00:33,311 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 18:00:33,311 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 18:00:33,311 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 18:00:33,311 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 18:00:33,312 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-11 18:00:33,312 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 18:00:33,312 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 18:00:33,312 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-11 18:00:33,312 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 18:00:33,312 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-11 18:00:33,312 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 18:00:33,312 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 18:00:33,312 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 18:00:33,312 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 18:00:33,312 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 18:00:33,677 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 18:00:33,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 06:00:33 BoogieIcfgContainer [2018-04-11 18:00:33,678 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 18:00:33,678 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 18:00:33,679 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 18:00:33,681 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 18:00:33,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 06:00:32" (1/3) ... [2018-04-11 18:00:33,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@379cba4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 06:00:33, skipping insertion in model container [2018-04-11 18:00:33,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 06:00:33" (2/3) ... [2018-04-11 18:00:33,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@379cba4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 06:00:33, skipping insertion in model container [2018-04-11 18:00:33,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 06:00:33" (3/3) ... [2018-04-11 18:00:33,684 INFO L107 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 18:00:33,691 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 18:00:33,697 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 49 error locations. [2018-04-11 18:00:33,729 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 18:00:33,729 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 18:00:33,729 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 18:00:33,729 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 18:00:33,729 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 18:00:33,730 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 18:00:33,730 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 18:00:33,730 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 18:00:33,730 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 18:00:33,730 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 18:00:33,741 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2018-04-11 18:00:33,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-11 18:00:33,746 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:00:33,746 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 18:00:33,746 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 18:00:33,749 INFO L82 PathProgramCache]: Analyzing trace with hash -659694479, now seen corresponding path program 1 times [2018-04-11 18:00:33,750 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 18:00:33,750 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 18:00:33,781 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 18:00:33,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 18:00:33,781 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 18:00:33,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:00:33,809 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 18:00:33,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:00:33,853 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 18:00:33,854 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 18:00:33,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 18:00:33,862 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 18:00:33,862 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 18:00:33,864 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 4 states. [2018-04-11 18:00:34,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:00:34,014 INFO L93 Difference]: Finished difference Result 141 states and 148 transitions. [2018-04-11 18:00:34,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 18:00:34,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-11 18:00:34,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:00:34,023 INFO L225 Difference]: With dead ends: 141 [2018-04-11 18:00:34,023 INFO L226 Difference]: Without dead ends: 137 [2018-04-11 18:00:34,024 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 18:00:34,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-04-11 18:00:34,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 118. [2018-04-11 18:00:34,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-11 18:00:34,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2018-04-11 18:00:34,051 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 8 [2018-04-11 18:00:34,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:00:34,052 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2018-04-11 18:00:34,052 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 18:00:34,052 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2018-04-11 18:00:34,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-11 18:00:34,052 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:00:34,052 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 18:00:34,053 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 18:00:34,053 INFO L82 PathProgramCache]: Analyzing trace with hash -659694478, now seen corresponding path program 1 times [2018-04-11 18:00:34,053 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 18:00:34,053 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 18:00:34,054 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 18:00:34,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 18:00:34,055 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 18:00:34,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:00:34,066 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 18:00:34,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:00:34,099 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 18:00:34,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 18:00:34,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 18:00:34,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 18:00:34,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 18:00:34,100 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand 4 states. [2018-04-11 18:00:34,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:00:34,195 INFO L93 Difference]: Finished difference Result 135 states and 141 transitions. [2018-04-11 18:00:34,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 18:00:34,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-11 18:00:34,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:00:34,196 INFO L225 Difference]: With dead ends: 135 [2018-04-11 18:00:34,196 INFO L226 Difference]: Without dead ends: 135 [2018-04-11 18:00:34,196 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 18:00:34,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-04-11 18:00:34,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 123. [2018-04-11 18:00:34,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-11 18:00:34,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 130 transitions. [2018-04-11 18:00:34,201 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 130 transitions. Word has length 8 [2018-04-11 18:00:34,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:00:34,201 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 130 transitions. [2018-04-11 18:00:34,201 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 18:00:34,201 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 130 transitions. [2018-04-11 18:00:34,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-11 18:00:34,201 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:00:34,202 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 18:00:34,202 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 18:00:34,202 INFO L82 PathProgramCache]: Analyzing trace with hash -202425566, now seen corresponding path program 1 times [2018-04-11 18:00:34,202 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 18:00:34,202 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 18:00:34,203 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 18:00:34,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 18:00:34,203 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 18:00:34,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:00:34,213 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 18:00:34,218 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 18:00:34,219 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 18:00:34,219 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 18:00:34,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 18:00:34,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:00:34,252 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 18:00:34,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 18:00:34,276 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:34,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:34,278 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 18:00:34,303 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:34,304 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:34,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 18:00:34,305 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:34,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 18:00:34,335 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-11 18:00:34,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:00:34,353 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 18:00:34,353 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 18:00:34,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 18:00:34,353 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 18:00:34,353 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-11 18:00:34,354 INFO L87 Difference]: Start difference. First operand 123 states and 130 transitions. Second operand 6 states. [2018-04-11 18:00:34,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:00:34,535 INFO L93 Difference]: Finished difference Result 137 states and 145 transitions. [2018-04-11 18:00:34,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 18:00:34,536 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-04-11 18:00:34,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:00:34,536 INFO L225 Difference]: With dead ends: 137 [2018-04-11 18:00:34,536 INFO L226 Difference]: Without dead ends: 137 [2018-04-11 18:00:34,537 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-04-11 18:00:34,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-04-11 18:00:34,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 117. [2018-04-11 18:00:34,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-04-11 18:00:34,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2018-04-11 18:00:34,541 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 15 [2018-04-11 18:00:34,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:00:34,541 INFO L459 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2018-04-11 18:00:34,541 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 18:00:34,541 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2018-04-11 18:00:34,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-11 18:00:34,541 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:00:34,541 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 18:00:34,541 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 18:00:34,541 INFO L82 PathProgramCache]: Analyzing trace with hash -202425565, now seen corresponding path program 1 times [2018-04-11 18:00:34,542 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 18:00:34,542 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 18:00:34,543 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 18:00:34,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 18:00:34,543 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 18:00:34,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:00:34,550 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 18:00:34,554 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 18:00:34,554 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 18:00:34,554 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 18:00:34,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 18:00:34,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:00:34,579 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 18:00:34,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 18:00:34,583 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:34,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 18:00:34,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:34,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:34,593 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 18:00:34,635 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:34,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 18:00:34,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:34,647 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:34,648 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:34,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 18:00:34,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:34,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 18:00:34,660 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:21 [2018-04-11 18:00:34,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:00:34,671 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 18:00:34,671 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 18:00:34,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 18:00:34,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 18:00:34,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-11 18:00:34,672 INFO L87 Difference]: Start difference. First operand 117 states and 127 transitions. Second operand 7 states. [2018-04-11 18:00:34,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:00:34,926 INFO L93 Difference]: Finished difference Result 151 states and 162 transitions. [2018-04-11 18:00:34,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 18:00:34,926 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-04-11 18:00:34,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:00:34,927 INFO L225 Difference]: With dead ends: 151 [2018-04-11 18:00:34,927 INFO L226 Difference]: Without dead ends: 151 [2018-04-11 18:00:34,927 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-04-11 18:00:34,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-04-11 18:00:34,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 129. [2018-04-11 18:00:34,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-11 18:00:34,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 140 transitions. [2018-04-11 18:00:34,931 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 140 transitions. Word has length 15 [2018-04-11 18:00:34,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:00:34,931 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 140 transitions. [2018-04-11 18:00:34,931 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 18:00:34,931 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 140 transitions. [2018-04-11 18:00:34,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 18:00:34,931 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:00:34,932 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-11 18:00:34,932 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 18:00:34,932 INFO L82 PathProgramCache]: Analyzing trace with hash -325956996, now seen corresponding path program 1 times [2018-04-11 18:00:34,932 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 18:00:34,932 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 18:00:34,933 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 18:00:34,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 18:00:34,933 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 18:00:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:00:34,940 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 18:00:34,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:00:34,984 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 18:00:34,984 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 18:00:34,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 18:00:34,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 18:00:34,985 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 18:00:34,985 INFO L87 Difference]: Start difference. First operand 129 states and 140 transitions. Second operand 6 states. [2018-04-11 18:00:35,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:00:35,204 INFO L93 Difference]: Finished difference Result 216 states and 236 transitions. [2018-04-11 18:00:35,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 18:00:35,205 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-04-11 18:00:35,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:00:35,206 INFO L225 Difference]: With dead ends: 216 [2018-04-11 18:00:35,206 INFO L226 Difference]: Without dead ends: 216 [2018-04-11 18:00:35,206 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-04-11 18:00:35,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-04-11 18:00:35,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 124. [2018-04-11 18:00:35,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-04-11 18:00:35,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2018-04-11 18:00:35,213 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 18 [2018-04-11 18:00:35,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:00:35,214 INFO L459 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2018-04-11 18:00:35,214 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 18:00:35,214 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2018-04-11 18:00:35,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 18:00:35,214 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:00:35,215 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-11 18:00:35,215 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 18:00:35,215 INFO L82 PathProgramCache]: Analyzing trace with hash -325956997, now seen corresponding path program 1 times [2018-04-11 18:00:35,215 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 18:00:35,215 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 18:00:35,217 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 18:00:35,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 18:00:35,217 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 18:00:35,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:00:35,227 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 18:00:35,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:00:35,255 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 18:00:35,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 18:00:35,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 18:00:35,256 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 18:00:35,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 18:00:35,256 INFO L87 Difference]: Start difference. First operand 124 states and 135 transitions. Second operand 6 states. [2018-04-11 18:00:35,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:00:35,385 INFO L93 Difference]: Finished difference Result 211 states and 229 transitions. [2018-04-11 18:00:35,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 18:00:35,385 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-04-11 18:00:35,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:00:35,386 INFO L225 Difference]: With dead ends: 211 [2018-04-11 18:00:35,386 INFO L226 Difference]: Without dead ends: 211 [2018-04-11 18:00:35,386 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-04-11 18:00:35,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-04-11 18:00:35,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 123. [2018-04-11 18:00:35,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-11 18:00:35,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2018-04-11 18:00:35,391 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 134 transitions. Word has length 18 [2018-04-11 18:00:35,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:00:35,392 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 134 transitions. [2018-04-11 18:00:35,392 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 18:00:35,392 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2018-04-11 18:00:35,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 18:00:35,392 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:00:35,392 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 18:00:35,392 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 18:00:35,393 INFO L82 PathProgramCache]: Analyzing trace with hash -765015574, now seen corresponding path program 1 times [2018-04-11 18:00:35,393 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 18:00:35,393 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 18:00:35,393 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 18:00:35,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 18:00:35,394 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 18:00:35,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:00:35,405 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 18:00:35,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:00:35,439 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 18:00:35,439 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 18:00:35,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 18:00:35,440 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 18:00:35,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 18:00:35,440 INFO L87 Difference]: Start difference. First operand 123 states and 134 transitions. Second operand 6 states. [2018-04-11 18:00:35,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:00:35,621 INFO L93 Difference]: Finished difference Result 224 states and 244 transitions. [2018-04-11 18:00:35,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 18:00:35,621 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-04-11 18:00:35,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:00:35,622 INFO L225 Difference]: With dead ends: 224 [2018-04-11 18:00:35,622 INFO L226 Difference]: Without dead ends: 224 [2018-04-11 18:00:35,622 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-04-11 18:00:35,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-04-11 18:00:35,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 122. [2018-04-11 18:00:35,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-04-11 18:00:35,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 133 transitions. [2018-04-11 18:00:35,627 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 133 transitions. Word has length 26 [2018-04-11 18:00:35,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:00:35,627 INFO L459 AbstractCegarLoop]: Abstraction has 122 states and 133 transitions. [2018-04-11 18:00:35,627 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 18:00:35,627 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 133 transitions. [2018-04-11 18:00:35,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 18:00:35,628 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:00:35,628 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 18:00:35,628 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 18:00:35,628 INFO L82 PathProgramCache]: Analyzing trace with hash -765015573, now seen corresponding path program 1 times [2018-04-11 18:00:35,628 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 18:00:35,628 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 18:00:35,630 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 18:00:35,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 18:00:35,630 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 18:00:35,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:00:35,641 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 18:00:35,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:00:35,679 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 18:00:35,679 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 18:00:35,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 18:00:35,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 18:00:35,680 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 18:00:35,680 INFO L87 Difference]: Start difference. First operand 122 states and 133 transitions. Second operand 6 states. [2018-04-11 18:00:35,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:00:35,852 INFO L93 Difference]: Finished difference Result 217 states and 238 transitions. [2018-04-11 18:00:35,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 18:00:35,852 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-04-11 18:00:35,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:00:35,853 INFO L225 Difference]: With dead ends: 217 [2018-04-11 18:00:35,853 INFO L226 Difference]: Without dead ends: 217 [2018-04-11 18:00:35,853 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-04-11 18:00:35,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-04-11 18:00:35,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 112. [2018-04-11 18:00:35,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-04-11 18:00:35,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2018-04-11 18:00:35,856 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 26 [2018-04-11 18:00:35,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:00:35,856 INFO L459 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2018-04-11 18:00:35,856 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 18:00:35,856 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2018-04-11 18:00:35,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-11 18:00:35,857 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:00:35,857 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] [2018-04-11 18:00:35,857 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 18:00:35,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1849046283, now seen corresponding path program 1 times [2018-04-11 18:00:35,857 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 18:00:35,857 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 18:00:35,858 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 18:00:35,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 18:00:35,858 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 18:00:35,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:00:35,862 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 18:00:35,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:00:35,890 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 18:00:35,890 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 18:00:35,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 18:00:35,890 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 18:00:35,890 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 18:00:35,891 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand 5 states. [2018-04-11 18:00:36,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:00:36,011 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2018-04-11 18:00:36,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 18:00:36,011 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-04-11 18:00:36,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:00:36,012 INFO L225 Difference]: With dead ends: 131 [2018-04-11 18:00:36,012 INFO L226 Difference]: Without dead ends: 131 [2018-04-11 18:00:36,012 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 18:00:36,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-04-11 18:00:36,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 112. [2018-04-11 18:00:36,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-04-11 18:00:36,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2018-04-11 18:00:36,014 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 27 [2018-04-11 18:00:36,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:00:36,015 INFO L459 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2018-04-11 18:00:36,015 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 18:00:36,015 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2018-04-11 18:00:36,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 18:00:36,015 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:00:36,015 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 18:00:36,016 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 18:00:36,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1472510335, now seen corresponding path program 1 times [2018-04-11 18:00:36,016 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 18:00:36,016 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 18:00:36,017 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 18:00:36,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 18:00:36,017 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 18:00:36,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:00:36,025 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 18:00:36,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:00:36,105 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 18:00:36,105 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 18:00:36,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 18:00:36,106 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 18:00:36,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 18:00:36,106 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand 5 states. [2018-04-11 18:00:36,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:00:36,184 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2018-04-11 18:00:36,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 18:00:36,184 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-04-11 18:00:36,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:00:36,185 INFO L225 Difference]: With dead ends: 120 [2018-04-11 18:00:36,185 INFO L226 Difference]: Without dead ends: 120 [2018-04-11 18:00:36,186 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 18:00:36,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-04-11 18:00:36,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 111. [2018-04-11 18:00:36,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-04-11 18:00:36,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2018-04-11 18:00:36,188 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 28 [2018-04-11 18:00:36,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:00:36,188 INFO L459 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2018-04-11 18:00:36,188 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 18:00:36,189 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2018-04-11 18:00:36,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 18:00:36,189 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:00:36,189 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] [2018-04-11 18:00:36,189 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 18:00:36,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1101576030, now seen corresponding path program 1 times [2018-04-11 18:00:36,190 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 18:00:36,190 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 18:00:36,191 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 18:00:36,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 18:00:36,191 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 18:00:36,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:00:36,198 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 18:00:36,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:00:36,253 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 18:00:36,253 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 18:00:36,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 18:00:36,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 18:00:36,254 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 18:00:36,254 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand 5 states. [2018-04-11 18:00:36,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:00:36,402 INFO L93 Difference]: Finished difference Result 131 states and 138 transitions. [2018-04-11 18:00:36,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 18:00:36,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-04-11 18:00:36,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:00:36,403 INFO L225 Difference]: With dead ends: 131 [2018-04-11 18:00:36,403 INFO L226 Difference]: Without dead ends: 116 [2018-04-11 18:00:36,404 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 18:00:36,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-04-11 18:00:36,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2018-04-11 18:00:36,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-04-11 18:00:36,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 121 transitions. [2018-04-11 18:00:36,408 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 121 transitions. Word has length 34 [2018-04-11 18:00:36,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:00:36,408 INFO L459 AbstractCegarLoop]: Abstraction has 114 states and 121 transitions. [2018-04-11 18:00:36,408 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 18:00:36,408 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2018-04-11 18:00:36,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-11 18:00:36,409 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:00:36,409 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] [2018-04-11 18:00:36,409 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 18:00:36,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1478738935, now seen corresponding path program 1 times [2018-04-11 18:00:36,409 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 18:00:36,409 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 18:00:36,410 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 18:00:36,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 18:00:36,412 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 18:00:36,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:00:36,423 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 18:00:36,429 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 18:00:36,429 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 18:00:36,429 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 18:00:36,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 18:00:36,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:00:36,464 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 18:00:36,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 18:00:36,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:36,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:36,471 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 18:00:36,496 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:36,497 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:36,498 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-11 18:00:36,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:36,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:36,507 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-11 18:00:36,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 18:00:36,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 18:00:36,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:36,529 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:36,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:36,539 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:35 [2018-04-11 18:00:36,591 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 33 [2018-04-11 18:00:36,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 18:00:36,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:36,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:36,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 18:00:36,603 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:43 [2018-04-11 18:00:36,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-04-11 18:00:36,686 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 18:00:36,687 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 13 [2018-04-11 18:00:36,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:36,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 18:00:36,692 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:36,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:36,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 18:00:36,700 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:53, output treesize:15 [2018-04-11 18:00:36,729 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:00:36,729 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 18:00:36,729 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-11 18:00:36,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 18:00:36,730 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 18:00:36,730 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-04-11 18:00:36,730 INFO L87 Difference]: Start difference. First operand 114 states and 121 transitions. Second operand 14 states. [2018-04-11 18:00:37,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:00:37,293 INFO L93 Difference]: Finished difference Result 208 states and 222 transitions. [2018-04-11 18:00:37,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 18:00:37,294 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 45 [2018-04-11 18:00:37,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:00:37,295 INFO L225 Difference]: With dead ends: 208 [2018-04-11 18:00:37,295 INFO L226 Difference]: Without dead ends: 208 [2018-04-11 18:00:37,295 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=456, Unknown=0, NotChecked=0, Total=600 [2018-04-11 18:00:37,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-04-11 18:00:37,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 146. [2018-04-11 18:00:37,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-04-11 18:00:37,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 157 transitions. [2018-04-11 18:00:37,299 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 157 transitions. Word has length 45 [2018-04-11 18:00:37,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:00:37,299 INFO L459 AbstractCegarLoop]: Abstraction has 146 states and 157 transitions. [2018-04-11 18:00:37,299 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 18:00:37,299 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 157 transitions. [2018-04-11 18:00:37,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-11 18:00:37,300 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:00:37,300 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] [2018-04-11 18:00:37,300 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 18:00:37,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1478738936, now seen corresponding path program 1 times [2018-04-11 18:00:37,300 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 18:00:37,301 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 18:00:37,302 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 18:00:37,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 18:00:37,302 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 18:00:37,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:00:37,312 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 18:00:37,319 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 18:00:37,319 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 18:00:37,319 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 18:00:37,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 18:00:37,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:00:37,349 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 18:00:37,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 18:00:37,388 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:37,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:37,393 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-04-11 18:00:37,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 18:00:37,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 18:00:37,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:37,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:37,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 18:00:37,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 18:00:37,421 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:37,422 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:37,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:37,461 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2018-04-11 18:00:37,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 36 [2018-04-11 18:00:37,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-04-11 18:00:37,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:37,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:37,599 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 21 treesize of output 33 [2018-04-11 18:00:37,605 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 18:00:37,606 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 0 case distinctions, treesize of input 19 treesize of output 19 [2018-04-11 18:00:37,607 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 18:00:37,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 18 treesize of output 17 [2018-04-11 18:00:37,628 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:37,646 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 18:00:37,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-04-11 18:00:37,661 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:58, output treesize:97 [2018-04-11 18:00:37,859 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 63 treesize of output 59 [2018-04-11 18:00:37,863 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 18:00:37,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 18:00:37,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:37,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:37,920 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 67 treesize of output 69 [2018-04-11 18:00:37,923 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 18:00:37,923 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 65 treesize of output 61 [2018-04-11 18:00:37,924 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:37,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 53 [2018-04-11 18:00:37,956 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:37,988 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 18:00:37,990 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 18:00:37,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 61 [2018-04-11 18:00:37,991 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:38,017 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 18:00:38,063 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 49 treesize of output 49 [2018-04-11 18:00:38,065 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 18:00:38,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-04-11 18:00:38,066 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:38,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 28 [2018-04-11 18:00:38,089 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:38,112 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 18:00:38,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-04-11 18:00:38,112 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:38,125 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:38,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2018-04-11 18:00:38,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 18:00:38,129 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:38,137 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 18:00:38,137 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 16 treesize of output 10 [2018-04-11 18:00:38,138 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:38,147 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:38,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2018-04-11 18:00:38,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-04-11 18:00:38,186 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:38,196 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:38,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-04-11 18:00:38,220 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 14 variables, input treesize:131, output treesize:43 [2018-04-11 18:00:38,307 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:00:38,308 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 18:00:38,308 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-11 18:00:38,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 18:00:38,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 18:00:38,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=170, Unknown=3, NotChecked=0, Total=210 [2018-04-11 18:00:38,309 INFO L87 Difference]: Start difference. First operand 146 states and 157 transitions. Second operand 15 states. [2018-04-11 18:00:39,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:00:39,504 INFO L93 Difference]: Finished difference Result 204 states and 219 transitions. [2018-04-11 18:00:39,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 18:00:39,505 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2018-04-11 18:00:39,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:00:39,505 INFO L225 Difference]: With dead ends: 204 [2018-04-11 18:00:39,505 INFO L226 Difference]: Without dead ends: 204 [2018-04-11 18:00:39,506 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=142, Invalid=540, Unknown=20, NotChecked=0, Total=702 [2018-04-11 18:00:39,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-04-11 18:00:39,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 148. [2018-04-11 18:00:39,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-04-11 18:00:39,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 159 transitions. [2018-04-11 18:00:39,508 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 159 transitions. Word has length 45 [2018-04-11 18:00:39,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:00:39,508 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 159 transitions. [2018-04-11 18:00:39,508 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 18:00:39,508 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 159 transitions. [2018-04-11 18:00:39,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 18:00:39,509 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:00:39,509 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 18:00:39,509 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 18:00:39,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1481333305, now seen corresponding path program 1 times [2018-04-11 18:00:39,509 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 18:00:39,509 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 18:00:39,510 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 18:00:39,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 18:00:39,511 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 18:00:39,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:00:39,522 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 18:00:39,548 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 18:00:39,548 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 18:00:39,548 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 18:00:39,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 18:00:39,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:00:39,589 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 18:00:39,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 18:00:39,598 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:39,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:39,599 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 18:00:39,607 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:39,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-11 18:00:39,609 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:39,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:39,613 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:14 [2018-04-11 18:00:39,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 18:00:39,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 18:00:39,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:39,633 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:39,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:39,639 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-04-11 18:00:39,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 18:00:39,660 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:39,672 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:39,673 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:39,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 30 [2018-04-11 18:00:39,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:39,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:39,686 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:42 [2018-04-11 18:00:39,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 18:00:39,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 18:00:39,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:39,710 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:39,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 18:00:39,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 18:00:39,726 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:39,727 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:39,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:39,739 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:67, output treesize:57 [2018-04-11 18:00:39,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 15 treesize of output 11 [2018-04-11 18:00:39,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 18:00:39,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:39,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:39,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 18:00:39,779 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:68, output treesize:57 [2018-04-11 18:00:39,814 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:39,820 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 37 treesize of output 52 [2018-04-11 18:00:39,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2018-04-11 18:00:39,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:39,841 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 18:00:39,842 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:39,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-04-11 18:00:39,843 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:39,852 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 18:00:39,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 18:00:39,869 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:71, output treesize:118 [2018-04-11 18:00:39,913 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:39,915 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 85 treesize of output 86 [2018-04-11 18:00:39,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 18:00:39,917 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:39,929 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:39,958 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 18:00:39,959 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 60 treesize of output 62 [2018-04-11 18:00:39,960 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 18:00:39,961 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 17 [2018-04-11 18:00:39,961 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:39,980 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:40,002 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-11 18:00:40,003 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:146, output treesize:119 [2018-04-11 18:00:40,195 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 55 treesize of output 53 [2018-04-11 18:00:40,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 18:00:40,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:40,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:40,251 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:40,252 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:40,253 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 86 treesize of output 87 [2018-04-11 18:00:40,259 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 18:00:40,265 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 41 [2018-04-11 18:00:40,266 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 18:00:40,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 5 treesize of output 1 [2018-04-11 18:00:40,292 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:40,303 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:40,328 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 48 treesize of output 44 [2018-04-11 18:00:40,356 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 18:00:40,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 18:00:40,357 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:40,368 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:40,395 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 57 treesize of output 55 [2018-04-11 18:00:40,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 18:00:40,398 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:40,407 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:40,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-11 18:00:40,427 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 10 variables, input treesize:142, output treesize:82 [2018-04-11 18:00:40,543 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-11 18:00:40,543 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:40,579 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:40,580 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:40,581 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:40,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 18:00:40,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:40,592 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 13 treesize of output 3 [2018-04-11 18:00:40,593 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:40,611 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 26 treesize of output 24 [2018-04-11 18:00:40,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 18:00:40,613 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:40,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 18:00:40,620 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-11 18:00:40,622 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 18:00:40,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-1 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 18:00:40,631 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 11 variables, input treesize:121, output treesize:21 [2018-04-11 18:00:40,696 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:00:40,696 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 18:00:40,697 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 18:00:40,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 18:00:40,697 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 18:00:40,697 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2018-04-11 18:00:40,697 INFO L87 Difference]: Start difference. First operand 148 states and 159 transitions. Second operand 19 states. [2018-04-11 18:00:42,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:00:42,621 INFO L93 Difference]: Finished difference Result 267 states and 287 transitions. [2018-04-11 18:00:42,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 18:00:42,621 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-04-11 18:00:42,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:00:42,623 INFO L225 Difference]: With dead ends: 267 [2018-04-11 18:00:42,623 INFO L226 Difference]: Without dead ends: 266 [2018-04-11 18:00:42,624 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=277, Invalid=1055, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 18:00:42,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-04-11 18:00:42,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 145. [2018-04-11 18:00:42,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-04-11 18:00:42,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 155 transitions. [2018-04-11 18:00:42,627 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 155 transitions. Word has length 49 [2018-04-11 18:00:42,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:00:42,627 INFO L459 AbstractCegarLoop]: Abstraction has 145 states and 155 transitions. [2018-04-11 18:00:42,627 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 18:00:42,627 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 155 transitions. [2018-04-11 18:00:42,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-11 18:00:42,628 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:00:42,628 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] [2018-04-11 18:00:42,628 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 18:00:42,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1731438270, now seen corresponding path program 1 times [2018-04-11 18:00:42,628 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 18:00:42,628 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 18:00:42,629 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 18:00:42,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 18:00:42,629 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 18:00:42,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:00:42,637 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 18:00:42,641 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 18:00:42,641 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 18:00:42,642 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 18:00:42,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 18:00:42,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:00:42,666 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 18:00:42,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 18:00:42,669 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:42,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:42,672 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 18:00:42,688 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:42,688 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:42,689 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-11 18:00:42,689 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:42,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:42,693 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-11 18:00:42,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 18:00:42,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 18:00:42,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:42,704 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:42,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:42,729 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:26 [2018-04-11 18:00:42,777 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:42,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-04-11 18:00:42,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 8 treesize of output 7 [2018-04-11 18:00:42,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:42,789 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:42,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 18:00:42,800 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:38 [2018-04-11 18:00:42,824 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:42,825 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:42,826 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:42,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2018-04-11 18:00:42,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:42,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 18:00:42,838 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:36 [2018-04-11 18:00:42,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-04-11 18:00:42,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-04-11 18:00:42,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:42,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:42,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 18:00:42,881 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:42 [2018-04-11 18:00:42,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 60 [2018-04-11 18:00:42,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 18:00:42,953 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:42,960 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:42,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 18:00:42,972 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:82, output treesize:70 [2018-04-11 18:00:43,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 48 [2018-04-11 18:00:43,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 18:00:43,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:43,095 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 18:00:43,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2018-04-11 18:00:43,096 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:43,103 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 13 treesize of output 9 [2018-04-11 18:00:43,103 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:43,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:43,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:43,113 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:80, output treesize:5 [2018-04-11 18:00:43,164 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:00:43,164 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 18:00:43,164 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 18:00:43,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 18:00:43,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 18:00:43,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-04-11 18:00:43,165 INFO L87 Difference]: Start difference. First operand 145 states and 155 transitions. Second operand 19 states. [2018-04-11 18:00:44,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:00:44,478 INFO L93 Difference]: Finished difference Result 250 states and 265 transitions. [2018-04-11 18:00:44,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 18:00:44,478 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 51 [2018-04-11 18:00:44,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:00:44,479 INFO L225 Difference]: With dead ends: 250 [2018-04-11 18:00:44,479 INFO L226 Difference]: Without dead ends: 250 [2018-04-11 18:00:44,479 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=261, Invalid=1299, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 18:00:44,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-04-11 18:00:44,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 176. [2018-04-11 18:00:44,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-04-11 18:00:44,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 189 transitions. [2018-04-11 18:00:44,482 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 189 transitions. Word has length 51 [2018-04-11 18:00:44,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:00:44,482 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 189 transitions. [2018-04-11 18:00:44,482 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 18:00:44,482 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 189 transitions. [2018-04-11 18:00:44,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-11 18:00:44,482 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:00:44,482 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] [2018-04-11 18:00:44,482 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 18:00:44,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1731438271, now seen corresponding path program 1 times [2018-04-11 18:00:44,483 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 18:00:44,483 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 18:00:44,483 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 18:00:44,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 18:00:44,484 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 18:00:44,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:00:44,491 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 18:00:44,494 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 18:00:44,494 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 18:00:44,494 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 18:00:44,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 18:00:44,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:00:44,520 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 18:00:44,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 18:00:44,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:44,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:44,531 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 18:00:44,557 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:44,558 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:44,559 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-11 18:00:44,560 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:44,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 6 treesize of output 5 [2018-04-11 18:00:44,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:44,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:44,579 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-04-11 18:00:44,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 18:00:44,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 18:00:44,600 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:44,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:44,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 18:00:44,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 18:00:44,641 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:44,644 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:44,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:44,657 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:49, output treesize:42 [2018-04-11 18:00:44,707 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:44,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-04-11 18:00:44,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 18:00:44,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:44,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:44,732 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:44,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-04-11 18:00:44,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 18:00:44,737 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:44,740 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:44,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 18:00:44,753 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:73, output treesize:69 [2018-04-11 18:00:44,787 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:44,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 18:00:44,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:44,813 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:44,813 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:44,814 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:44,815 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:44,815 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-11 18:00:44,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:44,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 18:00:44,839 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:86, output treesize:91 [2018-04-11 18:00:44,883 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:44,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 62 [2018-04-11 18:00:44,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-04-11 18:00:44,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:44,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:44,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 40 [2018-04-11 18:00:44,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-04-11 18:00:44,934 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:44,939 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:44,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 18:00:44,958 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:118, output treesize:85 [2018-04-11 18:00:45,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 106 [2018-04-11 18:00:45,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 18:00:45,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:45,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:45,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-04-11 18:00:45,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 18:00:45,131 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:45,139 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:45,163 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-11 18:00:45,163 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:156, output treesize:132 [2018-04-11 18:00:45,260 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 28 treesize of output 37 [2018-04-11 18:00:45,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:45,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 18:00:45,272 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:132, output treesize:105 [2018-04-11 18:00:45,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 64 [2018-04-11 18:00:45,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-04-11 18:00:45,360 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 18:00:45,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 18:00:45,376 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:45,388 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 18:00:45,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-04-11 18:00:45,389 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:45,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 18:00:45,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-04-11 18:00:45,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 18:00:45,414 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:45,418 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 18:00:45,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 18:00:45,419 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:45,421 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:45,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 18:00:45,439 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:122, output treesize:18 [2018-04-11 18:00:45,483 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:00:45,483 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 18:00:45,483 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 18:00:45,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 18:00:45,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 18:00:45,484 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=320, Unknown=6, NotChecked=0, Total=380 [2018-04-11 18:00:45,484 INFO L87 Difference]: Start difference. First operand 176 states and 189 transitions. Second operand 20 states. [2018-04-11 18:00:46,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:00:46,702 INFO L93 Difference]: Finished difference Result 278 states and 300 transitions. [2018-04-11 18:00:46,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 18:00:46,702 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 51 [2018-04-11 18:00:46,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:00:46,703 INFO L225 Difference]: With dead ends: 278 [2018-04-11 18:00:46,703 INFO L226 Difference]: Without dead ends: 278 [2018-04-11 18:00:46,704 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=205, Invalid=1115, Unknown=12, NotChecked=0, Total=1332 [2018-04-11 18:00:46,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-04-11 18:00:46,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 178. [2018-04-11 18:00:46,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-04-11 18:00:46,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 191 transitions. [2018-04-11 18:00:46,706 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 191 transitions. Word has length 51 [2018-04-11 18:00:46,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:00:46,706 INFO L459 AbstractCegarLoop]: Abstraction has 178 states and 191 transitions. [2018-04-11 18:00:46,706 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 18:00:46,706 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 191 transitions. [2018-04-11 18:00:46,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 18:00:46,706 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:00:46,707 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 18:00:46,707 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 18:00:46,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1776041815, now seen corresponding path program 1 times [2018-04-11 18:00:46,707 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 18:00:46,707 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 18:00:46,708 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 18:00:46,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 18:00:46,708 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 18:00:46,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:00:46,712 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 18:00:46,749 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 18:00:46,749 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 18:00:46,749 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 18:00:46,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 18:00:46,750 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 18:00:46,750 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 18:00:46,750 INFO L87 Difference]: Start difference. First operand 178 states and 191 transitions. Second operand 6 states. [2018-04-11 18:00:46,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:00:46,818 INFO L93 Difference]: Finished difference Result 142 states and 149 transitions. [2018-04-11 18:00:46,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 18:00:46,818 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-04-11 18:00:46,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:00:46,818 INFO L225 Difference]: With dead ends: 142 [2018-04-11 18:00:46,818 INFO L226 Difference]: Without dead ends: 142 [2018-04-11 18:00:46,819 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-04-11 18:00:46,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-04-11 18:00:46,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 134. [2018-04-11 18:00:46,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-11 18:00:46,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 142 transitions. [2018-04-11 18:00:46,821 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 142 transitions. Word has length 54 [2018-04-11 18:00:46,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:00:46,822 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 142 transitions. [2018-04-11 18:00:46,822 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 18:00:46,822 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 142 transitions. [2018-04-11 18:00:46,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-11 18:00:46,822 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:00:46,822 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 18:00:46,822 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 18:00:46,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1044886106, now seen corresponding path program 2 times [2018-04-11 18:00:46,823 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 18:00:46,823 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 18:00:46,824 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 18:00:46,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 18:00:46,824 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 18:00:46,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:00:46,832 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 18:00:46,844 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 18:00:46,844 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 18:00:46,844 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 18:00:46,845 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 18:00:46,869 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 18:00:46,869 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 18:00:46,873 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 18:00:46,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 18:00:46,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:46,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:46,880 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 18:00:46,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 18:00:46,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:46,902 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:46,902 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:46,903 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-11 18:00:46,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:46,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:46,908 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-11 18:00:46,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 18:00:46,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 18:00:46,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:46,921 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:46,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:46,928 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:30 [2018-04-11 18:00:46,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-11 18:00:46,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 18:00:46,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:46,966 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:46,979 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:46,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2018-04-11 18:00:46,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 18:00:46,983 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:46,990 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:47,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 18:00:47,000 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:59, output treesize:55 [2018-04-11 18:00:47,107 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 18:00:47,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 14 [2018-04-11 18:00:47,108 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:47,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 18:00:47,115 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:74, output treesize:53 [2018-04-11 18:00:47,146 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:47,147 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 18:00:47,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 53 [2018-04-11 18:00:47,150 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 18:00:47,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 18:00:47,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:47,155 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 18:00:47,155 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 25 treesize of output 22 [2018-04-11 18:00:47,156 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 18:00:47,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 18:00:47,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 18:00:47,173 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 18:00:47,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 18:00:47,174 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:47,175 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:47,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:47,182 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:71, output treesize:7 [2018-04-11 18:00:47,204 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:00:47,204 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 18:00:47,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 18:00:47,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 18:00:47,204 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 18:00:47,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2018-04-11 18:00:47,204 INFO L87 Difference]: Start difference. First operand 134 states and 142 transitions. Second operand 16 states. [2018-04-11 18:00:47,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:00:47,860 INFO L93 Difference]: Finished difference Result 151 states and 158 transitions. [2018-04-11 18:00:47,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 18:00:47,860 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 55 [2018-04-11 18:00:47,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:00:47,861 INFO L225 Difference]: With dead ends: 151 [2018-04-11 18:00:47,861 INFO L226 Difference]: Without dead ends: 126 [2018-04-11 18:00:47,861 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2018-04-11 18:00:47,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-04-11 18:00:47,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 116. [2018-04-11 18:00:47,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-04-11 18:00:47,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2018-04-11 18:00:47,863 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 55 [2018-04-11 18:00:47,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:00:47,863 INFO L459 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2018-04-11 18:00:47,863 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 18:00:47,863 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2018-04-11 18:00:47,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-11 18:00:47,864 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:00:47,864 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 18:00:47,864 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 18:00:47,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1014070912, now seen corresponding path program 1 times [2018-04-11 18:00:47,864 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 18:00:47,864 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 18:00:47,865 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 18:00:47,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 18:00:47,865 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 18:00:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:00:47,875 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 18:00:47,878 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 18:00:47,878 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 18:00:47,878 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 18:00:47,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 18:00:47,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:00:47,915 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 18:00:47,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 18:00:47,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:47,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:47,927 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 18:00:47,946 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:47,947 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:47,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-11 18:00:47,947 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:47,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:47,954 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-11 18:00:47,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 18:00:47,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 18:00:47,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:47,972 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:47,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 18:00:47,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 18:00:47,986 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:47,988 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:47,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:47,997 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:49, output treesize:42 [2018-04-11 18:00:48,045 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:48,049 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 26 treesize of output 31 [2018-04-11 18:00:48,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 18:00:48,051 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:48,056 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:48,073 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:48,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2018-04-11 18:00:48,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 18:00:48,085 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:48,090 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:48,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 18:00:48,102 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:83, output treesize:74 [2018-04-11 18:00:48,120 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:48,121 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:48,121 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:48,122 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-11 18:00:48,122 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:48,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 18:00:48,141 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:85, output treesize:91 [2018-04-11 18:00:48,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 47 [2018-04-11 18:00:48,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-04-11 18:00:48,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:48,174 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:48,194 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:48,196 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:48,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 61 [2018-04-11 18:00:48,199 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 23 treesize of output 16 [2018-04-11 18:00:48,199 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:48,205 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:48,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 18:00:48,220 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:118, output treesize:73 [2018-04-11 18:00:48,283 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:48,285 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:48,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 96 [2018-04-11 18:00:48,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 18:00:48,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:48,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:48,314 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 42 treesize of output 43 [2018-04-11 18:00:48,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 18:00:48,315 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:48,319 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:48,332 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-11 18:00:48,332 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:136, output treesize:112 [2018-04-11 18:00:48,411 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 37 treesize of output 33 [2018-04-11 18:00:48,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 18:00:48,413 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:48,428 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 18:00:48,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-04-11 18:00:48,429 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:48,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:48,444 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-11 18:00:48,444 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:129, output treesize:99 [2018-04-11 18:00:48,489 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:48,490 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:48,490 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 18:00:48,491 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:48,496 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 77 treesize of output 74 [2018-04-11 18:00:48,498 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 18:00:48,503 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 39 [2018-04-11 18:00:48,504 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 18:00:48,516 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 18:00:48,517 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 29 treesize of output 26 [2018-04-11 18:00:48,517 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 18:00:48,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 18:00:48,523 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:48,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 18:00:48,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 18:00:48,536 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:100, output treesize:28 [2018-04-11 18:00:48,599 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:00:48,599 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 18:00:48,599 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-11 18:00:48,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 18:00:48,599 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 18:00:48,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=345, Unknown=12, NotChecked=0, Total=420 [2018-04-11 18:00:48,599 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand 21 states. [2018-04-11 18:00:49,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:00:49,813 INFO L93 Difference]: Finished difference Result 159 states and 167 transitions. [2018-04-11 18:00:49,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 18:00:49,813 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 55 [2018-04-11 18:00:49,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:00:49,814 INFO L225 Difference]: With dead ends: 159 [2018-04-11 18:00:49,814 INFO L226 Difference]: Without dead ends: 159 [2018-04-11 18:00:49,814 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=255, Invalid=1344, Unknown=41, NotChecked=0, Total=1640 [2018-04-11 18:00:49,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-04-11 18:00:49,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 118. [2018-04-11 18:00:49,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-11 18:00:49,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2018-04-11 18:00:49,816 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 55 [2018-04-11 18:00:49,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:00:49,817 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2018-04-11 18:00:49,817 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 18:00:49,817 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2018-04-11 18:00:49,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-11 18:00:49,817 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:00:49,817 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 18:00:49,817 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 18:00:49,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1014070911, now seen corresponding path program 1 times [2018-04-11 18:00:49,817 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 18:00:49,817 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 18:00:49,818 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 18:00:49,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 18:00:49,818 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 18:00:49,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:00:49,831 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 18:00:49,839 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 18:00:49,839 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 18:00:49,839 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 18:00:49,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 18:00:49,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:00:49,882 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 18:00:49,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 18:00:49,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:49,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:49,891 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 18:00:49,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 18:00:49,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 18:00:49,902 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:49,921 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:49,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:49,927 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-04-11 18:00:49,953 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:49,953 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:49,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 18:00:49,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:49,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 18:00:49,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:49,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:49,981 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:42 [2018-04-11 18:00:50,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 18:00:50,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 18:00:50,004 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:50,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:50,022 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 18:00:50,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-04-11 18:00:50,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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 11 [2018-04-11 18:00:50,024 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:50,027 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:50,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:50,040 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:61, output treesize:51 [2018-04-11 18:00:50,105 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:50,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 46 [2018-04-11 18:00:50,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 18:00:50,110 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:50,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:50,136 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:50,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-04-11 18:00:50,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 18:00:50,141 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:50,145 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:50,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:50,169 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:82, output treesize:69 [2018-04-11 18:00:50,237 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:50,237 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:50,238 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:50,239 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:50,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 42 [2018-04-11 18:00:50,240 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:50,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-04-11 18:00:50,274 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:50,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:50,301 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:96, output treesize:105 [2018-04-11 18:00:50,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-04-11 18:00:50,356 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:50,387 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:50,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 65 [2018-04-11 18:00:50,391 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 23 treesize of output 16 [2018-04-11 18:00:50,392 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:50,402 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:50,432 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:50,433 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 18:00:50,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2018-04-11 18:00:50,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-04-11 18:00:50,438 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:50,443 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:50,459 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-11 18:00:50,459 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:129, output treesize:80 [2018-04-11 18:00:50,550 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:50,554 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:50,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 118 [2018-04-11 18:00:50,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 18:00:50,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:50,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:50,591 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:50,595 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 46 treesize of output 71 [2018-04-11 18:00:50,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 18:00:50,597 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:50,602 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:50,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 18:00:50,614 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:143, output treesize:119 [2018-04-11 18:00:50,776 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:50,776 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 18:00:50,777 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:50,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 102 [2018-04-11 18:00:50,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 18:00:50,784 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:50,804 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 18:00:50,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 40 [2018-04-11 18:00:50,805 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 18:00:50,819 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 18:00:50,820 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 34 treesize of output 24 [2018-04-11 18:00:50,820 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:50,829 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 18:00:50,851 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 36 treesize of output 38 [2018-04-11 18:00:50,852 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 18:00:50,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 18:00:50,853 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:50,859 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 18:00:50,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 18:00:50,859 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:50,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 18:00:50,863 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:50,866 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:50,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 18:00:50,877 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:157, output treesize:23 [2018-04-11 18:00:50,937 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:00:50,937 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 18:00:50,937 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 18:00:50,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 18:00:50,937 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 18:00:50,938 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=430, Unknown=5, NotChecked=0, Total=506 [2018-04-11 18:00:50,938 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand 23 states. [2018-04-11 18:00:52,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:00:52,337 INFO L93 Difference]: Finished difference Result 211 states and 224 transitions. [2018-04-11 18:00:52,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 18:00:52,363 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 55 [2018-04-11 18:00:52,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:00:52,364 INFO L225 Difference]: With dead ends: 211 [2018-04-11 18:00:52,364 INFO L226 Difference]: Without dead ends: 211 [2018-04-11 18:00:52,364 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=326, Invalid=1730, Unknown=14, NotChecked=0, Total=2070 [2018-04-11 18:00:52,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-04-11 18:00:52,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 118. [2018-04-11 18:00:52,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-11 18:00:52,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2018-04-11 18:00:52,366 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 55 [2018-04-11 18:00:52,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:00:52,366 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2018-04-11 18:00:52,366 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 18:00:52,366 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2018-04-11 18:00:52,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-11 18:00:52,366 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:00:52,366 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 18:00:52,366 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 18:00:52,366 INFO L82 PathProgramCache]: Analyzing trace with hash -817344126, now seen corresponding path program 3 times [2018-04-11 18:00:52,366 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 18:00:52,367 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 18:00:52,367 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 18:00:52,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 18:00:52,367 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 18:00:52,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:00:52,373 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 18:00:52,376 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 18:00:52,377 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 18:00:52,377 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 18:00:52,377 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 18:00:52,393 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-11 18:00:52,393 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 18:00:52,395 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 18:00:52,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 18:00:52,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:52,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:52,410 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 18:00:52,426 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:52,426 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:52,427 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-11 18:00:52,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:52,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:52,433 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-11 18:00:52,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 18:00:52,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 18:00:52,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:52,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:52,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:52,455 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:35 [2018-04-11 18:00:52,513 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:52,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-04-11 18:00:52,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 18:00:52,519 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:52,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:52,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 18:00:52,538 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:46 [2018-04-11 18:00:52,556 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:52,557 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:52,557 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:52,558 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 50 [2018-04-11 18:00:52,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:52,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 18:00:52,571 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:57, output treesize:63 [2018-04-11 18:00:52,589 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:52,592 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 51 treesize of output 50 [2018-04-11 18:00:52,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-04-11 18:00:52,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:52,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:52,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 18:00:52,622 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:74, output treesize:68 [2018-04-11 18:00:52,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 69 [2018-04-11 18:00:52,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 18:00:52,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:52,713 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:52,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 18:00:52,729 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:100, output treesize:88 [2018-04-11 18:00:52,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 55 [2018-04-11 18:00:52,808 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 18:00:52,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2018-04-11 18:00:52,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:52,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 18:00:52,818 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:52,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2018-04-11 18:00:52,824 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 18:00:52,829 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 18:00:52,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 18:00:52,837 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:92, output treesize:28 [2018-04-11 18:00:52,895 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-11 18:00:52,895 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 18:00:52,895 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-11 18:00:52,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 18:00:52,895 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 18:00:52,895 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2018-04-11 18:00:52,895 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand 18 states. [2018-04-11 18:00:53,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:00:53,646 INFO L93 Difference]: Finished difference Result 191 states and 201 transitions. [2018-04-11 18:00:53,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 18:00:53,647 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2018-04-11 18:00:53,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:00:53,647 INFO L225 Difference]: With dead ends: 191 [2018-04-11 18:00:53,647 INFO L226 Difference]: Without dead ends: 191 [2018-04-11 18:00:53,648 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=222, Invalid=1038, Unknown=0, NotChecked=0, Total=1260 [2018-04-11 18:00:53,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-04-11 18:00:53,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 150. [2018-04-11 18:00:53,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-04-11 18:00:53,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 160 transitions. [2018-04-11 18:00:53,649 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 160 transitions. Word has length 56 [2018-04-11 18:00:53,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:00:53,649 INFO L459 AbstractCegarLoop]: Abstraction has 150 states and 160 transitions. [2018-04-11 18:00:53,650 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 18:00:53,650 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 160 transitions. [2018-04-11 18:00:53,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-11 18:00:53,650 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:00:53,650 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 18:00:53,650 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 18:00:53,650 INFO L82 PathProgramCache]: Analyzing trace with hash -817344125, now seen corresponding path program 2 times [2018-04-11 18:00:53,650 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 18:00:53,650 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 18:00:53,651 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 18:00:53,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 18:00:53,651 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 18:00:53,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:00:53,658 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 18:00:53,663 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 18:00:53,663 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 18:00:53,663 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 18:00:53,664 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 18:00:53,689 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 18:00:53,689 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 18:00:53,691 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 18:00:53,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 6 treesize of output 5 [2018-04-11 18:00:53,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:53,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:53,695 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 18:00:53,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 18:00:53,708 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:53,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 18:00:53,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:53,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:53,745 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:28 [2018-04-11 18:00:53,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 18:00:53,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 18:00:53,765 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:53,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:53,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 18:00:53,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 8 treesize of output 7 [2018-04-11 18:00:53,784 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:53,785 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:53,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:53,794 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:43 [2018-04-11 18:00:53,855 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 26 treesize of output 36 [2018-04-11 18:00:53,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-04-11 18:00:53,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:53,878 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:53,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 40 [2018-04-11 18:00:53,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2018-04-11 18:00:53,907 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:53,922 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 18:00:53,923 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 0 case distinctions, treesize of input 26 treesize of output 24 [2018-04-11 18:00:53,924 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 18:00:53,934 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 18:00:53,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 18:00:53,965 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:72, output treesize:124 [2018-04-11 18:00:54,045 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:54,046 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:54,047 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:54,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 66 [2018-04-11 18:00:54,048 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:54,083 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:54,083 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 78 treesize of output 85 [2018-04-11 18:00:54,084 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:54,115 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 59 treesize of output 58 [2018-04-11 18:00:54,116 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:54,146 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:54,146 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:54,147 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:54,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 77 [2018-04-11 18:00:54,148 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:54,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 18:00:54,176 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:145, output treesize:129 [2018-04-11 18:00:54,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 75 [2018-04-11 18:00:54,218 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 18:00:54,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-11 18:00:54,219 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:54,233 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:54,278 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:54,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 107 [2018-04-11 18:00:54,287 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 18:00:54,287 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 92 treesize of output 79 [2018-04-11 18:00:54,287 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:54,361 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 87 treesize of output 81 [2018-04-11 18:00:54,361 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:54,409 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 18:00:54,470 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 69 treesize of output 62 [2018-04-11 18:00:54,471 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 18:00:54,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-04-11 18:00:54,472 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:54,483 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:54,545 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:54,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 80 [2018-04-11 18:00:54,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 0 case distinctions, treesize of input 14 treesize of output 7 [2018-04-11 18:00:54,550 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:54,562 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:54,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 57 [2018-04-11 18:00:54,567 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 14 treesize of output 11 [2018-04-11 18:00:54,567 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:54,577 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:54,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 4 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-04-11 18:00:54,622 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 11 variables, input treesize:173, output treesize:179 [2018-04-11 18:00:54,747 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:54,750 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:54,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 131 [2018-04-11 18:00:54,765 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 18:00:54,773 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 119 [2018-04-11 18:00:54,774 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 18:00:54,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 18:00:54,868 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:54,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 18:00:55,018 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:55,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 102 [2018-04-11 18:00:55,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 18:00:55,022 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:55,038 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:55,121 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 93 treesize of output 89 [2018-04-11 18:00:55,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 18:00:55,123 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:55,137 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:55,210 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 18:00:55,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 79 [2018-04-11 18:00:55,212 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 24 treesize of output 14 [2018-04-11 18:00:55,212 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:55,223 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:55,226 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:00:55,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 122 [2018-04-11 18:00:55,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 116 [2018-04-11 18:00:55,239 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:55,273 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:55,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 4 dim-2 vars, End of recursive call: 11 dim-0 vars, and 3 xjuncts. [2018-04-11 18:00:55,328 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 11 variables, input treesize:222, output treesize:253 [2018-04-11 18:00:55,550 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 74 treesize of output 66 [2018-04-11 18:00:55,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 18:00:55,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:55,563 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 18:00:55,563 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 18:00:55,563 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 19 treesize of output 19 [2018-04-11 18:00:55,564 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:55,574 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:55,603 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 96 treesize of output 84 [2018-04-11 18:00:55,604 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 18:00:55,605 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 18:00:55,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2018-04-11 18:00:55,605 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:55,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 18:00:55,621 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:55,632 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:55,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 58 [2018-04-11 18:00:55,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 18:00:55,657 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:55,667 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 18:00:55,667 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 25 treesize of output 20 [2018-04-11 18:00:55,667 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:55,676 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:55,697 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 49 treesize of output 43 [2018-04-11 18:00:55,698 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 18:00:55,698 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 10 [2018-04-11 18:00:55,698 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:55,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 18:00:55,707 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 18:00:55,714 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:00:55,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 18:00:55,733 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 13 variables, input treesize:171, output treesize:43 [2018-04-11 18:00:55,822 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-11 18:00:55,822 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 18:00:55,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-11 18:00:55,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 18:00:55,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 18:00:55,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=256, Unknown=8, NotChecked=0, Total=306 [2018-04-11 18:00:55,823 INFO L87 Difference]: Start difference. First operand 150 states and 160 transitions. Second operand 18 states. [2018-04-11 18:00:57,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:00:57,856 INFO L93 Difference]: Finished difference Result 198 states and 210 transitions. [2018-04-11 18:00:57,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 18:00:57,857 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2018-04-11 18:00:57,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:00:57,857 INFO L225 Difference]: With dead ends: 198 [2018-04-11 18:00:57,857 INFO L226 Difference]: Without dead ends: 198 [2018-04-11 18:00:57,858 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=177, Invalid=977, Unknown=36, NotChecked=0, Total=1190 [2018-04-11 18:00:57,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-04-11 18:00:57,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 152. [2018-04-11 18:00:57,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-04-11 18:00:57,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 162 transitions. [2018-04-11 18:00:57,859 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 162 transitions. Word has length 56 [2018-04-11 18:00:57,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:00:57,859 INFO L459 AbstractCegarLoop]: Abstraction has 152 states and 162 transitions. [2018-04-11 18:00:57,860 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 18:00:57,860 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 162 transitions. [2018-04-11 18:00:57,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-11 18:00:57,860 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:00:57,860 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 18:00:57,860 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 18:00:57,860 INFO L82 PathProgramCache]: Analyzing trace with hash 613514207, now seen corresponding path program 1 times [2018-04-11 18:00:57,860 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 18:00:57,860 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 18:00:57,861 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 18:00:57,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 18:00:57,861 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 18:00:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-11 18:00:57,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-11 18:00:57,900 INFO L421 BasicCegarLoop]: Counterexample might be feasible [2018-04-11 18:00:57,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 06:00:57 BoogieIcfgContainer [2018-04-11 18:00:57,931 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 18:00:57,931 INFO L168 Benchmark]: Toolchain (without parser) took 25011.98 ms. Allocated memory was 402.7 MB in the beginning and 903.3 MB in the end (delta: 500.7 MB). Free memory was 333.6 MB in the beginning and 431.4 MB in the end (delta: -97.8 MB). Peak memory consumption was 402.9 MB. Max. memory is 5.3 GB. [2018-04-11 18:00:57,932 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 402.7 MB. Free memory is still 359.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 18:00:57,932 INFO L168 Benchmark]: CACSL2BoogieTranslator took 264.24 ms. Allocated memory is still 402.7 MB. Free memory was 332.3 MB in the beginning and 305.7 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 5.3 GB. [2018-04-11 18:00:57,933 INFO L168 Benchmark]: Boogie Preprocessor took 42.25 ms. Allocated memory is still 402.7 MB. Free memory was 305.7 MB in the beginning and 303.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-11 18:00:57,933 INFO L168 Benchmark]: RCFGBuilder took 450.60 ms. Allocated memory was 402.7 MB in the beginning and 591.4 MB in the end (delta: 188.7 MB). Free memory was 301.8 MB in the beginning and 514.9 MB in the end (delta: -213.1 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. [2018-04-11 18:00:57,933 INFO L168 Benchmark]: TraceAbstraction took 24252.15 ms. Allocated memory was 591.4 MB in the beginning and 903.3 MB in the end (delta: 312.0 MB). Free memory was 513.5 MB in the beginning and 431.4 MB in the end (delta: 82.1 MB). Peak memory consumption was 394.0 MB. Max. memory is 5.3 GB. [2018-04-11 18:00:57,934 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.16 ms. Allocated memory is still 402.7 MB. Free memory is still 359.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 264.24 ms. Allocated memory is still 402.7 MB. Free memory was 332.3 MB in the beginning and 305.7 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.25 ms. Allocated memory is still 402.7 MB. Free memory was 305.7 MB in the beginning and 303.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 450.60 ms. Allocated memory was 402.7 MB in the beginning and 591.4 MB in the end (delta: 188.7 MB). Free memory was 301.8 MB in the beginning and 514.9 MB in the end (delta: -213.1 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 24252.15 ms. Allocated memory was 591.4 MB in the beginning and 903.3 MB in the end (delta: 312.0 MB). Free memory was 513.5 MB in the beginning and 431.4 MB in the end (delta: 82.1 MB). Peak memory consumption was 394.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1038]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L995] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={12:0}] [L995] SLL* list = malloc(sizeof(SLL)); VAL [list={12:0}, malloc(sizeof(SLL))={12:0}] [L996] FCALL list->next = ((void*)0) VAL [list={12:0}, malloc(sizeof(SLL))={12:0}] [L997] FCALL list->colour = BLACK VAL [list={12:0}, malloc(sizeof(SLL))={12:0}] [L999] SLL* end = list; VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}] [L1002] COND TRUE __VERIFIER_nondet_int() [L1005] EXPR, FCALL malloc(sizeof(SLL)) VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}] [L1005] FCALL end->next = malloc(sizeof(SLL)) VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}] [L1006] EXPR, FCALL end->next VAL [end={12:0}, end->next={11:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}] [L1006] end = end->next [L1007] FCALL end->next = ((void*)0) VAL [end={11:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}] [L1009] COND FALSE !(__VERIFIER_nondet_int()) [L1015] FCALL end->colour = RED VAL [end={11:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}] [L1016] EXPR, FCALL malloc(sizeof(SLL)) VAL [end={11:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1016] FCALL end->next = malloc(sizeof(SLL)) VAL [end={11:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1017] EXPR, FCALL end->next VAL [end={11:0}, end->next={10:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1017] end = end->next [L1018] FCALL end->next = ((void*)0) VAL [end={10:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1019] FCALL end->colour = BLACK VAL [end={10:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1023] end = ((void*)0) [L1024] end = list VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1027] COND FALSE !(!(((void*)0) != end)) VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1027] COND FALSE !(0) VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1028] EXPR, FCALL end->colour VAL [end={12:0}, end->colour=1, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1028] COND FALSE !(!(BLACK == end->colour)) [L1028] COND FALSE !(0) VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1030] COND TRUE ((void*)0) != end VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1032] EXPR, FCALL end->colour VAL [end={12:0}, end->colour=1, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1032] COND FALSE !(RED == end->colour) [L1038] EXPR, FCALL end->next VAL [end={12:0}, end->next={11:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1038] COND FALSE !(!(end->next)) [L1038] COND FALSE !(0) VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1039] EXPR, FCALL end->next VAL [end={12:0}, end->next={11:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1039] end = end->next [L1030] COND TRUE ((void*)0) != end VAL [end={11:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1032] EXPR, FCALL end->colour VAL [end={11:0}, end->colour=0, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1032] COND TRUE RED == end->colour [L1034] EXPR, FCALL end->next VAL [end={11:0}, end->next={10:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1034] end = end->next [L1035] EXPR, FCALL end->next VAL [end={10:0}, end->next={0:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1035] end = end->next [L1038] FCALL end->next - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 124 locations, 49 error locations. UNSAFE Result, 24.2s OverallTime, 23 OverallIterations, 3 TraceHistogramMax, 14.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1614 SDtfs, 5744 SDslu, 6603 SDs, 0 SdLazy, 10549 SolverSat, 669 SolverUnsat, 311 SolverUnknown, 0 SolverNotchecked, 6.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 793 GetRequests, 380 SyntacticMatches, 6 SemanticMatches, 407 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2195 ImplicationChecksByTransitivity, 9.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=178occurred in iteration=16, 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.0s AutomataMinimizationTime, 22 MinimizatonAttempts, 1142 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 1401 NumberOfCodeBlocks, 1401 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 773 ConstructedInterpolants, 336 QuantifiedInterpolants, 1705574 SizeOfPredicates, 179 NumberOfNonLiveVariables, 2034 ConjunctsInSsa, 477 ConjunctsInUnsatCore, 22 InterpolantComputations, 12 PerfectInterpolantSequences, 17/112 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_18-00-57-940.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_18-00-57-940.csv Received shutdown request...